| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mirror (0) - 117 freq mirror' (1) - 1 freq 'mirror (1) - 1 freq mirrir (1) - 1 freq mirrors (1) - 25 freq mirrort (1) - 1 freq milroy (2) - 3 freq meirrur (2) - 2 freq mirry (2) - 8 freq airmor (2) - 1 freq morrow (2) - 11 freq mirrorin (2) - 1 freq error (2) - 16 freq mordor (2) - 3 freq micro (2) - 3 freq mirror'd (2) - 1 freq mirras (2) - 2 freq mrrow (2) - 1 freq merro (2) - 1 freq terror (2) - 40 freq horror (2) - 50 freq micron (2) - 1 freq minor (2) - 15 freq meirrour (2) - 4 freq morro (2) - 18 freq |
mirror (0) - 117 freq mirrir (1) - 1 freq meirrur (2) - 2 freq mirrort (2) - 1 freq meirrour (2) - 4 freq mirrors (2) - 25 freq mirror' (2) - 1 freq 'mirror (2) - 1 freq mirr (3) - 3 freq marrow (3) - 32 freq morro (3) - 18 freq marros (3) - 1 freq mirren (3) - 144 freq mirrae (3) - 1 freq marmor (3) - 2 freq yirrr (3) - 1 freq horror (3) - 50 freq mirra (3) - 3 freq mirrie (3) - 7 freq mirrored (3) - 7 freq mirker (3) - 1 freq error (3) - 16 freq mirrorin (3) - 1 freq morrow (3) - 11 freq mirry (3) - 8 freq |
SoundEx code - M660 mirror - 117 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 - MRR mirror - 117 freq morear - 3 freq 'mirror - 1 freq mirror' - 1 freq meirour - 1 freq meirrour - 4 freq meirrur - 2 freq merrier - 4 freq mirrir - 1 freq |
MIRROR |
| Time to execute Levenshtein function - 0.499290 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.880031 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.029302 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.078719 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.001051 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. |