Constraining Linear-chain CRFs to Regular Languages
Sean Papay, Roman Klinger, Sebastian Pad\'o

TL;DR
This paper introduces a generalized CRF model, RegCCRF, capable of enforcing nonlocal constraints specified by regular languages, improving structured prediction accuracy and allowing constraints to be incorporated during training.
Contribution
The paper proposes RegCCRF, a novel CRF extension that enforces broad classes of constraints, including nonlocal ones, during training and decoding, with theoretical and empirical advantages.
Findings
RegCCRF can incorporate nonlocal constraints effectively.
Constrained training outperforms constrained decoding.
Achieves state-of-the-art results in semantic role labeling.
Abstract
A major challenge in structured prediction is to represent the interdependencies within output structures. When outputs are structured as sequences, linear-chain conditional random fields (CRFs) are a widely used model class which can learn \textit{local} dependencies in the output. However, the CRF's Markov assumption makes it impossible for CRFs to represent distributions with \textit{nonlocal} dependencies, and standard CRFs are unable to respect nonlocal constraints of the data (such as global arity constraints on output labels). We present a generalization of CRFs that can enforce a broad class of constraints, including nonlocal ones, by specifying the space of possible output structures as a regular language . The resulting regular-constrained CRF (RegCCRF) has the same formal properties as a standard CRF, but assigns zero probability to all label sequences not in…
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.
Code & Models
Videos
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Domain Adaptation and Few-Shot Learning
MethodsConditional Random Field
