RePair Grammars are the Smallest Grammars for Fibonacci Words.
Takuya MienoShunsuke InenagaTakashi HoriyamaPublished in: CoRR (2022)
Keyphrases
- context free grammars
- grammatical inference
- grammar rules
- natural language
- visual languages
- context free
- tree grammars
- natural language processing
- mildly context sensitive
- tree bank
- context free languages
- grammar induction
- phrase structure
- finite state automata
- n gram
- document images
- machine learning
- parse selection
- neural network