The String-to-String Correction Problem

@article{Wagner1974TheSC,
  title={The String-to-String Correction Problem},
  author={Robert A. Wagner and Michael J. Fischer},
  journal={J. ACM},
  year={1974},
  volume={21},
  pages={168-173}
}
The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one symbol of a string into another single symbol, deleting one symbol from a string, or inserting a single symbol into a string. An algorithm is presented which solves this problem in time proportional to the product of the lengths of the two strings… 

An Extension of the String-to-String Correction Problem

The set of allowable edit operations is extended to include the operation of interchanging the positions of two adjacent characters under certain restrictions on edit-operation costs, and it is shown that the extended problem can still be solved in time proportional to the product of the lengths of the given strings.

The string-to-string correction problem with block moves

An algorithm that produces the shortest edit sequence transforming one string into another is presented and is optimal in the sense that it generates a minimal covering set of common substrings of one string with respect to another.

The Binary String-to-String Correction Problem

This thesis presents the first careful examination of the binary-alphabet case of String-to-String Correction, and presents several special cases of BSSC for which an optimal solution can be found in polynomial time; in particular, the case where T and M have an equal number of occurrences of a given symbol has a polyn coefficients time solution.

Bounds for the String Editing Problem

It is shown that if the operations on symbols of the strings are restricted to tests of equality, then O(nm) operations are necessary (and sufficient) to compute the distance between two strings.

Practical Linear Space Algorithms for Computing String-Edit Distances

Two practical algorithms for computing the edit distance between two strings are presented and the space complexity for the first is m + n + O(1), where m and n are the lengths of the input strings.

A string correction method based on the context-dependent similarity

The invariance of the similarity to parallel transformations, a separation theorem and topological equivalence are described and the string-tostring correction problem based on the context-dependent edit operations is described.

A Faster Algorithm Computing String Edit Distances

The string merging problem

A special case where deletion is the only allowed edition operation is shown to have the longest common subsequence of the strings as its solution.

On the complexity of the Extended String-to-String Correction Problem

The CELLAR algorithm is presented, and proof that ESSCP, with WI < WC = WD = @@@@, 0 < WS < @ @@@, suitably encoded, is NP-complete is proved.

Learning String-Edit Distance

The stochastic model allows us to learn a string-edit distance function from a corpus of examples and is applicable to any string classification problem that may be solved using a similarity function against a database of labeled prototypes.
...

References

SHOWING 1-5 OF 5 REFERENCES

Spelling correction in systems programs

By using systems which perform spelling correction, the number of debugging runs per program has been decreased, saving both programmer and machine time.

~R~OUENCY OF,SSUE Quarterly

  • ~R~OUENCY OF,SSUE Quarterly

POSTAL SERVICE SEE INSTRUCTIONS STATEMENT OF OWNERSHIP. MANAGEMENT AND CIRCULATION ON PAGE 2 (REVERSE)

  • POSTAL SERVICE SEE INSTRUCTIONS STATEMENT OF OWNERSHIP. MANAGEMENT AND CIRCULATION ON PAGE 2 (REVERSE)
  • 1973

Y, 10036 5, LOCATION OF THE HEADQUARTERS OR GENERAL BUS~NE~S OFFICES OF THE PUBLISHERS(NO, p,i.~r$) 1133 Avenue of the Amerleas~ New Yorkl N

  • ~o~prm~r~ 1133 Avenue of the Americas 10036 6. NAMES AND ADDRESSES OF PUBLISHER, EDITOR, AND MANAGING EDITOR Association for ComEutin $ Machinery Inc., 1133 Avenue of the Americas, N.Y. 10036 EO'TOR(~ameaMad~¢"] Yorktown Heights, Raymond~GEE E'iMiller~ IBM~ Thomas J, Watson Research Ctr