226 search results - page 9 / 46 » Parsing with the Shortest Derivation |
ACL
1998
13 years 11 months ago
1998
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
ACL
1996
13 years 11 months ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
NAACL
2010
13 years 7 months ago
2010
There is significant evidence in the literature that integrating knowledge about multiword expressions can improve shallow parsing accuracy. We present an experimental study to qu...
ACL
2009
13 years 7 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...
ENTCS
2008
13 years 10 months ago
2008
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...