Deterministic shift-reduce parsing for unification-based grammars

Authors:
Takashi Ninomiya;Takuya Matsuzaki;Nobuyuki Shimizu;Hiroshi Nakagawa
Affiliations:
Graduate school of science and engineering, ehime university, 3 bunkyo-cho, matsuyama, ehime 790-8577, japan e-mail: ninomiya@cs.ehime-u.ac.jp;Graduate school of information science and technology, the university of tokyo, 7-3-1 hongo, bunkyo-ku, tokyo 113-0033, japan e-mail: matuzaki@is.s.u-tokyo.ac.jp;Information technology center, the university of tokyo, 7-3-1 hongo, bunkyo-ku, tokyo 113-0033, japan e-mail: shimizu@r.dl.itc.u-tokyo.ac.jp, n3@dl.itc.u-tokyo.ac.jp;Information technology center, the university of tokyo, 7-3-1 hongo, bunkyo-ku, tokyo 113-0033, japan e-mail: shimizu@r.dl.itc.u-tokyo.ac.jp, n3@dl.itc.u-tokyo.ac.jp
Venue:
Natural Language Engineering
Year:
2011

Citing 0
Cited 2

Shift-reduce CCG parsing

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
CuteForce: deep deterministic HPSG parsing

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 derives from the restriction of locality in the packed parse forest. Deterministic parsing is one solution that can achieve simple and fast parsing without the mechanisms of the packed parse forest by accurately choosing search paths. We propose new deterministic shift-reduce parsing and its variants for unification-based grammars. Deterministic parsing cannot simply be applied to unification-based grammar parsing, which often fails because of its hard constraints. Therefore, this is developed by using default unification, which almost always succeeds in unification by overwriting inconsistent constraints in grammars.