Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation (P19-1)
Copied to clipboard
| Challenge: | Existing methods for Combinatory Categorial Grammar (CCG) parsing are limited to a specific parser architecture, making it non-trivial to apply to current parsers. |
| Approach: | They propose a domain adaptation method for Combinatory Categorial Grammar (CCG) they propose to generate CCG corpora using cheaper dependency trees. |
| Outcome: | The proposed method improves on speech conversation and math problems. |
Similar Papers
Development of a Multilingual CCG Treebank via Universal Dependencies Conversion (2022.lrec-1)
Copied to clipboard
| Challenge: | Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism that can capture both syntactic and semantic information. |
| Approach: | They propose an algorithm to convert UD treebanks to CCG treebank and propose future extensions. |
| Outcome: | The proposed algorithm performs lexical, sentential, and syntactic rule coverage analysis, as well as CCG parsing experiments. |
LCGbank: A Corpus of Syntactic Analyses Based on Proof Nets (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent studies have focused on statistical syntactic parsing with proof nets . however, there has been a paucity of corpora in formalisms for which proof net is applicable . |
| Approach: | They propose a corpus of syntactic analyses based on Lambek categorial grammar . they leverage the relationship between LCG and CCG to address this problem . |
| Outcome: | The proposed method exploits the relationship between LCG and CCG to build an English-language corpus of syntactic analyses based on proof nets . the results suggest that the proposed method is weakly context-free equivalent and NP-complete . |
Cross-lingual CCG Induction (N19-1)
Copied to clipboard
| Challenge: | Combinatory categorial grammars are linguistically motivated and useful for semantic parsing, but costly to acquire in a supervised way and difficult to acquire unsupervised. |
| Approach: | They propose an alternative using a source-language parser and a parallel corpus to induce a grammar and parsing model for a target language. |
| Outcome: | The proposed model outperforms POS tags on 3 out of 8 languages and unsupervised CCG induction on 6 out of 8. |
Integrating Headedness Information into an Auto-generated Multilingual CCGbank for Improved Semantic Interpretation (2024.lrec-main)
Copied to clipboard
| Challenge: | Combinatory Categorial Grammar is a grammar formalism that provides a transparent interface between syntax and semantics. |
| Approach: | They propose an algorithm that adds semantic representations to existing CCG derivations by combining them with predefined combinatory rules. |
| Outcome: | The proposed method produces bare CCG derivations without any accompanying semantic representations and limits its general applicability. |
Extending a Parser to Distant Domains Using a Few Dozen Partially Annotated Examples (P18-1)
Copied to clipboard
| Challenge: | Statistical parsers are often criticized for their performance outside of the domain they were trained on . we show that word representations reduce the need for domain adaptation when the target domain is syntactically similar to the source domain. |
| Approach: | They propose a way to adapt a parser to a syntactically similar target domain using partial annotations. |
| Outcome: | The proposed model increases the accuracy of a parser on the Wall Street Journal by 1.7% over the previous state-of-the-art model. |
CCG Parsing Algorithm with Incremental Tree Rotation (N19-1)
Copied to clipboard
| Challenge: | Combinatory Categorial Grammar (CCG) is a mildly context sensitive grammar formalism that excels in incremental sentence processing. |
| Approach: | They propose a new incremental parsing algorithm that uses a syntactic approach . it uses right-branching constituent structures and optional constituents that adjoin on the right . |
| Outcome: | The proposed algorithm can cover the whole CCGbank with greater incrementality and accuracy than previous proposals. |
Unsupervised Domain Adaptation for Keyphrase Generation using Citation Contexts (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for keyphrase generation are limited to resource-rich languages. |
| Approach: | They propose to extract silver-standard keyphrases from citation contexts to create synthetic labeled data for domain adaptation. |
| Outcome: | The proposed method produces significant and consistent improvements over baselines across three domains. |
A Generative Model for Lambek Categorial Sequents (2024.lrec-main)
Copied to clipboard
| Challenge: | generative models such as PLC+ generate grammatical sentences with a high probability of being grammatized. |
| Approach: | They propose a generative model, PLC+, for generating Lambek Categorial Grammar(LCG) sequents. |
| Outcome: | The proposed model generates Lambek Categorial Grammar(LCG) sequents and is more robust to probabilistic context-free grammars. |
Semi-supervised Domain Adaptation for Dependency Parsing via Improved Contextualized Word Representations (2020.coling-main)
Copied to clipboard
| Challenge: | Recent advances in deep neural network models have improved parsing performance on in-domain texts . however, the problem is to improve performance on out-of-domain text data when there is only a small-scale out-domain labeled data. |
| Approach: | They propose to use adversarial learning and fine-tuning BERT to improve contextualized word representations on out-of-domain texts. |
| Outcome: | The proposed models achieve consistent improvement and fine-tune BERT processes boost parsing accuracy by a large margin. |
Unsupervised Cross-Lingual Adaptation of Dependency Parsers Using CRF Autoencoders (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work on cross-lingual adaptation of dependency parsers without annotated target corpora focuses on discriminative source parser ignoring unannotated corporata . |
| Approach: | They propose to use unsupervised discriminative parsers to adapt dependency parser to unannotated target corpora without a supervised generative parsing method. |
| Outcome: | The proposed method significantly outperforms previous methods. |