Paper: Converting Phrase Structures to Dependency Structures in Sanskrit

ACL ID C14-1173
Title Converting Phrase Structures to Dependency Structures in Sanskrit
Venue International Conference on Computational Linguistics
Session Main Conference
Year 2014
Authors

Two annotations schemes for presenting the parsed structures are prevalent viz. the constituency structure and the dependency structure. While the constituency trees mark the relations due to positions, the dependency relations mark the semantic dependencies. Free word order languages like Sanskrit pose more problems for constituency parses since the elements within a phrase are dislocated. In this work, we show how the enriched constituency tree with the information of displacement can help construct the unlabelled dependency tree automatically.