| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| omuyjbr (0) - 1 freq ombr (3) - 1 freq mayjer (3) - 1 freq muster (4) - 7 freq 'muir (4) - 1 freq ojbt (4) - 1 freq muldb (4) - 1 freq owur (4) - 1 freq uyji (4) - 1 freq smuir (4) - 4 freq mutter (4) - 10 freq outer (4) - 4 freq ohhjr (4) - 1 freq muir (4) - 77 freq mjr (4) - 23 freq omfj (4) - 1 freq miyybg (4) - 1 freq maybe (4) - 428 freq xmur (4) - 1 freq mumbo (4) - 5 freq oyer (4) - 2 freq out-by (4) - 1 freq murmur (4) - 7 freq major (4) - 109 freq muthur (4) - 1 freq |
omuyjbr (0) - 1 freq ombr (4) - 1 freq mayjer (4) - 1 freq major (5) - 109 freq mjr (5) - 23 freq majer (5) - 1 freq amber (6) - 13 freq embra (6) - 96 freq munter (6) - 1 freq murmer (6) - 2 freq mayb (6) - 1 freq meyer (6) - 5 freq mulder (6) - 1 freq omb (6) - 3 freq mayer (6) - 1 freq muther (6) - 26 freq mubba (6) - 1 freq meysr (6) - 1 freq member (6) - 75 freq macabre (6) - 1 freq umbro (6) - 1 freq mayor (6) - 3 freq 'major (6) - 1 freq murdur (6) - 1 freq murr (6) - 1 freq |
SoundEx code - O521 oonexpeckit - 2 freq onicbodie - 1 freq oncuivert - 1 freq onciveilitie - 1 freq on-spoken - 1 freq onexpekkit - 1 freq onceover - 1 freq omzfjvwq - 1 freq onceuponashire - 7 freq omuyjbr - 1 freq onkypzp - 1 freq |
MetaPhone code - OMJBR omuyjbr - 1 freq |
OMUYJBR |
| Time to execute Levenshtein function - 0.296118 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.452792 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.032675 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.058084 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.001223 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. |