Supertagging-based Parsing with Linear Context-free Rewriting Systems (2021.naacl-main)
Copied to clipboard
| Challenge: | a new supertagging-based parser for linear context-free rewriting systems is developed for discontinuous constituents . discontinuous constituencies span non-contiguous sets of positions in a sentence, and can be modelled by CFG . |
| Approach: | They propose a supertagging-based parser for linear context-free rewriting systems . they propose an efficient procedure which induces a lexical LCFRS from any discontinuous treebank . |
| Outcome: | The proposed method outperforms previous LCFRS-based parsers in accuracy and speed by a wide margin. |
Similar Papers
Improving the Extraction of Supertags for Constituency Parsing with Linear Context-Free Rewriting Systems (2022.findings-emnlp)
Copied to clipboard
| Challenge: | a new approach to parsing discontinuous constituency structures uses supertags to improve parsability . traditional approaches use grammar formalisms to model hierarchies of noncontiguous phrases . but supertags are still useful for analyzing these grammars and parsers . |
| Approach: | They propose to reformulate and parameterize extraction process for LCFRS supertags to improve parsing quality. |
| Outcome: | The proposed method improves the quality and speed of parsing with supertags over the previous method. |
Revisiting Supertagging for faster HPSG parsing (2024.emnlp-main)
Copied to clipboard
| Challenge: | a new supertagger for HPSG-based treebanks is used to improve parsing speed and accuracy. |
| Approach: | They propose to integrate the best supertagger into an HPSG-based parser and compare it to an existing system. |
| Outcome: | The proposed system achieves 97.26% accuracy on 950 sentences from WSJ23 and 93.88% on the out-of-domain technical essay The Cathedral and the Bazaar. |
German and French Neural Supertagging Experiments for LTAG Parsing (P18-3)
Copied to clipboard
| Challenge: | Lexicalized Tree Adjoining Grammars are a linguistically motivated grammar formalism that allows parsers to express linguistic generalizations that are not captured by statistical parsing. |
| Approach: | They propose a supertagging approach combined with deep learning to extract LTAG supertags from the French Treebank and propose n-best supertailing for German and French. |
| Outcome: | The proposed supertagging approach is able to extract LTAG supertags from the French Treebank and n-best supertracking for German and German. |
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. |
Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference (2020.acl-main)
Copied to clipboard
| Challenge: | Using custom architectures, constituency parsers are limited and require specialized hardware. |
| Approach: | They propose an algorithm that assigns labels to each word in a sentence in parallel and then performs a reconciliation phase to extract a tree in (empirically) linear time. |
| Outcome: | The proposed model achieves 95.4 F1 on the WSJ test set while also achieving substantial speedups compared to current state-of-the-art parsers with comparable accuracies. |
Structural generalization in COGS: Supertagging is (almost) all you need (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have shown that neural networks fail to generalize on out-of-distribution examples. |
| Approach: | They extend a neural graph-based parsing framework to address compositional generalization limitations . they introduce a supertagging step with valency constraints and reduce the graph prediction problem . |
| Outcome: | The proposed approach improves results on COGS datasets that require structural generalization. |
Supertagging the Long Tail with Tree-Structured Decoding of Complex Categories (2021.tacl-1)
Copied to clipboard
| Challenge: | Combinatory Categorial Grammar (CCG) parsers operate as a pipeline with a large search space of complex 'supertags' . |
| Approach: | They propose to use CCG supertags to generate CCG categories that have never been seen in training and to use tree-structured prediction to account for their internal structure. |
| Outcome: | The proposed model recovers a fraction of the long-tail supertags while approximating the state of the art in overall tag accuracy with fewer parameters. |
LLM-supertagger: Categorial Grammar Supertagging via Large Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies have shown that LLMs are underperforming in classification tasks due to their decoder-based nature. |
| Approach: | They propose a method that significantly boosts LLMs' performance in supertagging for both Combinatory Categorial Grammar (CCG) and Lambek Categorian Grammar (LCG). |
| Outcome: | The proposed method outperforms LSTM and encoder-based models and achieves state-of-the-art performance. |
Statistical Parsing of Tree Wrapping Grammars (2020.coling-main)
Copied to clipboard
| Challenge: | Using tree-wrapping grammars, we propose a statistical parsing algorithm for the grammar. |
| Approach: | They propose a statistical parsing algorithm based on neural supertagging and A* parse for Tree-Wrapping Grammars (TWG) they extract a grammar for English from constituency treebanks and discuss first parser results with this grammar. |
| Outcome: | The proposed algorithm is based on neural supertagging and A* parsing. |
End-to-End Graph-Based TAG Parsing with Neural Networks (N18-1)
Copied to clipboard
| Challenge: | Using BiLSTMs, highway connections, and character-level CNNs, we propose a graph-based Tree Adjoining Grammar (TAG) parser. |
| Approach: | They propose a graph-based Tree Adjoining Grammar parser that uses BiLSTMs, highway connections, and character-level CNNs. |
| Outcome: | The proposed parser outperforms the previously reported best by more than 2.2 LAS and UAS points. |