| Challenge: | Conditional Random Fields (CRF) based neural models are among the most performant for sequence labeling problems, but they can sometimes generate illegal sequences of tags. |
| Approach: | They propose a conditional random field-based model that imposes restrictions on candidate paths during both training and decoding phases. |
| Outcome: | The proposed method improves on existing CRF models with near zero additional cost. |
Similar Papers
Hybrid semi-Markov CRF for Neural Sequence Labeling (P18-2)
Copied to clipboard
| Challenge: | Existing conditional random fields (CRFs) use hand-crafted features to perform sequence labeling tasks. |
| Approach: | They propose to use semi-Markov conditional random fields for neural sequence labeling in natural language processing to extract features from segments instead of words. |
| Outcome: | The proposed model achieves state-of-the-art when no external knowledge is used. |
Constrained Decoding for Computationally Efficient Named Entity Recognition Taggers (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Named entity recognition models use a conditional random field as the final layer . current work eschews prior knowledge of how the span encoding scheme works . |
| Approach: | They propose to constrain the output to suppress illegal transitions to train a tagger with a cross-entropy loss twice as fast as a CRF. |
| Outcome: | The proposed model trains twice as fast as a CRF with statistically insignificant differences in F1 . the proposed model is open source and can be used in PyTorch and TensorFlow. |
Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithms (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for sequence labeling are hidden Markov models and conditional random fields (CRF). |
| Approach: | They propose a new discriminative model for sequence labeling called Bregman conditional random fields (BCRF) they propose to use Fenchel-Young losses to learn from partial labels. |
| Outcome: | The proposed model performs better in highly constrained settings than the existing model, which is slower and faster. |
Uncertainty-Aware Label Refinement for Sequence Labeling (2020.emnlp-main)
Copied to clipboard
| Challenge: | Conditional random fields (CRF) for label decoding have been a problem for many tasks. |
| Approach: | They propose a two-stage label decoding framework that model long-term label dependencies while being much more computationally efficient. |
| Outcome: | The proposed method outperforms the CRF-based methods and greatly accelerates the inference process. |
AIN: Fast and Accurate Sequence Labeling with Approximate Inference Network (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to sequence labeling require sequential computation that makes parallelization impossible. |
| Approach: | They propose to employ a parallelizable approximate variational inference algorithm for the CRF model. |
| Outcome: | The proposed approach improves decoding speed and accuracy with long sentences and is parallelizable for faster training and prediction. |
Training for Gibbs Sampling on Conditional Random Fields with Neural Scoring Factors (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in NLP focus on simple approaches to model the output label space . graphical models are often limited to (heuristic) greedy search and its variants . |
| Approach: | They propose an approach for efficiently training and decoding hybrids of graphical and graphical models based on Gibbs sampling. |
| Outcome: | The proposed approach improves on Dutch and Dutch with graphical models . the proposed model improves over a strong baseline on three languages . |
Phrase Grounding by Soft-Label Chain Conditional Random Field (D19-1)
Copied to clipboard
| Challenge: | Existing methods to ground entities depend on inference or non-differentiable losses. |
| Approach: | They propose a phrase grounding task that grounds entities to corresponding regions in an image . they use neural chain Conditional Random Fields to model dependencies among regions . |
| Outcome: | The proposed method is based on a dataset of the Flickr30k Entities dataset. |
Inference Strategies for Machine Translation with Conditional Masking (2020.emnlp-main)
Copied to clipboard
| Challenge: | Conditional masked language model training has proven successful for non-autoregressive and semi-auto-regressively sequence generation tasks. |
| Approach: | They propose a conditional masked language model (CMLM) that is a factorization of conditional probabilities of partial sequences and propose heuristics to improve performance. |
| Outcome: | The proposed algorithm is more efficient than the standard “mask-predict” algorithm on machine translation tasks. |
Filtered Semi-Markov CRF (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for sequence labeling tasks such as Named Entity Recognition (NER) suffer from quadratic complexity over sequence length and poor performance compared to CRF. |
| Approach: | They propose a variant of Semi-Markov CRF that incorporates a filtering step to eliminate irrelevant segments, reducing complexity and search space. |
| Outcome: | The proposed method outperforms both CRF and Semi-CRF on several NER benchmarks while being significantly faster. |
DiffusionSL: Sequence Labeling via Tag Diffusion Process (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Sequence Labeling (SL) is a long-standing field of natural language processing. |
| Approach: | They propose a framework that utilizes a conditional discrete diffusion model for generating discrete tag data. |
| Outcome: | The proposed framework outperforms gpt-3.5-turbo on multiple benchmark datasets and tasks. |