Skip to main content

You Don’t Have to Think Twice if You Carefully Tokenize

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3248))

Abstract

Most of the currently used tokenizers only segment a text into tokens and combine them to sentences. But this is not the way, we think a tokenizer should work. We believe that a tokenizer should support the following analysis components in the best way it can.

We present a tokenizer with a high focus on transparency. First, the tokenizer decisions are encoded in such a way that the original text can be reconstructed. This supports the identification of typical errors and – as a consequence – a faster creation of better tokenizer versions. Second, all detected relevant information that might be important for subsequent analysis components are made transparent by XML-tags and special information codes for each token. Third, doubtful decisions are also marked by XML-tags. This is helpful for off-line applications like corpora building, where it seems to be more appropriate to check doubtful decisions in a few minutes manually than working with incorrect data over years.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aberdeen, J., Burger, J., Day, D., Hirschman, L., Robinson, P., Vilain, C.: MITRE: Description of the Alembic System as Used for MUC-6. In: Proceedings of the Sixth Message Understanding Conference (MUC6), Columbia, Maryland (1995)

    Google Scholar 

  • Grover, C., Matheson, C., Mikheev, A., Moens, M.: LT TTT –a flexible tokenisation tool. In: LREC 2000 – Proceedings of the Second International Conference on Language Resources and Evaluation, Athens, Greece (2000)

    Google Scholar 

  • Klatt, S.: Pattern-matching Easy-first Planning. In: Drewery, A., Kruijff, G., Zuber, R. (eds.) The Proceedings of the Second ESSLLI Student Session, Aixen- Provence, France, 9th European Summer School in Logic, Language and Information (1997)

    Google Scholar 

  • Klatt, S.: Combining a Rule-Based Tagger with a Statistical Tagger for Annotating German Texts. In: Busemann, S. (ed.) KONVENS 2002. 6. Konferenz zur Verarbeitung natürlicher Sprache, Saarbrücken, Germany (2002)

    Google Scholar 

  • Mikheev, A.: Tagging Sentence Boundaries. Technical report, University of Edinburgh (2000)

    Google Scholar 

  • Schmid, H.: Unsupervised Learning of Period Disambiguation for Tokenisation. Technical report, University of Stuttgart (2000)

    Google Scholar 

  • Sperberg-McQueen, C.M., Burnard, L.: Guidelines for Electronic Text Encoding and Interchange: Volumes 1 and 2: P4. University Press of Virginia (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klatt, S., Bohnet, B. (2005). You Don’t Have to Think Twice if You Carefully Tokenize. In: Su, KY., Tsujii, J., Lee, JH., Kwong, O.Y. (eds) Natural Language Processing – IJCNLP 2004. IJCNLP 2004. Lecture Notes in Computer Science(), vol 3248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30211-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30211-7_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24475-2

  • Online ISBN: 978-3-540-30211-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics