Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Implementing Automata

WIA 1999: Automata Implementation pp 48–59Cite as

Metric Lexical Analysis

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2214))

Abstract

We study automata-theoretic properties of distances and quasi-distances between words. We show that every additive distance is finite. We also show that every additive quasi-distance is regularitypreserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. As an application we present a simple algorithm that constructs a metric (fault-tolerant) lexical analyzer for any given lexical analyzer and desired radius (faulttolerance index).

The work reported here has been supported by the Natural Sciences and Engineering Research Council of Canada Grants OGP0041630, OGP0147224 and was done during the visit of the first author to the Department of Computer Science, The University of Western Ontario, Canada.

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. A.V. Aho, R. Sethi, J.D. Ullman: Compilers Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1988.

    Google Scholar 

  2. C.S. Calude, E. Calude: On some discrete metrics, Bull. Math. Soc. Sci. Math. R. S. Roumanie (N. S.) 27 (75) (1983), 213–216.

    MathSciNet  Google Scholar 

  3. T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.

    Google Scholar 

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

    MATH  Google Scholar 

  5. R.L. Kashyap, B.J. Oommen: Spelling correction using probabilistic methods, Pattern Recognition Letters 2, 3 (1984), 147–154.

    Article  Google Scholar 

  6. U. Manber: Introduction to Algorithms-A Creative Approach, Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  7. D.J. Margoliash: CSpell-A Bloom Filter-Based SpellingCorr ection Program, Masters Thesis, Dept. of Computer Science, Univ. of Western Ontario, London, Canada, 1987.

    Google Scholar 

  8. A. Mateescu, A. Salomaa, K. Salomaa, S. Yu: Lexical analysis with a simple finitefuzzy-automaton model, Journal of Universal Computer Science, 1, 5 (1995), 292–311.

    Google Scholar 

  9. M. Mor, A.S. Fraenkel: A hash code method for detecting and correcting spelling errors, Comm. ACM 25, 12 (1982), 935–938.

    Article  MathSciNet  Google Scholar 

  10. A. Salomaa: Formal Languages, Academic Press, New York, 1973.

    Google Scholar 

  11. S. Yu: Regular languages. In: Handbook of Formal Languages, Vol. I. (G. Rozenberg, A. Salomaa, eds.) pp. 41–110, Springer-Verlag, Berlin, 1997.

    Google Scholar 

  12. S. Ulam: Some ideas and prospects in biomathematics, The Annual Review of Biophysics and Bioengineering, 1(1972), 277–292. Reprinted in S. Ulam: Science, Computers, and People (M. C. Reynolds, G.-C. Rota, eds.), Birkhauser, Boston, 1986, 115–136.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The University of Auckland, Private Bag, 92109, Auckland, New Zealand

    Cristian S. Calude

  2. Department of Computing and Information Science, Queen’s University, Kingston, Ontario, Canada, K7L 3N6

    Kai Salomaa

  3. Department of Computer Science, The University of Western Ontario, London, Ontario, Canada, N6A 5B7

    Sheng Yu

Authors
  1. Cristian S. Calude
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Potsdam, Institut für Informatik, August-Bebel-Straße 89, 14482, Potsdam, Germany

    Oliver Boldt

  2. Institut für Informatik, Universität Potsdam, Potsdam

    Helmut Jürgensen

  3. Department of Computer Science, The University of Western Ontario, London, Ontario, Canada, N6A 5B7

    Helmut Jürgensen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calude, C.S., Salomaa, K., Yu, S. (2001). Metric Lexical Analysis. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45526-4_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42812-1

  • Online ISBN: 978-3-540-45526-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation