Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
We propose a new domain adaptation method for Combinatory Categorial Grammar (CCG) parsing, based on the idea of automatic generation of CCG corpora exploiting cheaper resources of dependency trees. Our solution is conceptually simple, and not relying on a specific parser architecture, making it applicable to the current best-performing parsers. We conduct extensive parsing experiments with detailed discussion; on top of existing benchmark datasets on (1) biomedical texts and (2) question sentences, we create experimental datasets of (3) speech conversation and (4) math problems. When applied to the proposed method, an off-the-shelf CCG parser shows significant performance gains, improving from 90.7% to 96.6% on speech conversation, and from 88.5% to 96.8% on math problems.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 5 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Modality and Negation in Event Extractioncited by 6
- 2021Modality and Negation in Event Extraction20 Sep 2021