| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mairower (0) - 11 freq mairker (2) - 1 freq makeower (2) - 1 freq narrower (2) - 2 freq mairatower (2) - 2 freq narrowed (3) - 3 freq mainer (3) - 9 freq takower (3) - 1 freq mairkers (3) - 1 freq mirker (3) - 1 freq maitcer (3) - 1 freq markweir (3) - 2 freq aower (3) - 1 freq mirkier (3) - 2 freq makkowers (3) - 1 freq makeover (3) - 5 freq kaim-ower (3) - 1 freq hangower (3) - 3 freq mairble (3) - 4 freq mariner (3) - 3 freq mairked (3) - 3 freq passower (3) - 9 freq fairmer (3) - 61 freq layower (3) - 1 freq pairtner (3) - 42 freq |
mairower (0) - 11 freq mairatower (3) - 2 freq mairker (3) - 1 freq makeower (3) - 1 freq mower (4) - 15 freq mirkier (4) - 2 freq grower (4) - 2 freq marker (4) - 11 freq mairrie (4) - 7 freq mariner (4) - 3 freq markweir (4) - 2 freq meirour (4) - 1 freq mirker (4) - 1 freq narrower (4) - 2 freq rower (4) - 2 freq merrier (5) - 4 freq hairder (5) - 16 freq mairket (5) - 20 freq hameower (5) - 3 freq hairber (5) - 35 freq maireh (5) - 3 freq maitter (5) - 382 freq inower (5) - 10 freq mairried (5) - 40 freq mairied (5) - 10 freq |
SoundEx code - M660 mirror - 111 freq morear - 3 freq mairower - 11 freq 'mirror - 1 freq mirror' - 1 freq meirour - 1 freq meirrour - 4 freq meirrur - 2 freq merrier - 4 freq mirrir - 1 freq mnrur - 1 freq |
MetaPhone code - MRWR mairower - 11 freq |
MAIROWER |
| Time to execute Levenshtein function - 0.253435 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.426166 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.040473 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.040941 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.000887 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. |