| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| malkied (0) - 3 freq malkie (1) - 12 freq mallies (2) - 1 freq mairied (2) - 10 freq milkie (2) - 2 freq maukie (2) - 1 freq talkies (2) - 1 freq alkies (2) - 4 freq maitied (2) - 1 freq walkid (2) - 1 freq walkies (2) - 8 freq talked (2) - 55 freq marked (2) - 28 freq maked (2) - 1 freq talkie (2) - 4 freq pawkied (2) - 1 freq married (2) - 30 freq mackies (2) - 4 freq mankie (2) - 6 freq alkie (2) - 3 freq dallied (2) - 1 freq milked (2) - 7 freq unmalkied (2) - 1 freq allied (2) - 4 freq manked (2) - 1 freq |
malkied (0) - 3 freq milked (2) - 7 freq malkie (2) - 12 freq maked (3) - 1 freq marked (3) - 28 freq masked (3) - 8 freq walked (3) - 285 freq unmalkied (3) - 1 freq manked (3) - 1 freq talked (3) - 55 freq milkie (3) - 2 freq walkid (3) - 1 freq mailed (4) - 2 freq yolked (4) - 1 freq laked (4) - 1 freq melted (4) - 10 freq milkit (4) - 5 freq sulked (4) - 1 freq baulked (4) - 1 freq waulked (4) - 1 freq malky (4) - 5 freq melki (4) - 4 freq mocked (4) - 9 freq mucked (4) - 4 freq mulled (4) - 2 freq |
SoundEx code - M423 maelstrom - 3 freq milked - 7 freq molocates - 2 freq malkied - 3 freq mollocate - 1 freq mollicate - 2 freq millstane - 2 freq mïll-stane - 1 freq mullsteen - 1 freq molested - 1 freq millstone - 1 freq milestanes - 6 freq millstanes - 2 freq mulligatawny - 1 freq molester - 1 freq molestit - 1 freq mulctit - 1 freq milkit - 5 freq mulk-caddie - 1 freq mulkshed - 1 freq milestane - 2 freq €œmolecatchers - 1 freq milestone - 2 freq molestin - 1 freq molocation - 1 freq milketrum - 1 freq milestene - 1 freq mleighton - 2 freq melissaterras - 2 freq mollicators - 1 freq milliestopshate - 1 freq |
MetaPhone code - MLKT milked - 7 freq malkied - 3 freq mollocate - 1 freq mollicate - 2 freq milkit - 5 freq |
MALKIED |
| Time to execute Levenshtein function - 0.232811 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.376926 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.028408 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.038170 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.000987 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. |