Between finite state and Prolog: constraint-based automata for efficient recognition of phrases.
Klaus U. SchulzTomek Miko LajewskiPublished in: Nat. Lang. Eng. (1996)
Keyphrases
- finite state
- markov chain
- markov decision processes
- model checking
- tree automata
- vector quantizer
- object recognition
- context free
- partially observable markov decision processes
- optimal policy
- recognition rate
- policy iteration
- expert systems
- information retrieval
- continuous time bayesian networks
- logic programming
- state space
- average cost
- dynamic programming
- probabilistic context free grammars