| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| milestanes (0) - 6 freq milestane (1) - 2 freq millstanes (1) - 2 freq millstane (2) - 2 freq milestone (2) - 2 freq milestene (2) - 1 freq hailstanes (3) - 2 freq merkstanes (3) - 1 freq harestanes (3) - 1 freq mileages (3) - 1 freq mistakes (3) - 18 freq dilettantes (3) - 1 freq millstone (3) - 1 freq limestane (3) - 2 freq molestin (4) - 1 freq palestine (4) - 4 freq hailstane (4) - 1 freq thirlestane (4) - 3 freq moleskins (4) - 1 freq messages (4) - 148 freq distanee (4) - 2 freq inglestane (4) - 1 freq dilettanti (4) - 2 freq philistines (4) - 3 freq muntanes (4) - 1 freq |
milestanes (0) - 6 freq millstanes (2) - 2 freq milestane (2) - 2 freq milestene (3) - 1 freq milestone (3) - 2 freq millstane (4) - 2 freq hailstanes (4) - 2 freq molestin (5) - 1 freq hailstones (5) - 1 freq millstone (5) - 1 freq harestanes (5) - 1 freq moleskins (5) - 1 freq merkstanes (5) - 1 freq mistakes (5) - 18 freq intestines (6) - 1 freq molester (6) - 1 freq valentines (6) - 8 freq maltinus (6) - 1 freq lairstanes (6) - 1 freq listins (6) - 1 freq heidstanes (6) - 10 freq o'stanes (6) - 1 freq majesties (6) - 4 freq mistaen (6) - 7 freq militant (6) - 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 - MLSTNS milestanes - 6 freq millstanes - 2 freq |
MILESTANES |
| Time to execute Levenshtein function - 0.189314 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.345134 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.027690 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.036984 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.000909 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. |