Abstract
Years of speech and billions of characters are stored in various media including the Internet. How can we ever find useful information in such vast archives? Automatic procedures that can recognise speech accurately and linguistic tools that automatically take out essential information components may do the job.
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
Bell, T.C., Moffat, A., Witten, I.H., Zobel, J.: Taking Moore’s law into the next century. IEEE Computer Magazine 32(1), 43–48 (1999)
Blok, H.E., Hiemstra, D., Choenni, S., de Jong, F., Blanken, H.M., Apers, P.M.G.: Predicting the cost-quality trade-off for information retrieval queries: Facilitating database design and query optimization. In: Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, pp. 207–214. ACM, New York (2001)
Cutting, D.R., Pedersen, J.O.: Space optimizations for total ranking. In: Proceedings of RIAO 1997, Montreal, pp. 401–412. CID (1997)
Frakes, W.B., Baeza-Yates, R. (eds.): Information Retrieval: Data Structures and Algorithms. Prentice Hall, New Jersey (1992)
Morrison, P., Morrison, P.: The sum of human knowledge? Scientific American (July 1998)
Winograd, T.: Understanding Natural Language. Edinburgh University Press, Edinburgh (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grefenstette, G., Renals, S. (2003). Text- and Speech-Triggered Information Access: Introduction. In: Renals, S., Grefenstette, G. (eds) Text- and Speech-Triggered Information Access. Lecture Notes in Computer Science(), vol 2705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45115-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-45115-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40635-8
Online ISBN: 978-3-540-45115-0
eBook Packages: Springer Book Archive