| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unmade (0) - 5 freq unrade (1) - 1 freq €œmade (2) - 1 freq invade (2) - 5 freq umae (2) - 1 freq untape (2) - 1 freq 'made (2) - 1 freq untae (2) - 13 freq unsafe (2) - 2 freq undae (2) - 3 freq unease (2) - 6 freq made (2) - 2115 freq remade (2) - 1 freq brade (3) - 1 freq in'ae (3) - 13 freq upgrade (3) - 1 freq uptake (3) - 4 freq unfree (3) - 1 freq mad (3) - 356 freq male (3) - 59 freq bade (3) - 237 freq nad (3) - 1 freq onyane (3) - 13 freq unwed (3) - 1 freq tntae (3) - 1 freq |
unmade (0) - 5 freq unrade (2) - 1 freq undae (3) - 3 freq 'made (3) - 1 freq remade (3) - 1 freq made (3) - 2115 freq invade (3) - 5 freq entada (4) - 1 freq 'mad (4) - 4 freq hamada (4) - 1 freq madoe (4) - 1 freq nme (4) - 2 freq ande (4) - 4 freq unload (4) - 3 freq annad (4) - 1 freq insyde (4) - 1 freq unsaid (4) - 6 freq maide (4) - 46 freq madi (4) - 1 freq unsaed (4) - 1 freq nomads (4) - 1 freq unmeet (4) - 1 freq untamed (4) - 1 freq ensyde (4) - 4 freq anymare (4) - 17 freq |
SoundEx code - U530 unmet - 3 freq unity - 45 freq unto - 8 freq untae - 13 freq unty - 4 freq unite - 11 freq unit - 42 freq unmade - 5 freq undae - 3 freq um-eet - 1 freq untie - 2 freq unwed - 1 freq und - 12 freq unmeet - 1 freq unyt - 7 freq €™und - 1 freq undo - 1 freq uinitie - 1 freq untee - 1 freq unt - 1 freq |
MetaPhone code - UNMT unmet - 3 freq unnamed - 4 freq unmade - 5 freq unnaemed - 1 freq unmeet - 1 freq |
UNMADE |
| Time to execute Levenshtein function - 0.189330 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.365155 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.027824 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.037343 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.000925 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. |