Publisher
Springer Science and Business Media LLC
Subject
Linguistics and Language,Philosophy,Computer Science (miscellaneous)
Reference34 articles.
1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D., 1983, Data Structures and Algorithms, Addison-Wesley Series in Computer Science and Information Processing, Reading, MA: Addison-Wesley.
2. Angluin, D., 1982, “Inference of reversible languages,” Journal of the ACM 29(3), 741–765.
3. Ausiello, G.,Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A. and Protasi, M., 1999, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Berlin, Germany: Springer.
4. Bakiri, G. and Dietterich, T.G., 2001, “Constructing high-accuracy letter-to-phoneme rules with machine learning,” pp. 27–44 in Data-Driven Techniques in Speech Synthesis, R.I. Damper, ed., No. 9in Telecommunications Technology and Applications, Boston, MA: Kluwer.
5. Damper, R.I., Marchand, Y., Adamson, M.J., and Gustafson, K., 1999, “Evaluating the pronunciation component of text-to-speech systems for English: A performance comparison of different approaches,” Computer Speech and Language 13(2), 155–176.