| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owertappin (0) - 1 freq owerlappin (1) - 3 freq owerlappit (2) - 1 freq overlappin (2) - 2 freq owerlappan (2) - 1 freq ower-abuin (3) - 1 freq owergangin (3) - 5 freq owertaen (3) - 2 freq owertakken (3) - 1 freq owerturnin (3) - 1 freq owergaein (3) - 1 freq wrappin (3) - 16 freq owertakan (3) - 2 freq owerleppan (3) - 1 freq owergaun (4) - 1 freq swappin (4) - 6 freq owerluikin (4) - 6 freq wrappan (4) - 1 freq oonertakkin (4) - 1 freq owerthrowin (4) - 1 freq strappin (4) - 10 freq owerkeikin (4) - 1 freq wappin (4) - 26 freq owertaks (4) - 1 freq owertim (4) - 1 freq |
owertappin (0) - 1 freq owerlappin (2) - 3 freq owerlappan (3) - 1 freq owerlappit (4) - 1 freq overlappin (4) - 2 freq wrappin (4) - 16 freq owerleppan (4) - 1 freq owrelippin (5) - 1 freq wrappan (5) - 1 freq owertakan (5) - 2 freq owertakken (5) - 1 freq owertaen (5) - 2 freq owerturnin (5) - 1 freq crappin (6) - 11 freq wrappin' (6) - 1 freq stappin (6) - 45 freq unstappin (6) - 1 freq trappin (6) - 1 freq wrappit (6) - 10 freq drappin (6) - 68 freq droappin (6) - 8 freq wrapping (6) - 6 freq owerturn (6) - 2 freq weppin (6) - 1 freq tappin (6) - 22 freq |
SoundEx code - O631 orte-verlag - 2 freq ower-dependent - 1 freq owertappin - 1 freq ourdufc - 1 freq |
MetaPhone code - OWRTPN owertappin - 1 freq |
OWERTAPPIN |
| Time to execute Levenshtein function - 0.271194 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.419900 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.039023 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.045350 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.005495 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. |