Partial Greedy Algorithm to Extract a Minimum Phonetically-and-Prosodically Rich Sentence Set

A phonetically-and-prosodically rich sentence set is so important in collecting a read-speech corpus for developing phoneme-based speech recognition. The sentence set is usually searched from a huge text corpus of million sentences using the optimization methods. One of the commonly used optimization methods for this case is a Least-to-Most Greedy (LTMG) algo-rithm. It is effective in minimizing the number of phoneme-units. Unfortunately, it does not distribute their frequencies. In this paper, a new method called Partial LTMG algorithm (PLTMG) is proposed to search an optimum set containing triphones and prosodies those are distributed in a near-uniform fashion. Testing on an Indonesian text corpus of ten million sentences crawled from some websites of newspapers and novels shows that the proposed method is not only capable of minimizing both phoneme-units and prosodies but also effective in distributing their frequencies.

@article{Alfiansyah2018,
  title     = {Partial Greedy Algorithm to Extract a Minimum Phonetically-and-Prosodically Rich Sentence Set},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {9},
  number    = {12},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Fahmi Alfiansyah and Suyanto},
  doi       = {10.14569/IJACSA.2018.091274},
  url       = {https://doi.org/10.14569/IJACSA.2018.091274}
}