Tree-gram Parsing: Lexical Dependencies and Structural Relations

2000/11/06 by Khalil Sima'an, Sima'an, Khalil · 1 citation
Computer Science · #Artificial Intelligence (cs.AI) #Computation and Language (cs.CL) #FOS: Computer and information sciences #Human-Computer Interaction (cs.HC) #I.2 #J.5 #K.3.2 #cs.AI #cs.CL #cs.HC

paper · pdf · doi:10.48550/arxiv.cs/0011007

8 pages. Appeared in Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (ACL'00), Hong Kong, China

arxiv created 2000/11/06 · arxiv updated 2009/11/30

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.

Cited by

• Explaining BiomedCLIP with Weighted Banzhaf Interactions Supported by Tree-Gram Parsing

Related

• A Probabilistic Disambiguation Method Based on Psycholinguistic Principles
• Quantifying syntax similarity with a polynomial representation of dependency trees
• Parsing as Reduction
• Richer Syntactic Dependencies for Structured Language Modeling
• A Fundamental Algorithm for Dependency Parsing (With Corrections)