International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 115 - Number 5 |
Year of Publication: 2015 |
Authors: B.venkata Seshu Kumari, R. Rajeswara Rao |
10.5120/20146-2275 |
B.venkata Seshu Kumari, R. Rajeswara Rao . Improving Indian Language Dependency Parsing by Combining Transition-based and Graph-based Parsers. International Journal of Computer Applications. 115, 5 ( April 2015), 13-17. DOI=10.5120/20146-2275
We report our dependency parsing experiments on two Indian Languages, Telugu and Hindi. We first explore two most popular dependency parsers namely, Malt parser and MST parser. Considering pros of both these parsers, we develop a hybrid approach combining the output of these two parsers in an intuitive manner. For Hindi, we report our results on test data provided in the for gold standard track of Hindi Shared Task on Parsing at workshop on Machine Translation and parsing in Indian Languages, Coling 2012. Our system secured unlabeled attachment score of 95. 2% and labelled attachment score 90. 7%. For Telugu, we report our results on test data provided in the ICON 2010 Tools Contest on Indian Languages Dependency Parsing. Our system secured unlabeled attachment score of 92. 0% and labelled attachment score 69. 5%.