This paper describes new experiments for the classification of recorded operator assistance telephone utterances. The experimental work focused on three techniques: support vector machines (SVM), simple recurrent networks (SRN) and finite-state transducers (FST) using a large, unique telecommunication corpus of spontaneous spoken language. A comparison is made of the performance of these classification techniques which indicates that a simple recurrent network performed best for learning classification of spontaneous spoken language in a robust manner which should lead to their use in helpdesk call routing. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Garfield, S., & Wermter, S. (2003). Comparing support vector machines, recurrent networks, and finite state transducers for classifying spoken utterances. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. https://doi.org/10.1007/3-540-44989-2_77
Mendeley helps you to discover research relevant for your work.