Abstract
This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation capabilities. It presents a new model based on structural relations, the Tree-gram model, and reports experiments showing that structural relations should benefit from enrichment by lexical dependencies.
Cite
CITATION STYLE
Sima’an, K. (2000). Tree-gram parsing lexical dependencies and structural relations. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 2000-October). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1075218.1075226
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.