Tree-gram Parsing: Lexical Dependencies and Structural Relations
Computation and Language
2007-05-23 v1 Artificial Intelligence
Human-Computer Interaction
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
@article{arxiv.cs/0011007,
title = {Tree-gram Parsing: Lexical Dependencies and Structural Relations},
author = {Khalil Sima'an},
journal= {arXiv preprint arXiv:cs/0011007},
year = {2007}
}
Comments
8 pages. Appeared in Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (ACL'00), Hong Kong, China