Abstract
A corpus, plural corpora, is a collection of texts or speech stored in an electronic machine-readable format. A few years ago, large electronic corpora of more than a million of words were rare, expensive, or simply not available. At present, huge quantities of texts are accessible in many languages of the world. They can easily be collected from a variety of sources,most notably theWeb, where corpora of hundreds of millions of words are within the reach of most computational linguists.
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.
2.7 Further Reading
Friedl, J. E. F. (2002). Mastering Regular Expressions. O’Reilly, Sebastopol, California, second edition.
Harris, Z. (1962). String Analysis of Sentence Structure. Mouton, The Hague.
Hopcroft, J. E., Motwani, R., and Ullman, J. D. (2001). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston, 2nd edition.
Imbs, P. and Quemada, B., editors (1971–1994). Trésor de la langue française. Dictionnaire de la langue française du XIXe et du XXe siècle (1789–1960). Éditions du CNRS puis Gallimard, Paris. 16 volumes.
Kleene, S. C. (1956). Representation of events in nerve nets and finite automata. In Shannon, C. E. and Carthy, J.M., editors, Automata Studies, pages 3–42. Princeton University Press, Princeton.
Mohri, M., Pereira, F. C. N., and Riley, M. (1998). A rational design for a weighted finite-state transducer library. In Wood, D. and Yu, S., editors, Automata implementation. Second International Workshop on Implementing Automata, WIA’ 97, London, Ontario, September 1997. Revised Papers, volume 1436 of Lecture Notes in Computer Science, pages 144–158, Berlin Heidelberg New York. Springer Verlag.
Roche, E. and Schabes, Y., editors (1997). Finite-State Language Processing. MIT Press, Cambridge, Massachusetts.
Sinclair, J., editor (1987). Collins COBUILD English Language Dictionary. Collins, London.
Thompson, K. (1968). Regular expression search algorithm. Communications of the ACM, 11(6):419–422.
van Noord, G. and Gerdemann, D. (2001). An extendible regular expression compiler for finite-state approaches in natural language processing. In Boldt, O. and Jürgensen, H., editors, Automata Implementation. 4th International Workshop on Implementing Automata, WIA’99, Potsdam, Germany, July 1999, Revised Papers, volume 2214 of Lecture Notes in Computer Science, pages 122–139, Berlin Heidelberg New York. Springer Verlag.
Zampolli, A. (2003). Past and on-going trends in computational linguistics. The ELRA Newsletter, 8(3–4):6–16.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Corpus Processing Tools. In: An Introduction to Language Processing with Perl and Prolog. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-34336-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-34336-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25031-9
Online ISBN: 978-3-540-34336-3
eBook Packages: Computer ScienceComputer Science (R0)