ISCA Archive Interspeech 2009
ISCA Archive Interspeech 2009

Automatic estimation of decoding parameters using large-margin iterative linear programming

Brian Mak, Tom Ko

The decoding parameters in automatic speech recognition — grammar factor and word insertion penalty — are usually determined by performing a grid search on a development set. Recently, we cast their estimation as a convex optimization problem, and proposed a solution using an iterative linear programming algorithm. However, the solution depends on how well the development data set matches with the test set. In this paper, we further investigates an improvement on the generalization property of the solution by using large margin training within the iterative linear programming framework. Empirical evaluation on the WSJ0 5K speech recognition tasks shows that the recognition performance of the decoding parameters found by the improved algorithm using only a subset of the acoustic model training data is even better than that of the decoding parameters found by grid search on the development data, and is close to the performance of those found by grid search on the test set.


doi: 10.21437/Interspeech.2009-352

Cite as: Mak, B., Ko, T. (2009) Automatic estimation of decoding parameters using large-margin iterative linear programming. Proc. Interspeech 2009, 1219-1222, doi: 10.21437/Interspeech.2009-352

@inproceedings{mak09_interspeech,
  author={Brian Mak and Tom Ko},
  title={{Automatic estimation of decoding parameters using large-margin iterative linear programming}},
  year=2009,
  booktitle={Proc. Interspeech 2009},
  pages={1219--1222},
  doi={10.21437/Interspeech.2009-352}
}