Tree-gram Parsing: Lexical Dependencies and Structural Relations
classification
💻 cs.CL
cs.AIcs.HC
keywords
relationsstructuraldependencieslexicaldisambiguationkindsmodeltree-gram
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.