Gestalt pattern matching

Gestalt pattern matching,^[1] also Ratcliff/Obershelp pattern recognition,^[2] is a string-matching algorithm for determining the similarity of two strings. It was developed in 1983 by John W. Ratcliff and John A. Obershelp and published in the Dr. Dobb's Journal in July 1988.^[2]

Algorithm

The similarity of two strings $S_{1}$ and $S_{2}$ is determined by this formula: twice the number of matching characters $K_{m}$ divided by the total number of characters of both strings. The matching characters are defined as some longest common substring^[3] plus recursively the number of matching characters in the non-matching regions on both sides of the longest common substring:^[2]^[4]

D_{ro}={\frac {2K_{m}}{|S_{1}|+|S_{2}|}}

where the similarity metric can take a value between zero and one:

0\leq D_{ro}\leq 1

The value of 1 stands for the complete match of the two strings, whereas the value of 0 means there is no match and not even one common letter.

Sample

S₁	W	I	K	I	M	E	D	I	A
S₂	W	I	K	I	M	A	N	I	A

The longest common substring is WIKIM (light grey) with 5 characters. There is no further substring on the left. The non-matching substrings on the right side are EDIA and ANIA. They again have a longest common substring IA (dark gray) with length 2. The similarity metric is determined by:

{\frac {2K_{m}}{|S_{1}|+|S_{2}|}}={\frac {2\cdot (|{\text{“WIKIM”}}|+|{\text{“IA”}}|)}{|S_{1}|+|S_{2}|}}={\frac {2\cdot (5+2)}{9+9}}={\frac {14}{18}}=0.{\overline {7}}

Properties

The Ratcliff/Obershelp matching characters can be substantially different from each longest common subsequence of the given strings. For example $S_{1}=q\;ccccc\;r\;ddd\;s\;bbbb\;t\;eee\;u$ and $S_{2}=v\;ddd\;w\;bbbb\;x\;eee\;y\;ccccc\;z$ have $ccccc$ as their only longest common substring, and no common characters right of its occurrence, and likewise left, leading to $K_{m}=5$ . However, the longest common subsequence of $S_{1}$ and $S_{2}$ is $(ddd)\;(bbbb)\;(eee)$ , with a total length of $10$ .

Complexity

The execution time of the algorithm is $O(n^{3})$ in a worst case and $O(n^{2})$ in an average case. By changing the computing method, the execution time can be improved significantly.^[1]

Commutative property

The Python library implementation of the gestalt pattern matching algorithm is not commutative:^[5]

D_{ro}(S_{1},S_{2})\neq D_{ro}(S_{2},S_{1}).

Sample

For the two strings

S_{1}={\text{GESTALT PATTERN MATCHING}}

and

S_{2}={\text{GESTALT PRACTICE}}

the metric result for

D_{ro}(S_{1},S_{2})

is

{\frac {24}{40}}

with the substrings GESTALT P, A, T, E and for

D_{ro}(S_{2},S_{1})

the metric is

{\frac {26}{40}}

with the substrings GESTALT P, R, A, C, I.^[why?]

Applications

The Python difflib library, which was introduced in version 2.1,^[1] implements a similar algorithm that predates the Ratcliff-Obershelp algorithm. Due to the unfavourable runtime behaviour of this similarity metric, three methods have been implemented. Two of them return an upper bound in a faster execution time.^[1] The fastest variant only compares the length of the two substrings:^[6]

D_{rqr}={\frac {2\cdot \min(|S1|,|S2|)}{|S1|+|S2|}}

,

The second upper bound calculates twice the sum of all used characters $S_{1}$ which occur in $S_{2}$ divided by the length of both strings but the sequence is ignored.

D_{qr}={\frac {2\cdot {\big |}\{\!\vert S1\vert \!\}\cap \{\!\vert S2\vert \!\}{\big |}}{|S1|+|S2|}}

^{[clarification needed]}

# Dqr Implementation in Python
import collections


def quick_ratio(s1: str, s2: str) -> float:
    """Return an upper bound on ratio() relatively quickly."""
    length = len(s1) + len(s2)

    if not length:
        return 1.0

    intersect = (collections.Counter(s1) & collections.Counter(s2))
    matches = sum(intersect.values())
    return 2.0 * matches / length

Trivially the following applies:

0\leq D_{ro}\leq D_{qr}\leq D_{rqr}\leq 1

and

0\leq K_{m}\leq |\{\!\vert S1\vert \!\}\cap \{\!\vert S2\vert \!\}{\big |}\leq \min(|S1|,|S2|)\leq {\frac {|S1|+|S2|}{2}}

.

References

^ ^a ^b ^c ^d difflib — Helpers for computing deltas inside the Python documentation
^ ^a ^b ^c National Institute of Standards and Technology Ratcliff/Obershelp pattern recognition
^ While two strings may have several longest common substrings, Ratcliff (1988) apparently assumes that there is only one.
^ Ilya Ilyankou: Comparison of Jaro-Winkler and Ratcliff/Obershelp algorithms in spell check, May 2014 (PDF)
^ How does Pythons SequenceMatcher work? at stackoverflow.com
^ Borrowed from Python 3.7.0, difflib.py Lines 38–41 and 676–686

v t e Strings
String metric	Approximate string matching Bitap algorithm Damerau–Levenshtein distance Edit distance Gestalt pattern matching Hamming distance Jaro–Winkler distance Lee distance Levenshtein automaton Levenshtein distance Wagner–Fischer algorithm
String-searching algorithm	Apostolico–Giancarlo algorithm Boyer–Moore string-search algorithm Boyer–Moore–Horspool algorithm Knuth–Morris–Pratt algorithm Rabin–Karp algorithm Raita algorithm Trigram search Two-way string-matching algorithm Zhu–Takaoka string matching algorithm
Multiple string searching	Aho–Corasick Commentz-Walter algorithm
Regular expression	Comparison of regular-expression engines Regular grammar Thompson's construction Nondeterministic finite automaton
Sequence alignment	BLAST Hirschberg's algorithm Needleman–Wunsch algorithm Smith–Waterman algorithm
Data structure	DAFSA Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search tree Trie
Other	Parsing Pattern matching Compressed pattern matching Longest common subsequence Longest common substring Sequential pattern mining Sorting String rewriting systems String operations