A Polynomial - Order Algorithm For Optimal Phrase Sequence Selection From A Phrase Lattice And Its Parallel Layered Implementation.
Kazuhiko OzekiPublished in: COLING (1990)
Keyphrases
- dynamic programming
- parallel implementation
- computational complexity
- worst case
- optimal solution
- preprocessing
- detection algorithm
- input data
- selection algorithm
- similarity measure
- search space
- lattice structure
- optimization algorithm
- parallel version
- learning algorithm
- closed form
- polynomial delay
- optimal strategy
- depth first search
- neural network
- concept lattice
- recognition algorithm
- particle swarm optimization
- cost function
- k means
- reinforcement learning