Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The algorithmic beauty of plants
The algorithmic beauty of plants
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Java Virtual Machine Specification
Java Virtual Machine Specification
Programming Perl
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Computer Simulation of Aṣṭ ādhyā yī: Some Insights
Sanskrit Computational Linguistics
| Hi-index | 0.00 |
The most authoritative description of the morphophonemic rules that apply at word boundaries (external sandhi) in Sanskrit is by the great grammarian Pānini (fl. 5th c. b. c. e.). These rules are stated formally in Pānini's grammar, the Aṣṭ ādhyā yī 'group of eight chapters'. The present paper summarizes Pānini's handling of sandhi, his notational conventions, and formal properties of his theory. An XML vocabulary for expressing Pānini's rules is introduced and the application to morphophonemic rules demonstrated. Although Pānini's notation potentially exceeds a finite state grammar in power, individual rules do not rewrite their own output, and thus they may be automatically translated into a rule cascade from which a finite state transducer can be compiled.