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