Linear-Time Modeling of Linguistic Structure: An Order-Theoretic Perspective (2023.emnlp-main)
Copied to clipboard
| Challenge: | a new framework for structured prediction is developed for natural language processing . a systematic approach to structured prediction requires exhaustive pair-wise comparisons of tokens . |
| Approach: | They propose a method that models the relationship between pairs of tokens in a string . they use a parallel method that predicts real numbers for each token in . |
| Outcome: | The proposed method doubles the speed of graph-based dependency parsers and brings 10-times speed-up over graph-driven dependency parses. |
Similar Papers
Autoregressive Structured Prediction with Language Models (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent years have seen a paradigm shift in NLP towards using pretrained language models for a wide range of tasks. |
| Approach: | They propose to model structures as sequences of actions in autoregressive manner with PLMs . their approach allows in-structure dependencies to be learned without any loss . |
| Outcome: | The proposed approach achieves state-of-the-art on all structured prediction tasks. |
Hierarchical Bracketing Encodings Work for Dependency Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Sequence labeling (SL) is a simple yet effective paradigm for a wide range of natural language problems. |
| Approach: | They propose a new bracketing approach for dependency graph parsing that encodes graphs as sequences and n tagging actions. |
| Outcome: | The proposed approach significantly reduces label space while preserving structural information. |
Rethinking Reading Order: Toward Generalizable Document Understanding with LLM-based Relation Modeling (2026.eacl-long)
Copied to clipboard
| Challenge: | Document understanding requires modeling structural and semantic relationships between layout elements within the document without human supervision. |
| Approach: | They propose a cost-effective paradigm that leverages large language models to infer global RO and inter-element layout relations without human supervision. |
| Outcome: | Experiments on Semantic Entity Recognition, Entity Linking, and Document Question Answering show that the proposed model improves on baseline models while preserving the robustness of existing models. |
Improving Event Coreference Resolution by Modeling Correlations between Event Coreference Chains and Document Topic Structures (P18-1)
Copied to clipboard
| Challenge: | a novel approach for event coreference resolution models correlations between event chains and document topical structures. |
| Approach: | They propose a novel approach that models correlations between event coreference chains and document topical structures through an Integer Linear Programming formulation. |
| Outcome: | The proposed approach improves performance across a dataset of document topics . it shows that the models can identify and link event mentions that refer to the same event . |
Severing the Edge Between Before and After: Neural Architectures for Temporal Ordering of Events (2020.emnlp-main)
Copied to clipboard
Miguel Ballesteros, Rishita Anubhai, Shuai Wang, Nima Pourdamghani, Yogarshi Vyas, Jie Ma, Parminder Bhatia, Kathleen McKeown, Yaser Al-Onaizan
| Challenge: | Existing models for temporal ordering of events rely on pretrained representations, transfer and multitask learning, and self-training techniques. |
| Approach: | They propose a neural architecture and a set of training methods for ordering events by predicting temporal relations by pre-training models. |
| Outcome: | The proposed models can predict temporal relations between two pairs of events within a span of text and identify temporal relationships between them. |
On Linearizing Structured Data in Encoder-Decoder Language Models: Insights from Text-to-SQL (2024.naacl-long)
Copied to clipboard
| Challenge: | Structured data is prevalent in tables, databases, and knowledge graphs, but there is a gap in our understanding of how these linearization-based methods handle structured data, which is inherently non-linear. |
| Approach: | They investigate the linear handling of structured data in encoder-decoder language models, specifically T5. |
| Outcome: | The proposed model can mimic human-designed processes such as schema linking and syntax prediction, and it can be compressed due to modality fusion redundancy. |
Graph Refinement for Coreference Resolution (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing models for coreference resolution are based on independent mention pair-wise decisions. |
| Approach: | They propose a model that learns coreference at the document-level and takes global decisions. |
| Outcome: | The proposed model improves over baselines, reinforcing the hypothesis that document-level information improves conference resolution. |
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. |
Leveraging AMR Graph Structure for Better Sequence-to-Sequence AMR Parsing (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent studies on AMR parsing often regard this task as a seq2seq translation problem. |
| Approach: | They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding. |
| Outcome: | The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0. |
On the Role of Pre-trained Language Models in Word Ordering: A Case Study with BART (2022.coling-1)
Copied to clipboard
| Challenge: | Existing work uses linear models and neural networks for word ordering, yet pre-trained language models have not been studied in word ordering. |
| Approach: | They propose a constrained language generation task using unordered words as input. |
| Outcome: | The proposed model is able to perform better than existing models and proves to be reliable. |