The Markov Algorithm as a Language Parser - Linear Bounds.
Jacob KatzenelsonPublished in: J. Comput. Syst. Sci. (1972)
Keyphrases
- learning algorithm
- computational complexity
- worst case
- experimental evaluation
- dynamic programming
- detection algorithm
- probabilistic model
- natural language
- preprocessing
- high accuracy
- k means
- significant improvement
- np hard
- improved algorithm
- recognition algorithm
- expectation maximization
- cost function
- search space
- linear complexity
- objective function
- neural network
- upper bound
- simulated annealing
- optimal solution
- matching algorithm
- error bounds
- upper and lower bounds
- lower and upper bounds
- markov model
- confidence bounds
- closed form
- programming language
- computational cost
- lower bound
- machine learning