Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation

06/05/2019
by   Masashi Yoshikawa, et al.
0

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 96.8

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2015

Parsing as Reduction

We reduce phrase-representation parsing to dependency parsing. Our reduc...
research
04/24/2017

Robust Incremental Neural Semantic Graph Parsing

Parsing sentences to linguistically-expressive semantic representations ...
research
06/23/2020

Domain Adaptation for Semantic Parsing

Recently, semantic parsing has attracted much attention in the community...
research
02/13/2019

Leveraging Newswire Treebanks for Parsing Conversational Data with Argument Scrambling

We investigate the problem of parsing conversational data of morphologic...
research
09/09/2021

A Derivative-based Parser Generator for Visibly Pushdown Grammars

In this paper, we present a derivative-based, functional recognizer and ...
research
05/20/2021

Head-driven Phrase Structure Parsing in O(n^3) Time Complexity

Constituent and dependency parsing, the two classic forms of syntactic p...
research
12/14/2021

Maximum Bayes Smatch Ensemble Distillation for AMR Parsing

AMR parsing has experienced an unprecendented increase in performance in...

Please sign up or login with your details

Forgot password? Click here to reset