| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| myrds (0) - 1 freq mirds (1) - 1 freq myrus (1) - 2 freq myres (1) - 1 freq mynds (1) - 14 freq mercs (2) - 1 freq myles (2) - 4 freq moods (2) - 7 freq myrh (2) - 1 freq mynd's (2) - 1 freq kynds (2) - 5 freq mrs (2) - 754 freq hirds (2) - 8 freq birds (2) - 198 freq mar's (2) - 1 freq mynd (2) - 255 freq synds (2) - 2 freq mares (2) - 2 freq mires (2) - 3 freq cards (2) - 33 freq kerds (2) - 1 freq mird (2) - 6 freq marys (2) - 3 freq wirds (2) - 876 freq girds (2) - 5 freq |
myrds (0) - 1 freq mirds (1) - 1 freq murdos (2) - 1 freq mynds (2) - 14 freq myrus (2) - 2 freq myres (2) - 1 freq marts (3) - 4 freq murs (3) - 1 freq muids (3) - 3 freq mands (3) - 1 freq morde (3) - 1 freq cerds (3) - 1 freq burds (3) - 100 freq wurds (3) - 228 freq mends (3) - 3 freq mardi (3) - 2 freq monds (3) - 8 freq rds (3) - 1 freq mars (3) - 59 freq byrdis (3) - 1 freq mids (3) - 70 freq maris (3) - 1 freq words (3) - 811 freq fords (3) - 1 freq meids (3) - 3 freq |
SoundEx code - M632 mortgage - 12 freq mortclaith - 2 freq mort-kist - 1 freq mortakty - 1 freq marts - 4 freq mortgaged - 1 freq mort-saufs - 1 freq merits - 7 freq murdoch - 18 freq mortice - 4 freq 'mort-safes' - 1 freq morticia - 3 freq mortgages - 4 freq mairtha's - 1 freq mort-kloot - 1 freq mairieds - 1 freq mortis - 2 freq murdoch's - 2 freq murdochs - 3 freq martij - 1 freq murdieston - 1 freq murdos - 1 freq meritocracy - 1 freq merridge - 1 freq mirds - 1 freq mortscotty - 1 freq muirtsmith - 1 freq martyguigan - 1 freq mritchiemp - 1 freq mradclyffe - 6 freq myrds - 1 freq murdo's - 1 freq mayordcsdc - 2 freq |
MetaPhone code - MRTS marts - 4 freq merits - 7 freq mortice - 4 freq mairieds - 1 freq mortis - 2 freq murdos - 1 freq mirds - 1 freq myrds - 1 freq murdo's - 1 freq |
MYRDS |
| Time to execute Levenshtein function - 0.208523 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.378438 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.032757 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.043400 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.000953 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. |