| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uhm (0) - 1 freq uha (1) - 2 freq ahm (1) - 201 freq uh (1) - 8 freq ihm (1) - 5 freq fhm (1) - 1 freq hm (1) - 12 freq uhi (1) - 1 freq um (1) - 142 freq uhj (1) - 2 freq uim (1) - 1 freq hmo (2) - 1 freq uup (2) - 4 freq 'uh (2) - 2 freq nuh (2) - 4 freq 'hi (2) - 6 freq rom (2) - 4 freq aha (2) - 8 freq ul (2) - 9 freq jim (2) - 234 freq ihy (2) - 1 freq whom (2) - 17 freq arm (2) - 50 freq ucht (2) - 1 freq hmm (2) - 22 freq |
uhm (0) - 1 freq ihm (1) - 5 freq hm (1) - 12 freq ahm (1) - 201 freq hmi (2) - 2 freq ham (2) - 49 freq hym (2) - 5 freq hem (2) - 27 freq hom (2) - 38 freq him (2) - 8386 freq hum (2) - 44 freq ahem (2) - 12 freq ahim (2) - 3 freq uim (2) - 1 freq uha (2) - 2 freq fhm (2) - 1 freq uhj (2) - 2 freq hmo (2) - 1 freq um (2) - 142 freq uhi (2) - 1 freq uh (2) - 8 freq hx (3) - 5 freq tim (3) - 46 freq wam (3) - 1 freq vim (3) - 1 freq |
SoundEx code - U500 um - 142 freq uhm - 1 freq 'um - 27 freq uni - 51 freq un - 31 freq ume - 2 freq umah - 1 freq unn - 5 freq uim - 1 freq une - 4 freq uuno - 1 freq uneo - 1 freq €˜um - 33 freq uon - 1 freq uno - 1 freq unyo - 1 freq umae - 1 freq uiwm - 1 freq uun - 1 freq |
MetaPhone code - UM um - 142 freq uhm - 1 freq 'um - 27 freq ume - 2 freq umah - 1 freq uim - 1 freq €˜um - 33 freq umae - 1 freq uiwm - 1 freq |
UHM |
| Time to execute Levenshtein function - 0.202228 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.491463 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.059453 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.078398 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.001102 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. |