A comparison of two exact algorithms for finding the n-best sentence hypotheses in continuous speech recognition.
Víctor M. JiménezAndrés MarzalJean MonnéPublished in: EUROSPEECH (1995)
Keyphrases
- exact algorithms
- continuous speech recognition
- knapsack problem
- approximation algorithms
- exact solution
- vehicle routing problem with time windows
- heuristic methods
- benchmark instances
- benders decomposition
- combinatorial optimization
- combinatorial optimization problems
- max sat
- natural language
- neural network
- optimization problems
- combinatorial problems
- optimal solution