Abstract
We show that informative lexical categories from a strongly lexicalised formalism such as Combinatory Categorial Grammar (CCG) can improve dependency parsing of Hindi, a free word order language. We first describe a novel way to obtain a CCG lexicon and treebank from an existing dependency treebank, using a CCG parser. We use the output of a supertagger trained on the CCGbank as a feature for a state-of-the-art Hindi dependency parser (Malt). Our results show that using CCG categories improves the accuracy of Malt on long distance dependencies, for which it is known to have weak rates of recovery.
Original language | English |
---|---|
Title of host publication | Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers) |
Place of Publication | Sofia, Bulgaria |
Publisher | Association for Computational Linguistics |
Pages | 604-609 |
Number of pages | 6 |
Publication status | Published - 1 Aug 2013 |