| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| overlooking (0) - 2 freq owerlookin (2) - 4 freq overlooked (3) - 1 freq owerlookit (3) - 2 freq 'looking (4) - 1 freq owerluikin (4) - 6 freq overflowin (4) - 1 freq everlasting (4) - 1 freq owerhinking (4) - 1 freq overlappin (4) - 2 freq good-looking (4) - 2 freq looking (4) - 162 freq odd-lookin (4) - 1 freq owerleukin (4) - 4 freq overweaning (4) - 1 freq onlookin (4) - 2 freq overtook (4) - 1 freq owerlook (4) - 1 freq overhung (5) - 1 freq rocking (5) - 2 freq oorie-lookin (5) - 1 freq looming (5) - 3 freq bad-lookin' (5) - 1 freq owerkeikin (5) - 1 freq overhearin (5) - 1 freq |
overlooking (0) - 2 freq owerlookin (4) - 4 freq overlooked (5) - 1 freq looking (6) - 162 freq owerleukin (6) - 4 freq overweaning (6) - 1 freq everlasting (6) - 1 freq owerlookit (6) - 2 freq owerluikin (6) - 6 freq 'looking (6) - 1 freq overladen (7) - 1 freq verlaine (7) - 2 freq verging (7) - 1 freq drooling (7) - 2 freq iverything (7) - 1 freq vorilong (7) - 1 freq everything (7) - 97 freq provoking (7) - 3 freq everyhing (7) - 14 freq iverleevin (7) - 1 freq owerlang (7) - 2 freq erling (7) - 1 freq iverthing (7) - 1 freq good-looking (7) - 2 freq onlookin (7) - 2 freq |
SoundEx code - O164 overly - 6 freq overruled - 2 freq overlooking - 2 freq overall - 7 freq overwhelmed - 7 freq overloaded - 2 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 - OFRLKNK overlooking - 2 freq |
OVERLOOKING |
| Time to execute Levenshtein function - 0.598497 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.799779 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.029072 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.095772 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.000831 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. |