| Challenge: | a typical approach to natural language processing tasks involves selecting text spans and making decisions about them. |
| Approach: | They propose a grammar-based structured span selection model which learns to make use of partial span annotations. |
| Outcome: | The proposed model improves on two popular span prediction tasks. |
Similar Papers
A Span Selection Model for Semantic Role Labeling (D18-1)
Copied to clipboard
| Challenge: | Existing models for semantic role labeling use BIO tags to predict argument spans . but performance of these approaches is weak . |
| Approach: | They propose a span-based model that takes into account all possible argument spans and scores them for each label. |
| Outcome: | The proposed model achieves state-of-the-art results on the CoNLL-2005 and 2012 datasets. |
SpanPredict: Extraction of Predictive Document Spans with Neural Attention (2021.naacl-main)
Copied to clipboard
| Challenge: | identifying predictive text in clinical notes can be as important as the predictions themselves . identifying specific content in clinical note descriptions may illuminate previously unknown risk factors . |
| Approach: | They propose a method for identifying predictive text in clinical notes . they use linear attention to formalize the problem as predictive extraction . |
| Outcome: | The proposed model preserves differentiability and allows scalable inference via stochastic gradient descent. |
Improving Span Representation by Efficient Span-Level Attention (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for generating high-quality span representations are limited by subset of tokens . span-span interactions should play an important role in span encoding, authors argue . |
| Approach: | They propose to introduce span-span interactions and more comprehensive span-token interactions to improve span representations. |
| Outcome: | The proposed model outperforms baseline models on span-related tasks and shows superior performance. |
Dissecting Span Identification Tasks with Performance Prediction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Span identification tasks are a staple of applied NLP, but there is little insight on how their properties influence their difficulty. |
| Approach: | They propose to build a model to predict span ID performance for unseen span ID tasks that can support architecture choices. |
| Outcome: | The proposed model predicts span ID tasks for unseen span ID task in English, and the meta model predictable span ID performance. |
CorefQA: Coreference Resolution as Query-based Span Prediction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing coreference resolution models suffer from mention proposal. |
| Approach: | They propose a query-based span prediction task that can retrieve mentions left out at the mention proposal stage. |
| Outcome: | The proposed model can retrieve mentions left out at the mention proposal stage and improve generalization capability using existing question answering datasets. |
Semantic Span Annotation: An Exploratory Study of LLM Annotation (2026.acl-srw)
Copied to clipboard
| Challenge: | Structured span extraction research is siloed by context length, annotation task, and domain . Identifying a span within a natural language text and affixing it with a semantic label has been considered a core task in NLP . |
| Approach: | They propose a framework for structured span annotation that integrates five datasets under a common JSONL format with character-level offsets. |
| Outcome: | The proposed framework can generalize across four domains under three prompting configurations. |
Coreference Resolution without Span Representations (2021.acl-short)
Copied to clipboard
| Challenge: | Pretraining has reduced many complex task-specific NLP models to simple lightweight layers. |
| Approach: | They propose a lightweight end-to-end coreference model that removes the dependency on span representations, handcrafted features, pruning heuristics, and more. |
| Outcome: | The proposed model performs competitively with the current standard model, while being simpler and more efficient. |
An Empirical Study on Finding Spans (2022.emnlp-main)
Copied to clipboard
| Challenge: | Various information extraction tasks require a span finding component, which either directly yields the output or serves as an essential component of downstream linking. |
| Approach: | They propose methods for span finding, the selection of consecutive tokens in text for some downstream tasks. |
| Outcome: | The proposed methods perform better on masked language models and pre-trained encoders than on encoder-decoder models. |
Higher-Order Coreference Resolution with Coarse-to-Fine Inference (N18-2)
Copied to clipboard
| Challenge: | a new approach to coreference resolution uses a span-ranking architecture as an attention mechanism to iteratively refine span representations. |
| Approach: | They propose a fully-differentiable approximation to higher-order inference for coreference resolution . they propose introducing a coarse-to-fine approach that incorporates a less accurate but more efficient bilinear factor . |
| Outcome: | The proposed model significantly improves accuracy on the English OntoNotes benchmark while being far more computationally efficient. |
Enhanced Language Representation with Label Knowledge for Span Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to extract text spans from plain text do not fully exploit label knowledge. |
| Approach: | They propose a model to integrate label knowledge into text representations by encoding texts and annotations independently and then integrating label knowledge with an elaborate-designed semantics fusion module. |
| Outcome: | The proposed model achieves state-of-the-art performance on four benchmarks and reduces training time and inference time by 76% and 77% on average compared with the existing paradigm. |