116 search results - page 14 / 24 » An Efficient Parsing Algorithm for Tree Adjoining Grammars |
ACL
2009
14 years 9 months ago
2009
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
CEC
2010
IEEE
15 years 23 days ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
72
Voted
WIA
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
EMNLP
2007
15 years 1 months ago
2007
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...