Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing (C18-1)
Copied to clipboard
| Challenge: | a split/merge algorithm for interpreted regular tree grammars is a generalization of Petrov et al. (2006) . |
| Approach: | They propose to use a split/merge algorithm for interpreted regular tree grammars to refine a large class of grammar formalisms. |
| Outcome: | The proposed algorithm captures a large class of grammar formalisms and is able to refine natural sets of nonterminals. |
Similar Papers
Discontinuous Constituent Parsing as Sequence Labeling (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to discontinuous parsing are complex and low-level. |
| Approach: | They propose to encode discontinuities as nearly ordered permutations of the input sequence. |
| Outcome: | The proposed model is fast and accurate under the right representation. |
Discontinuous Combinatory Constituency Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Discontinuous parsing is more challenging than continuous parsers because children can group with syntactic cousins in the sentence rather than its two adjacent neighbors. |
| Approach: | They extend a pair of combinator-based constituency parsers into a discontinuous pair . they use a swap action and biaffine attention to iteratively compose constituent vectors from word embeddings without any grammar constraints. |
| Outcome: | The proposed parsers achieve state-of-the-art discontinuous accuracy with a significant speed advantage over continuous parsing. |
Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars (2023.acl-long)
Copied to clipboard
| Challenge: | a recent study shows that context-free grammars are not natural for modeling discontinuous language phenomena such as extrapositions and cross-serial dependencies. |
| Approach: | They propose a grammar induction approach with mildly context-sensitive grammars for unsupervised discontinuous parsing. |
| Outcome: | Experiments on German and Dutch show that the proposed grammar induction method is beneficial for unsupervised parsing. |
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. |
Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars (N19-1)
Copied to clipboard
| Challenge: | Constituent parsing has been studied extensively in the last decades. |
| Approach: | They propose to decompose a language into a regular language, a homomorphism, and a bracket language to divide the parsing problem into simpler subproblems. |
| Outcome: | The proposed approach is comparable to state-of-the-art grammar-based parsers. |
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) (2024.acl-tutorials)
Copied to clipboard
| Challenge: | ACL tutorial session is a highlight of the conference . it aims to provide attendees with a thorough introduction to key topics in our fast-evolving research field . |
| Approach: | the ACL tutorial session is a highlight of the conference . it aims to provide attendees with a thorough introduction to key topics in the field . |
| Outcome: | the ACL tutorial session is a highlight of the conference . the review process involved multiple conferences and three reviewers . |
Transactions of the Association for Computational Linguistics, Volume 8 (2020.tacl-1)
Copied to clipboard
| Challenge: | null |
| Approach: | null |
| Outcome: | null |
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) (2025.acl-tutorials)
Copied to clipboard
| Challenge: | ACL 2025 tutorial sessions are a cornerstone event of the conference . 76 tutorial submissions were received this year, many of which were very engaging . |
| Approach: | 76 tutorial submissions were received this year for the tutorial session at ACL 2025 . the tutorials are designed to equip you with the latest insights, tools, and methodologies . |
| Outcome: | the tutorial sessions at ACL 2025 will be held in london on november 8 . the conference received 76 tutorial submissions this year . |
To Split or Not to Split: Composing Compounds in Contextual Vector Spaces (2023.emnlp-main)
Copied to clipboard
| Challenge: | Contextual word embedding models rely on sub-word tokenization to represent single orthographic words but are often suboptimal in under-resourced contexts. |
| Approach: | They propose to use a masked language modelling task to evaluate the model's performance . they use re-trained tokenizers to pre-split compounds into constituents . |
| Outcome: | The proposed models improve on the masked language modelling task and compositionality prediction by pre-splitting compounds into constituents. |
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) (2026.acl-tutorials)
Copied to clipboard
| Challenge: | 61 submissions were received for the tutorials at ACL 2026 . |
| Approach: | 61 tutorials were submitted for the joint call for proposals with EACL . the call for submissions was a highly competitive selection process . |
| Outcome: | 61 submissions were received for the tutorial session at the conference this year . the tutorials cover a range of topics that have moved to the forefront of NLP research in 2026 . |