Narrow Adaptive Regularization of weights for grapheme-to-phoneme conversion

Keigo Kubo, Sakriani Sakti, Graham Neubig, Tomoki Toda, Satoshi NakamuraICASSP 2014 · OpenReview

Abstract

As the speech recognition field proceeds to open domain and multilingual tasks, the need for robust g2p conversion has been increasing. Towards this objective, we propose a new g2p conversion training method based on the Narrow Adaptive Regularization of Weights (NAROW) online learning algorithm. NAROW improves over its predecessor AROW by automatically adjusting hyperparameters to reduce mistake bounds, and ensuring that the learning rate is not updated when features for the input data have already been updated enough. The contribution of this paper is first to extend NAROW to structured learning, and show the inequality to bound the maximum number of errors in structured NAROW. In experiments, our proposed approach significantly improved over MIRA with consistent phoneme error rate reductions of 1.3-3.8% on a variety of dictionaries.
BibTeX
@inproceedings{kubo2014narrow,
  author = {Keigo Kubo and Sakriani Sakti and Graham Neubig and Tomoki Toda and Satoshi Nakamura},
  title = {{Narrow Adaptive Regularization of weights for grapheme-to-phoneme conversion}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2014},
  url = {https://openreview.net/forum?id=MhcRDuj1hKN},
}

Loading related content...

Figure