Incremental Parsing with Adjoining Operation
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.12 pp.2306-2312
- Publication Date
- 2009/12/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E92.D.2306
- Type of Manuscript
- Special Section PAPER (Special Section on Natural Language Processing and its Applications)
- Category
- Morphological/Syntactic Analysis
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yoshihide KATO, Shigeki MATSUBARA, "Incremental Parsing with Adjoining Operation" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 12, pp. 2306-2312, December 2009, doi: 10.1587/transinf.E92.D.2306.
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. 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.2306/_p
Copy
@ARTICLE{e92-d_12_2306,
author={Yoshihide KATO, Shigeki MATSUBARA, },
journal={IEICE TRANSACTIONS on Information},
title={Incremental Parsing with Adjoining Operation},
year={2009},
volume={E92-D},
number={12},
pages={2306-2312},
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. 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.},
keywords={},
doi={10.1587/transinf.E92.D.2306},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Incremental Parsing with Adjoining Operation
T2 - IEICE TRANSACTIONS on Information
SP - 2306
EP - 2312
AU - Yoshihide KATO
AU - Shigeki MATSUBARA
PY - 2009
DO - 10.1587/transinf.E92.D.2306
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2009
AB - 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.
ER -
English
