16 search results - page 2 / 4 » The Complexity Of Parsing With Extended Categorial Grammars |
EMNLP
2009
13 years 4 months ago
2009
Recent syntactic extensions of statistical translation models work with a synchronous context-free or tree-substitution grammar extracted from an automatically parsed parallel cor...
ACL
1989
13 years 7 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
ADL
1997
Springer
13 years 10 months ago
1997
Springer
Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text document...
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...
PASTE
2010
ACM
13 years 8 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...