Computer Science – Computation and Language
Scientific paper
2000-11-06
Computer Science
Computation and Language
8 pages. Appeared in Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (ACL'00), Hong Ko
Scientific paper
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.
No associations
LandOfFree
Tree-gram Parsing: Lexical Dependencies and Structural Relations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tree-gram Parsing: Lexical Dependencies and Structural Relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree-gram Parsing: Lexical Dependencies and Structural Relations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-707867