Incremental parsing with monotonic adjoining operation

Authors:
Yoshihide Kato;Shigeki Matsubara
Affiliations:
Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Japan;Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Japan
Venue:
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Year:
2009

Citing 7
Cited 0

An architecture for more realistic conversational systems

Proceedings of the 6th international conference on Intelligent user interfaces
Head-driven statistical models for natural language parsing

Head-driven statistical models for natural language parsing
Probabilistic top-down parsing and language modeling

Computational Linguistics
Robust garden path parsing

Natural Language Engineering
Compact non-left-recursive grammars using the selective left-corner transform and factoring

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Incremental parsing with the perceptron algorithm

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Stochastically evaluating the validity of partial parse trees in incremental parsing

IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. This paper further proposes a restricted version of the adjoining operation, which preserves lexical dependencies of partial parse trees. Our experimental results showed that the restriction enhances the accuracy of the incremental parsing.