{RePair} Grammars Are the Smallest Grammars for Fibonacci Words.
Takuya MienoShunsuke InenagaTakashi HoriyamaPublished in: CPM (2022)
Keyphrases
- grammar rules
- grammatical inference
- natural language
- context free grammars
- visual languages
- n gram
- mildly context sensitive
- tree grammars
- context free languages
- context free
- finite state automata
- word sense disambiguation
- text documents
- natural language processing
- context dependent
- grammar induction
- parse selection
- keywords