Comparing support vector machines, recurrent networks, and finite state transducers for classifying spoken utterances

  • Authors:
  • Sheila Garfield;Stefan Wermter

  • Affiliations:
  • University of Sunderland, School of Computing and Technology, Centre for Hybrid Intelligent Systems, Sunderland, United Kingdom;University of Sunderland, School of Computing and Technology, Centre for Hybrid Intelligent Systems, Sunderland, United Kingdom

  • Venue:
  • ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.