Compressibility of Finite Languages by Grammars.
Sebastian EberhardStefan HetzlPublished in: DCFS (2015)
Keyphrases
- closure properties
- grammatical inference
- mildly context sensitive
- context free grammars
- context free
- finite automata
- expressive power
- grammar induction
- context free languages
- tree automata
- regular languages
- language independent
- databases
- language processing
- natural language
- finite state automata
- finite number
- syntactic pattern recognition
- arabic language
- bayesian networks
- learning from positive data
- formal languages
- multi lingual
- formal language
- xml documents
- information extraction
- natural language processing
- target language
- finite state
- conjunctive queries