Converting phrase structures to dependency structures in Sanskrit
Converting phrase structures to dependency structures in Sanskrit
dc.contributor.author | Goyal, Pawan | |
dc.contributor.author | Kulkarni, Amba | |
dc.date.accessioned | 2022-03-27T02:01:58Z | |
dc.date.available | 2022-03-27T02:01:58Z | |
dc.date.issued | 2014-01-01 | |
dc.description.abstract | 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. | |
dc.identifier.citation | COLING 2014 - 25th International Conference on Computational Linguistics, Proceedings of COLING 2014: Technical Papers | |
dc.identifier.uri | https://dspace.uohyd.ac.in/handle/1/4502 | |
dc.title | Converting phrase structures to dependency structures in Sanskrit | |
dc.type | Conference Proceeding. Conference Paper | |
dspace.entity.type |
Files
License bundle
1 - 1 of 1