Skip to main content
SpringerLink
Log in
Book cover

Annual Conference on Artificial Intelligence

KI 2004: KI 2004: Advances in Artificial Intelligence pp 112–126Cite as

Error-Tolerant Finite-State Lookup for Trademark Search

  • Conference paper

  • 1172 Accesses

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

Abstract

Error-tolerant lookup of words in large vocabularies hasmany potential uses, both within and beyond natural language processing (NLP). This work describes a generic library for finite-state-based lexical lookup, originally designed for NLP-related applications, that can be adapted to application-specific error metrics. We show how this tool can be used for searching existing trademarks in a database, using orthographic and phonetic similarity. We sketch a prototypical implementation of a trademark search engine and show results of a preliminary evaluation of this system.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

  1. Bouillon, P., Lehmann, S., Manzi, S., Petitpierre, D.: Développement de lexiques à grande échelle. In: Actes du Colloque des journées LTT de TUNIS, pp. 71–80 (1998)

    Google Scholar 

  2. Brill, E., Moore, R.C.: An improved error model for noisy channel spelling correction. In: Proceedings of the ACL. ACL (2000)

    Google Scholar 

  3. Callmeier, U.: PET — A platform for experimentation with efficient HPSG processing techniques. Natural Language Engineering 6(1), 99–108 (2000)

    Article  Google Scholar 

  4. Callmeier, U., Eisele, A., Schäfer, U., Siegel, M.: The DeepThought core architecture framework. In: Proceedings of LREC, Lisbon, Portugal (2004)

    Google Scholar 

  5. Compumark (2004), http://www.compumark.com

  6. Copestake, A.: Implementing Typed Feature Structure Grammars. CSLI Lecture Notes. Center for the Study of Language and Information, Stanford (2001)

    Google Scholar 

  7. Eucor (2004), http://www.eucor.de

  8. Fredkin, E.: Trie memory. Communications of the ACM 3(9), 490–499 (1960)

    Article  Google Scholar 

  9. Hodge, V.J., Austin, J.: An evaluation of phonetic spell checkers. Technical report, Department of Computer Science, University of York, Technical report YCS 338 (2001)

    Google Scholar 

  10. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  11. Karttunen, L.: Constructing lexical transducers. In: COLING 1994, Kyoto, Japan, pp. 406–411 (1994)

    Google Scholar 

  12. Kernighan, M.D., Church, K.W., Gale, W.A.: A spelling correction program base on a noisy channel model. In: COLING 1990, Helsinki, vol. II, pp. 205–211 (1990)

    Google Scholar 

  13. Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)

    Google Scholar 

  14. Oflazer, K.: Error-tolerant finite state recognition with applications to morphological analysis and spelling correction. Computational Linguistics 22(1) (1996)

    Google Scholar 

  15. Oflazer, K., Güzey, C.: Spelling correction in agglutinative languages. In: 4th ACL Conference on Applied NLP, Stuttgart, Stuttgart, Germany (1994); Association for Computational Linguistics

    Google Scholar 

  16. Petitpierre, D., Russell, G.: MMORPH - the Multext morphology program. Technical report, ISSCO, CH-1227 Carouge, Switzerland (October 1995)

    Google Scholar 

  17. Soudi, A., Eisele, A.: Generating an Arabic full-form lexicon for bidirectional morphology lookup. In: Proceedings of LREC, Lisbon, Portugal (2004)

    Google Scholar 

  18. Schulz, K.U., Mihov, S.: Fast string correction with Levenshteinautomata. Technical report, CIS, Universität München (2001) CIS-Bericht- 01-127

    Google Scholar 

  19. Schröder, M., Trouvain, J.: The german text-to-speech synthesis system MARY: A tool for research, development and teaching. In: 4th ISCA Workshop on Speech Synthesis, Blair Atholl, Scotland (2001)

    Google Scholar 

  20. Wilson, L.: The Trademark Guide. Allworth Press, New York (1998)

    Google Scholar 

  21. Zobel, J., Dart, P.: Finding approximate matches in large lexicons. Software - Practice & Experience 25(3), 331–345 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computational Linguistics, Saarland University, D-66123, Saarbrücken

    Andreas Eisele

  2. German Meteorological Service, Kaiserleistraße 35, D-63067, Offenbach

    Tim vor der Brück

Authors
  1. Andreas Eisele
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tim vor der Brück
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Artificial Intelligence, Ulm University, Germany

    Susanne Biundo

  2. Fakultät für Ingenieurwissenschaften und Informatik, Universität Ulm, 89069, Ulm, v

    Thom Frühwirth

  3. Institute of Neural Information Processing, University of Ulm, D-89069, Ulm, Germany

    Günther Palm

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eisele, A., vor der Brück, T. (2004). Error-Tolerant Finite-State Lookup for Trademark Search. In: Biundo, S., Frühwirth, T., Palm, G. (eds) KI 2004: Advances in Artificial Intelligence. KI 2004. Lecture Notes in Computer Science(), vol 3238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30221-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30221-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23166-0

  • Online ISBN: 978-3-540-30221-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation