Monday, 1 December 2014

Diwakar Mishra
I have read the article and the comments too. You have presented a balanced and critical view of the idea. I think you would like the proof in support of Sanskrit as well-suited-for-computer language. I have an evidence but I cannot give it as a proof. The reason is that the evidence I refer to here is not attested by the Sanskrit scholars. The evidence is
I have developed fully rule based Grapheme to Phoneme converter as a part of Sanskrit Speech Synthesizer. The converter program, given the rules are correct, gives perfect output (100% accuracy). The rules are extracted based on the observational study of Sanskrit speech, and on the bases of different instruction how to correctly pronounce Sanskrit. The rules are also attested by shastraic quotes.
It is not a proof due to the condition “given the rules are correct”. This tool can be presented as a proof only if the rules are attested by the scholars to be true, practically and traditionally. For now, their correctness is self proclaimed. If it is attested as a proof, then it will be small but significant proof of “Sanskrit is well suited language for computer”. It is notable that no other language has this module fully rule based. Most languages rely on the pronunciation lexicon largely for exceptions.

No comments: