Open AccessAnalyzing Parser Errors
Author(s) -
Samar Husain,
Bhasha Agrawal
Publication year - 2012
Publication title -
linguistic issues in language technology
Language(s) - English
Resource type - Journals
eISSN - 1945-3590
pISSN - 1945-3604
DOI - 10.33011/lilt.v7i.1283
Subject(s) - treebank , computer science , parsing , natural language processing , artificial intelligence , dependency (uml) , dependency grammar , hindi , lr parser , top down parsing , parser combinator , point (geometry) , geometry , mathematics
We present a detailed error analysis of a transition-based dependency parser trained on a Hindi dependency treebank. Parser error analysis has not been systematically examined from the point of view of treebanking before and this work intends to contribute in this area.
We address two main questions in this paper:
Can the parsing of certain structures be made easier by using alternative analyses for these structures?
Are there certain linguistic cues implicit (or missing) in the current treebank that can be made explicit (or added) in order to make the parsing of complex constructions easier?
These questions will guide us in examining the potential benefits of parser error analysis during treebanking. Through our experiments and analysis we were able to shed light on the causes of errors and subsequently have been able to improve the performance of the parser.