Inference of Over-Constrained NFA of Size k+1 to Efficiently and Systematically Derive NFA of Size k for Grammar Learning.
Tomasz JastrzabFrédéric LardeuxÉric MonfroyPublished in: ICCS (1) (2023)
Keyphrases
- learning process
- deterministic finite automata
- learning systems
- learning algorithm
- natural language
- online learning
- active learning
- information extraction
- knowledge acquisition
- grammar induction
- finite state automata
- string matching
- decision theoretic
- regular expressions
- learning tasks
- data sets
- reinforcement learning
- genetic algorithm