Probabilistic Treatment for Syntactic Gaps in Analytic Language Parsing
Summary :
This paper presents a syntax-based framework for gap resolution in analytic languages. CCG, reputable for dealing with deletion under coordination, is extended with a memory mechanism similar to the slot-and-filler mechanism, resulting in a wider coverage of syntactic gaps patterns. Though our grammar formalism is more expressive than the canonical CCG, its generative power is bounded by Partially Linear Indexed Grammar. Despite the spurious ambiguity originated from the memory mechanism, we also show that its probabilistic parsing is feasible by using the dual decomposition algorithm.
- Publication
- IEICE TRANSACTIONS on Information Vol.E94-D No.3 pp.440-447
- Publication Date
- 2011/03/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E94.D.440
- Type of Manuscript
- Special Section PAPER (Special Section on Knowledge Discovery, Data Mining and Creativity Support System)
- Category
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
Prachya BOONKWAN, Thepchai SUPNITHI, "Probabilistic Treatment for Syntactic Gaps in Analytic Language Parsing" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 3, pp. 440-447, March 2011, doi: 10.1587/transinf.E94.D.440.
Abstract: This paper presents a syntax-based framework for gap resolution in analytic languages. CCG, reputable for dealing with deletion under coordination, is extended with a memory mechanism similar to the slot-and-filler mechanism, resulting in a wider coverage of syntactic gaps patterns. Though our grammar formalism is more expressive than the canonical CCG, its generative power is bounded by Partially Linear Indexed Grammar. Despite the spurious ambiguity originated from the memory mechanism, we also show that its probabilistic parsing is feasible by using the dual decomposition algorithm.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.440/_p
Copy
@ARTICLE{e94-d_3_440,
author={Prachya BOONKWAN, Thepchai SUPNITHI, },
journal={IEICE TRANSACTIONS on Information},
title={Probabilistic Treatment for Syntactic Gaps in Analytic Language Parsing},
year={2011},
volume={E94-D},
number={3},
pages={440-447},
abstract={This paper presents a syntax-based framework for gap resolution in analytic languages. CCG, reputable for dealing with deletion under coordination, is extended with a memory mechanism similar to the slot-and-filler mechanism, resulting in a wider coverage of syntactic gaps patterns. Though our grammar formalism is more expressive than the canonical CCG, its generative power is bounded by Partially Linear Indexed Grammar. Despite the spurious ambiguity originated from the memory mechanism, we also show that its probabilistic parsing is feasible by using the dual decomposition algorithm.},
keywords={},
doi={10.1587/transinf.E94.D.440},
ISSN={1745-1361},
month={March},}
Copy
TY - JOUR
TI - Probabilistic Treatment for Syntactic Gaps in Analytic Language Parsing
T2 - IEICE TRANSACTIONS on Information
SP - 440
EP - 447
AU - Prachya BOONKWAN
AU - Thepchai SUPNITHI
PY - 2011
DO - 10.1587/transinf.E94.D.440
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2011
AB - This paper presents a syntax-based framework for gap resolution in analytic languages. CCG, reputable for dealing with deletion under coordination, is extended with a memory mechanism similar to the slot-and-filler mechanism, resulting in a wider coverage of syntactic gaps patterns. Though our grammar formalism is more expressive than the canonical CCG, its generative power is bounded by Partially Linear Indexed Grammar. Despite the spurious ambiguity originated from the memory mechanism, we also show that its probabilistic parsing is feasible by using the dual decomposition algorithm.
ER -
English
