Analyzing Expressionist Grammars by Reduction to Symbolic Visibly Pushdown Automata.
Joseph C. OsbornJames O. RyanMichael MateasPublished in: AIIDE Workshops (2017)
Keyphrases
- finite state automata
- context free
- cellular automata
- regular expressions
- finite automata
- finite state
- context free grammars
- grammatical inference
- natural language
- genetic algorithm
- natural language processing
- symbolic representation
- syntactic pattern recognition
- neural network
- finite state machines
- model checking
- information extraction
- high level