An All-Path Parsing Algorithm for Constraint-Based Dependency Grammars of CF-Power.
Tomasz ObrêbskiPublished in: TSD (2007)
Keyphrases
- preprocessing
- times faster
- learning algorithm
- worst case
- recognition algorithm
- dynamic programming
- k means
- experimental evaluation
- simulated annealing
- cost function
- np hard
- computational complexity
- probabilistic model
- path planning
- matching algorithm
- filtering algorithm
- shortest path problem
- convergence rate
- path length
- optimization algorithm
- expectation maximization
- particle swarm optimization
- computational cost
- significant improvement
- natural language
- decision trees