NLP-KG
Semantic Search

Publication:

Probabilistic Context-Free Grammars for Syllabification and Grapheme-to-Phoneme Conversion

K. Müller • @Conference on Empirical Methods in Natural Language Processing • 01 January 2001

TLDR: The results indicate that the standard probability model does not solve grapheme-to-phoneme conversion su ciently although, the results varied all free parameters of the probabilistic reestimation procedure.

Citations: 7
Abstract: We investigated the applicability of probabilistic context-free grammars to syllabi cation and grapheme-to-phoneme conversion. The results show that the standard probability model of context-free grammars performs very well in predicting syllable boundaries. However, our results indicate that the standard probability model does not solve grapheme-to-phoneme conversion su ciently although, we varied all free parameters of the probabilistic reestimation procedure.

Related Fields of Study

loading

Citations

Sort by
Previous
Next

Showing results 1 to 0 of 0

Previous
Next

References

Sort by
Previous
Next

Showing results 1 to 0 of 0

Previous
Next