(algorithm)
Definition: Compute the similarity of two strings as the number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common subsequence plus, recursively, matching characters in the unmatched region on either side of the longest common subsequence.
Generalization (I am a kind of ...)
string matching with errors.
Author: PEB
John W. Ratcliff and David Metzener, Pattern Matching: The Gestalt Approach, Dr. Dobb's Journal, page 46, July 1988.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:28:37 2004.
HTML page formatted Wed Oct 26 09:48:02 2005.
Cite this as:
Paul E. Black, "Ratcliff/Obershelp pattern recognition", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/ratcliffObershelp.html
