Abstract
Inspired by recent insights into the properties of statistical word co-occurrences, we propose a mechanism which imitates spreading activation in the human mind in order to improve the identification of words during the automatic speech recognition process. This mechanism is able to make accurate semantic predictions about the currently uttered word as well as about words which are likely to come in the rest of a sentence. A robust automatic disambiguation algorithm provides a framework for semantic clustering, which allows to avoid the inherent polysemy problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banerjee, S.: Adapting the Lesk Algorithm for Word Sense Disambiguation to WordNet. Department of Computer Science University of Minnesota, Duluth, Minnesota 55812 (2002)
Bordag, S.: Vererbungsalgorithmen von semantischen Eigenschaften auf Assoziationsgraphen und deren Nutzung zur Klassifikation von natürlichsprachlichen Daten, Diplomarbeit, Universit ät Leipzig, Institut für Mathematik und Informatik (2002)
Bordag, S.: Sentence Co-occurrences as Small-World Graphs:Asolution toAutomatic Lexical Disambiguation. In: Gelbukh, A. (ed.) CICLing 2003. LNCS, vol. 2588, pp. 329–332. Springer, Heidelberg (2003)
Caramazza, A.: How many levels of processing are there in lexical access? Cognitive Neuropsychology 14, 177–208 (1997)
Dell, G.S.: A spreading-activation model of retrieval in sentence production. Psychological Review 93, 231–241 (1986)
Garrett, M.F.: Levels of processing in sentence production. In: Butterworth, B. (ed.) Language Production: Vol. 1. Speech and Talk, pp. 177–220. Academic Press, San Diego (1980)
Heyer, G., Läuter, M., Quasthoff, U., Wittig, T., Wolff, C.: Learning Relations using Collocations. In: Maedche, S., Staab, C., Nedellec, C., Hovy, E. (eds.) Proc. IJCAI Workshop on Ontology Learning, Seattle/WA, August 19-24 (2001)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)
Lesk, M.: Automatic sense disambiguation using machine readable dictionaries: How to tell a pine cone from a ice cream cone. In: Proceedings of SIGDOC 1986 (1986)
Levelt, W.J.M.: Speaking: From intention to articulation. MIT Press, Cambridge (1989)
Levelt, W.J.M., Roelofs, A., Meyer, A.S.: A theory of lexical access in speech production. Behavioral and Brain Sciences 22, 1–75 (1999)
Läuter, M., Quasthoff, U.: Kollokationen und semantisches Clustering. GLDV-Tagung (1999)
Patwardhan, S., Banerjee, S., Pedersen, T.: Using Measures of Semantic Relatedness for Word Sense Disambiguation. In: Gelbukh, A. (ed.) CICLing 2003. LNCS, vol. 2588, pp. 241–257. Springer, Heidelberg (2003)
Quasthoff, U., Wolff, C.: The Poisson Collocation Measure and its Applications. In: Proc. Second International Workshop on Computational Approaches to Collocations, Wien (2002)
Rosso, P., Masulli, F., Buscaldi, D., Pla, F., Molina, A.: Automatic Noun Sense Disambiguation. In: Gelbukh, A. (ed.) CICLing 2003. LNCS, vol. 2588, pp. 273–276. Springer, Heidelberg (2003)
Steyvers, M., Tenenbaum, J.B.: The large-scale structure of semantic networks: statistical analyses and a model of semantic growth. Steyvers, M., Tenenbaum, J. B., Cognitive Science (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bordag, S., Bordag, D. (2003). Advances in Automatic Speech Recognition by Imitating Spreading Activation. In: Matoušek, V., Mautner, P. (eds) Text, Speech and Dialogue. TSD 2003. Lecture Notes in Computer Science(), vol 2807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39398-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-39398-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20024-6
Online ISBN: 978-3-540-39398-6
eBook Packages: Springer Book Archive