Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Parsing discontinuous constituents in dependency grammar
Computational Linguistics
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Computational Complexity and Natural Language
Computational Complexity and Natural Language
Parsing a free-word order language: warlpiri
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A Graph Based Method for Building Multilingual Weakly Supervised Dependency Parsers
GoTAL '08 Proceedings of the 6th international conference on Advances in Natural Language Processing
Analysis of Sanskrit Text: Parsing and Semantic Relations
Sanskrit Computational Linguistics
Automated translation of Indian languages
Communications of the ACM - Amir Pnueli: Ahead of His Time
ALR7 Proceedings of the 7th Workshop on Asian Language Resources
Two stage constraint based hybrid approach to free word order language dependency parsing
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Simple parser for Indian languages in a dependency framework
ACL-IJCNLP '09 Proceedings of the Third Linguistic Annotation Workshop
Improving data driven dependency parsing using clausal information
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Tamil dependency parsing: results using rule based and corpus based approaches
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Experiments on POS tagging and data driven dependency parsing for Telugu language
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
| Hi-index | 0.00 |
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more efficient. Second, such a formalism is also likely to be linguistically more elegant and satisfying. In this paper, we describe such a formalism, called the Paninian framework, that has been successfully applied to Indian languages.This paper shows that the Paninian framework applied to modern Indian languages gives an elegant account of the relation between surface form (vibhakti) and semantic (karaka) roles. The mapping is elegant and compact. The same basic account also explains active-passives and complex sentences. This suggests that the solution is not just adhoc but has a deeper underlying unity.A constraint based parser is described for the framework. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints. Efficient solutions are known for these problems.It is interesting to observe that such a parser (designed for free word order languages) compares well in asymptotic time complexity with the parser for context free grammars (CFGs) which are basically designed for positional languages.