Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
owerleppan (0) - 1 freq owerlappan (1) - 1 freq owerlappin (2) - 3 freq owerleukin (3) - 4 freq owertappin (3) - 1 freq owerhearan (3) - 1 freq owerlappit (3) - 1 freq overlappin (3) - 2 freq owerstepped (4) - 1 freq owersettar (4) - 1 freq owerlookin (4) - 4 freq owerlang (4) - 2 freq owerlay (4) - 1 freq owerlaps (4) - 2 freq owersman (4) - 1 freq owersettin (4) - 123 freq owerleggit (4) - 1 freq wrappan (4) - 1 freq owergeen (4) - 2 freq owerseas (4) - 5 freq owersetten (4) - 7 freq owerluikin (4) - 6 freq owrelippin (4) - 1 freq owertakan (4) - 2 freq owerseen (4) - 4 freq |
owerleppan (0) - 1 freq owerlappan (1) - 1 freq owerlappin (2) - 3 freq overlappin (4) - 2 freq owerlappit (4) - 1 freq owertappin (4) - 1 freq owrelippin (4) - 1 freq owerleukin (5) - 4 freq wrappan (5) - 1 freq owerlaps (6) - 2 freq owerluikin (6) - 6 freq owerpooran (6) - 1 freq owerlookin (6) - 4 freq owerhearan (6) - 1 freq owerlap (6) - 3 freq wrappin (6) - 16 freq clippan (7) - 3 freq weppin (7) - 1 freq lippan (7) - 1 freq preppin (7) - 1 freq whuppan (7) - 1 freq droppan (7) - 3 freq flippan (7) - 1 freq flappan (7) - 4 freq grippan (7) - 2 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 |
OWERLEPPAN |
Time to execute Levenshtein function - 0.427354 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.790040 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.078462 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.094849 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.000907 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. |