| 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. |
Similar Papers
Max-Margin Incremental CCG Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | a new incremental parser reduces the number of beam search violations and minimises the biggest violation. |
| Approach: | They propose to use beam search optimisation to minimise all beam search violations instead of minimising only the biggest violation. |
| Outcome: | The proposed parser outperforms existing non-incremental parsers and minimises all beam search violations instead of minimising the biggest violation. |
From Partial to Strictly Incremental Constituent Parsing (2024.eacl-short)
Copied to clipboard
| Challenge: | Incremental NLP aims to learn and adapt partial representations as information unfolds, but studies on incremental approaches have focused on non-incremental approaches. |
| Approach: | They build incremental constituent parsers that adhere to a strong definition of incrementality across languages and compare them against non-incremental and partially incremental models. |
| Outcome: | The proposed models are compared against non-incremental and partially incremental models. |
Learned Incremental Representations for Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | a new syntactic representation that commits to syntakic choices is proposed for humans . we use a system that uses only incremental processing of a prefix to predict the word in a sentence . |
| Approach: | They propose a syntactic representation that commits to syntakic choices incrementally . they say the system can achieve 93.72 F1 on the Penn Treebank with as few as 5 bits per word . |
| Outcome: | The proposed representation achieves 93.72 F1 on the Penn Treebank with as few as 5 bits per word . the analysis of the representations shows they have interpretable features and deferred resolution of syntactic ambiguities. |
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. |
A New Representation for Span-based CCG Parsing (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing neural CCG parsing methods do not support CCG derivations that violate the rule schemata. |
| Approach: | They propose a new representation for CCG derivations that decomposes CCG into several independent pieces. |
| Outcome: | The proposed representation decomposes CCG derivations into independent pieces . it prevents span-based models from violating the schemata . |
Enriched In-Order Linearization for Faster Sequence-to-Sequence Constituent Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | Sequence-to-sequence constituent parsing requires a linearization to represent trees as sequences. Top-down tree linearizations have achieved the best accuracy to date. |
| Approach: | They propose to use an in-order shift-reduce linearization instead of a top-down tree linearization to represent trees as sequences. |
| Outcome: | The proposed approach achieves the best accuracy to date on the English PTB dataset among fully-supervised single-model sequence-to-sequence constituent parsers. |
Headed-Span-Based Projective Dependency Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing based on headed spans are available. |
| Approach: | They propose a method for projective dependency parsing based on headed spans. |
| Outcome: | The proposed method achieves state-of-the-art or competitive results on PTB, CTB, and UD Dependency parsing is an important task in natural language processing. |
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. |
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. |
Rule Augmented Unsupervised Constituency Parsing (2021.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have shown that unsupervised parsing methods do not learn meaningful semantics (not even simple grammar) |
| Approach: | They propose an approach that utilizes very generic linguistic knowledge of the language present in the form of syntactic grammar rules and is independent of the base system. |
| Outcome: | The proposed model is independent of the base system and takes advantage of syntactic grammar rules. |