Skip to main content
SpringerLink
Log in

Algorithms for string editing which permit arbitrarily complex edit constraints

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

  • 126 Accesses

Abstract

Let X and Y be any two strings of finite length. We consider the problem of transforming X to Y using the edit operations of deletion, insertion and substitution. The optimal transformation is the one which has the minimum edit distance associated with it. The problem of computing this distance and the optimal transformation using no edit constraints has been studied in the literature. In this paper we consider the problem of transform X to Y using any arbitrary edit constraints involving the number and type of edit operations to be performed. An algorithm has been presented to compute the minimum distance associated with editing X to Y subject to the specified constraint. The algorithm requires 0(|X|.|Y|.min(|X|, |Y|)) time and space. The technique to compute the optimal -transformation has also been presented.

Supported by the Natural Sciences and Engineering Research Council of Canada.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hall, P.A.V., and Dowling, G.R., "Approximate String Matching", Computing Surveys, Vol.12, 1980, pp.381–402.

    Google Scholar 

  2. Peterson, J.I., "Computer Programs for Detecting and Correcting Spelling Errors", C-ACM, Vol.23, 1980, pp.676–687.

    Google Scholar 

  3. Kashyap, R.I., and Oommen, B.J., "A Common Basis for Similarity and Dissimilarity Measures Involving Two Strings", The International Journal of Computer Mathematics, Vol.13, March 1983, pp.17–40.

    Google Scholar 

  4. Kashyap, R.I., and Oommen, B.J., "Similarity Measures for Sets of Strings", The International Journal of Computer Mathematics, Vol.13, May 1983, pp.95–104.

    Google Scholar 

  5. Wagner, R.A., and Fischer, M.J., "The String to String Correction Problem", J-ACM, Vol.21, 1974, pp.168–173.

    Google Scholar 

  6. Masek, W.J., and Paterson, M.S., "A Faster Algorithm Computing String Edit Distances", J. of Comp. and Syst. Sci., Vol.20, 1980, pp.18–31.

    Google Scholar 

  7. Sankoff, D., "Matching Sequences Under Deletion/Insertion Constraints", Proc. of the Nat. Acad. Science., USA, Vol.69, January 1972, pp.4–6.

    Google Scholar 

  8. Oommen, B.J., "Constrained String Editing", submitted for publication. Also available as School of Computer Science Technical Report, SCS-TR-48, Carleton University, Ottawa, Ontario, Canada.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, K1S 5B6, Ottawa, Ontario, Canada

    B. John Oommen

Authors
  1. B. John Oommen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oommen, B.J. (1984). Algorithms for string editing which permit arbitrarily complex edit constraints. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030327

Download citation

  • DOI: https://doi.org/10.1007/BFb0030327

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation