| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| overlap (0) - 1 freq owerlap (1) - 3 freq overaw (2) - 3 freq overly (2) - 6 freq owerlay (2) - 1 freq overload (2) - 2 freq owerlaps (2) - 2 freq overlappin (3) - 2 freq coveran (3) - 2 freq owerfar (3) - 1 freq hoveran (3) - 1 freq skerla (3) - 1 freq owermah (3) - 1 freq owercam (3) - 1 freq ower-aw (3) - 1 freq verbal (3) - 28 freq versa (3) - 4 freq operas (3) - 3 freq velay (3) - 1 freq oweraw (3) - 7 freq owerly (3) - 1 freq verray (3) - 1 freq overdo (3) - 1 freq overtly (3) - 1 freq operae (3) - 1 freq |
overlap (0) - 1 freq owerlap (2) - 3 freq overly (3) - 6 freq overload (3) - 2 freq everly (4) - 1 freq overall (4) - 6 freq owerlay (4) - 1 freq overaw (4) - 3 freq owerlaps (4) - 2 freq overpaid (5) - 3 freq overcame (5) - 2 freq oversee (5) - 1 freq overs (5) - 2 freq verra (5) - 434 freq overt (5) - 4 freq vera (5) - 29 freq overrun (5) - 1 freq over (5) - 335 freq overuse (5) - 1 freq overalls (5) - 4 freq everday (5) - 2 freq overcoat (5) - 2 freq overseas (5) - 2 freq owerlate (5) - 1 freq verlaine (5) - 2 freq |
SoundEx code - O164 overly - 6 freq overruled - 3 freq overlooking - 2 freq overwhelmed - 7 freq overloaded - 2 freq overall - 6 freq overlappin - 2 freq overwhelmin - 7 freq overlap - 1 freq overladen - 1 freq overload - 2 freq overalls - 4 freq overwhelms - 1 freq o'freeloaders - 1 freq overlandertheb - 2 freq overlooked - 1 freq overwhelming - 1 freq |
MetaPhone code - OFRLP overlap - 1 freq |
OVERLAP |
| Time to execute Levenshtein function - 0.221473 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.416362 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.029944 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.068077 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000803 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |