Advertisement

Metric Lexical Analysis

  • Cristian S. Calude
  • Kai Salomaa
  • Sheng Yu
Conference paper
Part of the Lecture Notes in Computer Science book series (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).

Keywords

Formal Language Regular Language Hash Code Lexical Analyzer Nondeterministic Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.V. Aho, R. Sethi, J.D. Ullman: Compilers Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1988.Google Scholar
  2. 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.MathSciNetGoogle Scholar
  3. 3.
    T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.Google Scholar
  4. 4.
    J.E. Hopcroft, J.D. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.zbMATHGoogle Scholar
  5. 5.
    R.L. Kashyap, B.J. Oommen: Spelling correction using probabilistic methods, Pattern Recognition Letters 2, 3 (1984), 147–154.CrossRefGoogle Scholar
  6. 6.
    U. Manber: Introduction to Algorithms-A Creative Approach, Addison-Wesley, Reading, MA, 1989.Google Scholar
  7. 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. 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. 9.
    M. Mor, A.S. Fraenkel: A hash code method for detecting and correcting spelling errors, Comm. ACM 25, 12 (1982), 935–938.CrossRefMathSciNetGoogle Scholar
  10. 10.
    A. Salomaa: Formal Languages, Academic Press, New York, 1973.Google Scholar
  11. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Cristian S. Calude
    • 1
  • Kai Salomaa
    • 2
  • Sheng Yu
    • 3
  1. 1.Computer Science DepartmentThe University of AucklandPrivate BagAucklandNew Zealand
  2. 2.Department of Computing and Information ScienceQueen’s UniversityKingstonCanada
  3. 3.Department of Computer ScienceThe University of Western OntarioLondonCanada

Personalised recommendations