30 search results - page 2 / 6 » Fast Parsing Using Pruning and Grammar Specialization |
IJCNLP
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
JACM
2002
13 years 5 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
EMNLP
2004
13 years 6 months ago
2004
Most statistical parsers have used the grammar induction approach, in which a stochastic grammar is induced from a treebank. An alternative approach is to induce a controller for ...
ADL
1997
Springer
13 years 9 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...
ACL
2006
13 years 6 months ago
2006
In this paper we investigate the benefit of stochastic predictor components for the parsing quality which can be obtained with a rule-based dependency grammar. By including a chun...