2017
IJCAI
IJCAI 2017
Generating Context-Free Grammars using Classical Planning
Abstract
This paper presents a novel approach for generating Context-Free Grammars (CFGs) from small sets of input strings (a single input string in some cases). Our approach is to compile this task into a classical planning problem whose solutions are sequences of actions that build and validate a CFG compliant with the input strings. In addition, we show that our compilation is suitable for implementing the two canonical tasks for CFGs, string production and string recognition.
📈
Trend Setter
- Theory
🧭
Keyword Pioneer
- planning compilation
🐣
Hot Topic Early Bird
- automated planning
🐝
Cross-Pollinator
- Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio