22 search results - page 3 / 5 » Incremental CFG Parsing with Statistical Lexical Dependencie... |
NLPRS
2001
Springer
13 years 10 months ago
2001
Springer
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency gr...
COLING
1996
13 years 7 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
ANLP
1997
13 years 7 months ago
1997
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
ACL
2012
11 years 8 months ago
2012
Prepositions and conjunctions are two of the largest remaining bottlenecks in parsing. Across various existing parsers, these two categories have the lowest accuracies, and mistak...
JMLR
2010
13 years 1 months ago
2010
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...