Constraining Linear-chain CRFs to Regular Languages.
Sean PapayRoman KlingerSebastian PadóPublished in: ICLR (2022)
Keyphrases
- regular languages
- conditional random fields
- grammatical inference
- regular expressions
- context free languages
- finite automata
- decision problems
- pac learning
- named entity recognition
- positive data
- context free grammars
- hidden markov models
- information extraction
- finite state machines
- probabilistic model
- pairwise
- statistical queries
- machine learning
- query language
- context free
- inductive inference
- pattern matching
- computational complexity