Computation of distances for regular and context-free probabilistic languages.
Mark-Jan NederhofGiorgio SattaPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- context free
- context sensitive
- grammatical inference
- context dependent
- context free languages
- inductive inference
- context free grammars
- finite state
- probabilistic context free grammars
- tree languages
- grammar rules
- regular languages
- bayesian networks
- parse tree
- markov chain
- probabilistic model
- closure properties
- high level
- language model
- dynamic programming