For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Incremental Parsing with Adjoining Operation
Yoshihide KATO Shigeki MATSUBARA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/12/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Natural Language Processing and its Applications)
Category: Morphological/Syntactic Analysis
incremental parsing, tree adjoining grammar, probabilistic parsing, Penn Treebank, real-time spoken language processing system,
Full Text: PDF(378.7KB)
>>Buy this Article
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity. 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.