| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unmapped (0) - 1 freq unwrapped (2) - 3 freq mapped (2) - 4 freq unmouped (2) - 1 freq unmasked (2) - 1 freq untappd (2) - 1 freq snapped (2) - 40 freq unmarked (2) - 1 freq unpacked (3) - 3 freq tapped (3) - 17 freq unmatched (3) - 1 freq unhappy (3) - 10 freq unwanted (3) - 6 freq swapped (3) - 9 freq unnaemed (3) - 1 freq mopped (3) - 3 freq wapped (3) - 5 freq unfaaled (3) - 2 freq unfashed (3) - 1 freq flapped (3) - 3 freq ungawked (3) - 1 freq trapped (3) - 24 freq unspaed (3) - 1 freq crapped (3) - 1 freq drapped (3) - 110 freq |
unmapped (0) - 1 freq untappd (3) - 1 freq unmouped (3) - 1 freq mapped (3) - 4 freq nipped (4) - 22 freq unmarked (4) - 1 freq mopped (4) - 3 freq snapped (4) - 40 freq unwrapped (4) - 3 freq unmasked (4) - 1 freq whapped (5) - 1 freq happed (5) - 35 freq yapped (5) - 2 freq stoapped (5) - 21 freq slapped (5) - 14 freq entrapped (5) - 1 freq droapped (5) - 6 freq clapped (5) - 28 freq napper (5) - 36 freq unmalkied (5) - 1 freq snipped (5) - 6 freq chapped (5) - 40 freq wrapped (5) - 55 freq anclapped (5) - 1 freq stapped (5) - 121 freq |
SoundEx code - U513 unbathert - 1 freq unbidden - 6 freq unbuttonin - 1 freq unevytable - 2 freq umpteenth - 9 freq umpteen - 15 freq unbooed - 1 freq unboadied - 1 freq unfaddomed - 1 freq unfathomably - 1 freq unbitter - 1 freq unbeatable - 2 freq unpattrened - 2 freq unfaddomable - 1 freq unbuttoned - 4 freq unfettered - 2 freq unfaithful - 2 freq unbodie't - 3 freq unavoydable - 1 freq unbutton - 2 freq unpatentit - 1 freq unhappt - 1 freq unbowed - 1 freq unmouped - 1 freq unavoidable - 3 freq unmapped - 1 freq unified - 3 freq unbothered - 1 freq unbiddan - 1 freq unpaid - 3 freq unfit - 1 freq |
MetaPhone code - UNMPT unmouped - 1 freq unmapped - 1 freq |
UNMAPPED |
| Time to execute Levenshtein function - 0.422458 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.709475 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.067010 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.042917 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.001022 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. |