Tree-gram Parsing: Lexical Dependencies and Structural Relations

Simple item page
dc.creatorSima'an, Khalil
dc.date2000-11-06
dc.date.accessioned2026-07-07T03:16:41Z
dc.date.available2026-07-07T03:16:41Z
dc.descriptionThis 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.
dc.description8 pages. Appeared in Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (ACL'00), Hong Kong, China
dc.identifierhttps://arxiv.org/abs/cs/0011007
dc.identifierhttp://arxiv.org/abs/cs/0011007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30447
dc.subjectComputation and Language
dc.subjectArtificial Intelligence
dc.subjectHuman-Computer Interaction
dc.subjectI.2; K.3.2; J.5
dc.titleTree-gram Parsing: Lexical Dependencies and Structural Relations
dc.typetext

Files

Collections

arXiv