A Polynomial-Time Parsing Algorithm for K-Depth Languages.
Alessandra CherubiniPierluigi San PietroPublished in: J. Comput. Syst. Sci. (1996)
Keyphrases
- times faster
- detection algorithm
- worst case
- high accuracy
- computational complexity
- matching algorithm
- cost function
- learning algorithm
- objective function
- optimal solution
- optimization algorithm
- approximation ratio
- tree structure
- segmentation algorithm
- input data
- probabilistic model
- dynamic programming
- k means
- preprocessing
- expressive power
- randomized algorithm
- polynomial size
- simulated annealing
- expectation maximization
- particle swarm optimization
- multi view
- natural language processing
- special case
- decision trees