| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owrelippin (0) - 1 freq owerlappin (3) - 3 freq dreippin (3) - 1 freq grippin (4) - 21 freq owregien (4) - 1 freq owerleppan (4) - 1 freq owrelookit (4) - 1 freq owerlappan (4) - 1 freq owresaein (4) - 1 freq strippin (4) - 9 freq wrappin (4) - 16 freq worshippin (4) - 1 freq whippin (4) - 3 freq relishin (4) - 2 freq lippin (4) - 9 freq overlappin (4) - 2 freq dreipin (4) - 4 freq owre-abuin (4) - 1 freq threipin (4) - 10 freq unclippin (4) - 1 freq rippin (4) - 21 freq flippin (4) - 7 freq relivin (4) - 1 freq trippin (4) - 33 freq treelipin (4) - 2 freq |
owrelippin (0) - 1 freq owerlappin (3) - 3 freq owerleppan (4) - 1 freq owerlappan (4) - 1 freq overlappin (5) - 2 freq wrappin (5) - 16 freq owertappin (5) - 1 freq owerlappit (5) - 1 freq dreippin (5) - 1 freq clippin (6) - 12 freq treelipin (6) - 2 freq trippin (6) - 33 freq flippin (6) - 7 freq slippin (6) - 28 freq weppin (6) - 1 freq wrappan (6) - 1 freq rippin (6) - 21 freq wippin (6) - 3 freq drippin (6) - 23 freq preppin (6) - 1 freq prippin (6) - 1 freq lippin (6) - 9 freq whippin (6) - 3 freq worshippin (6) - 1 freq unclippin (6) - 1 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 - ORLPN owrelippin - 1 freq |
OWRELIPPIN |
| Time to execute Levenshtein function - 0.239891 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.408924 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.028279 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.039055 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.000992 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. |