Regular-pattern-sensitive CRFs for Distant Label Interactions
Sean Papay, Roman Klinger, Sebastian Pado

TL;DR
This paper introduces regular-pattern-sensitive CRFs (RPCRFs), which extend linear-chain CRFs to model long-distance label interactions using user-defined regular patterns, enabling interpretable and tractable inference.
Contribution
The paper proposes RPCRFs, a novel method that incorporates user-specified regular patterns into CRFs to model distant label interactions with tractable inference.
Findings
RPCRFs effectively model long-distance label interactions.
The approach allows for interpretable pattern specification.
Experimental results on synthetic datasets demonstrate the method's effectiveness.
Abstract
While LLMs have grown popular in sequence labeling, linear-chain conditional random fields (CRFs) remain a popular alternative with the ability to directly model interactions between labels. However, the Markov assumption limits them to % only directly modeling interactions between adjacent labels. Weighted finite-state transducers (FSTs), in contrast, can model distant label--label interactions, but exact label inference is intractable in general. In this work, we present regular-pattern-sensitive CRFs (RPCRFs), a method of enriching standard linear-chain CRFs with the ability to learn long-distance label interactions through user-specified patterns. This approach allows users to write regular-expression label patterns concisely specifying which types of interactions the model should take into account, allowing the model to learn from data whether and in which contexts these patterns…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Algorithms and Applications · Advanced Data Compression Techniques · Advanced Control Systems Optimization
MethodsConditional Random Field · Sparse Evolutionary Training
