| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mirrors (0) - 25 freq mirror' (1) - 1 freq mirrort (1) - 1 freq mirror's (1) - 1 freq mirror (1) - 117 freq mirrored (2) - 7 freq 'mirror (2) - 1 freq mirras (2) - 2 freq minors (2) - 1 freq errors (2) - 7 freq marros (2) - 1 freq marrows (2) - 1 freq mirror'd (2) - 1 freq microns (2) - 1 freq mirrens (2) - 1 freq horrors (2) - 18 freq mirrir (2) - 1 freq mirrorin (2) - 1 freq merro's (2) - 1 freq morrows (2) - 1 freq terrors (2) - 3 freq misers (3) - 1 freq yarrows (3) - 1 freq misters (3) - 1 freq currots (3) - 1 freq |
mirrors (0) - 25 freq mirror' (2) - 1 freq mirror's (2) - 1 freq mirror (2) - 117 freq mirrort (2) - 1 freq mirrorin (3) - 1 freq mirrir (3) - 1 freq merro's (3) - 1 freq mirrens (3) - 1 freq terrors (3) - 3 freq morrows (3) - 1 freq horrors (3) - 18 freq mirras (3) - 2 freq mirrored (3) - 7 freq marros (3) - 1 freq errors (3) - 7 freq marrows (3) - 1 freq mairtyrs (4) - 2 freq murmurs (4) - 2 freq marris (4) - 2 freq werrers (4) - 1 freq meirrour (4) - 4 freq merkers (4) - 1 freq warriors (4) - 20 freq morris (4) - 14 freq |
SoundEx code - M662 mirrors - 25 freq mararyk - 2 freq mirror's - 1 freq mirror-stand - 1 freq mrharrycole - 1 freq |
MetaPhone code - MRRS mirrors - 25 freq mirror's - 1 freq |
MIRRORS |
| Time to execute Levenshtein function - 0.213753 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.364299 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.027105 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.037081 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. |