| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owerlappan (0) - 1 freq owerlappin (1) - 3 freq owerleppan (1) - 1 freq overlappin (2) - 2 freq owertappin (2) - 1 freq owerlappit (2) - 1 freq owerlap (3) - 3 freq owertakan (3) - 2 freq owerlaps (3) - 2 freq wrappan (3) - 1 freq clappan (4) - 2 freq overlap (4) - 1 freq owertakken (4) - 1 freq slappan (4) - 1 freq swappan (4) - 1 freq flappan (4) - 4 freq owerluikin (4) - 6 freq owerlang (4) - 2 freq owergyaan (4) - 1 freq ower-abuin (4) - 1 freq oweraa (4) - 5 freq lappan (4) - 1 freq wrappin (4) - 16 freq owerhearan (4) - 1 freq overladen (4) - 1 freq |
owerlappan (0) - 1 freq owerleppan (1) - 1 freq owerlappin (1) - 3 freq owerlappit (3) - 1 freq owertappin (3) - 1 freq overlappin (3) - 2 freq owrelippin (4) - 1 freq wrappan (4) - 1 freq wrappin (5) - 16 freq owerlap (5) - 3 freq owerlaps (5) - 2 freq owerpooran (6) - 1 freq lappan (6) - 1 freq owerlookin (6) - 4 freq owerluikin (6) - 6 freq owerleukin (6) - 4 freq flappan (6) - 4 freq clappan (6) - 2 freq owertakan (6) - 2 freq drappan (6) - 1 freq slappan (6) - 1 freq klappin (7) - 1 freq clippan (7) - 3 freq drappin (7) - 68 freq wrappit (7) - 10 freq |
SoundEx code - O641 owerlappin - 3 freq owerlappan - 1 freq owerlaps - 2 freq owerlap - 3 freq owrelippin - 1 freq owerlappit - 1 freq owerleppan - 1 freq oor-wulliefication - 1 freq |
MetaPhone code - OWRLPN owerlappin - 3 freq owerlappan - 1 freq owerleppan - 1 freq |
OWERLAPPAN |
| Time to execute Levenshtein function - 0.201911 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.360302 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.027503 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.036914 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.000846 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. |