Apr 3, 2009 · In this paper, we investigate shift-reduce pars- ing approach for unification-based grammars without the mechanisms of the packed parse for- est ...

Oct 21, 2010 · A unification-based grammar is defined as a pair consisting of a set of lexical entries and a set of grammar rules. The lexical entries express ...

We propose (i) deterministic shift-reduce parsing for unification-based grammars, and (ii) best-first shift-reduce parsing with beam thresholding for ...

Many parsing techniques assume the use of a packed parse forest to enable efficient and accurate parsing. However, they suffer from an inherent problem that ...

This work proposes new deterministic shift-reduce parsing and its variants for unification-based grammars and uses default unification, which almost always ...

We propose new deterministic shift-reduce parsing and its variants for unification-based grammars. Deterministic parsing cannot simply be applied to unification ...

We propose new deterministic shift-reduce parsing and its variants for unification-based grammars. Deterministic parsing cannot simply be applied to unification ...

We propose (i) deter- ministic shift-reduce parsing for unifica- tion-based grammars, and (ii) best-first shift-reduce parsing with beam threshold- ing for ...

Fingerprint. Dive into the research topics of 'Deterministic shift-reduce parsing for unification-based grammars'. Together they form a unique fingerprint.

Deterministic shift-reduce parsing for unification-based grammars by using default unification. In Proceedings of. EACL-09, pages 603–611, Athens, Greece ...