| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| um-eet (0) - 1 freq meet (2) - 349 freq unmeet (2) - 1 freq bumbees (3) - 1 freq nummert (3) - 4 freq upseyt (3) - 1 freq mumsnet (3) - 1 freq queet (3) - 2 freq use't (3) - 13 freq unseen (3) - 29 freq spreet (3) - 4 freq sumeen (3) - 1 freq meeee (3) - 1 freq tweet (3) - 100 freq meed (3) - 54 freq likeet (3) - 2 freq meit (3) - 3 freq eet (3) - 581 freq meent (3) - 22 freq veet (3) - 6 freq alreet (3) - 3 freq wheet (3) - 3 freq unjest (3) - 1 freq rumplet (3) - 1 freq jeet (3) - 1 freq |
um-eet (0) - 1 freq meet (3) - 349 freq monet (4) - 2 freq ment (4) - 18 freq mect (4) - 1 freq mett (4) - 1 freq meevt (4) - 1 freq mieht (4) - 1 freq motet (4) - 3 freq met (4) - 413 freq -eat (4) - 1 freq maest (4) - 15 freq meat (4) - 141 freq maset (4) - 1 freq am-eh (4) - 1 freq meent (4) - 22 freq maet (4) - 186 freq umlaut (4) - 3 freq mert (4) - 1 freq ameest (4) - 1 freq minet (4) - 2 freq mient (4) - 3 freq manet (4) - 1 freq meit (4) - 3 freq unmeet (4) - 1 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 - UMT um-eet - 1 freq |
UM-EET |
| Time to execute Levenshtein function - 0.208218 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.361683 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.029232 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.037123 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.000954 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. |