C4.5: programs for machine learning
C4.5: programs for machine learning
Towards history-based grammars: using richer models for probabilistic parsing
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
| Hi-index | 0.00 |
Grapheme-to-phoneme (G2P) conversion plays an important role in speech synthesis. The main difficulty facing Chinese G2P conversion is that many Chinese characters are polyphonic, having more than one pronunciation. A Chinese G2P system must be able to pick the correct pronunciation from among several candidates. Contextual information on neighboring characters such as character n-grams, phonetic information, or position of the polyphone in a word or sentence is the key to correct prediction. Most previous works employed rule-based or rule-learning methods, which often suffered from data sparseness. In this paper, we propose a novel G2P approach to avoid data sparseness. Our method uses the maximum entropy (ME) model framework to represent contextual information as ME features. Our system achieves a top accuracy of 99.84%, which is significantly higher than other state-of-the-art rule-based and rule-learning methods. In addition, our approach consistently improves accuracy regardless of a character's main pronunciation ratio. Further analysis also shows that the ME model is fast and efficient, requiring much less training and labeling time.