Probabilistic Treatment for Syntactic Gaps in Analytic Language Parsing

Prachya BOONKWAN  Thepchai SUPNITHI  

IEICE TRANSACTIONS on Information and Systems   Vol.E94-D   No.3   pp.440-447
Publication Date: 2011/03/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E94.D.440
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Knowledge Discovery, Data Mining and Creativity Support System)
combinatory categorial grammar,  mildly context-sensitive grammar,  syntactic gap resolution,  analytic language,  probabilistic parsing,  dual decomposition,  

Full Text: PDF>>
Buy this Article

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.