Abstract
The paper sets out a prima facie case for the claim that the classification of Sanskrit compounds in Pāinian tradition can be retrieved from a very slight augmentation of the usual enriched context free rules. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
APA
Gillon, B. S. (2009). Sanskrit Computational Linguistics. (A. Kulkarni & G. Huet, Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5406, pp. 98–105). Springer Berlin Heidelberg. Retrieved from http://link.springer.com/10.1007/978-3-540-93885-9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free