| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| movilla (0) - 3 freq villa (2) - 7 freq manilla (2) - 1 freq milla (2) - 1 freq movilla's (2) - 1 freq gorilla (2) - 7 freq novella (2) - 4 freq torvill (3) - 1 freq seville (3) - 1 freq moo'll (3) - 1 freq movin (3) - 1 freq mobiles (3) - 5 freq moild (3) - 1 freq evill (3) - 1 freq mcgill (3) - 2 freq filla (3) - 1 freq mobil (3) - 1 freq vanilla (3) - 6 freq yilla (3) - 1 freq molly (3) - 10 freq willa (3) - 3 freq novelle (3) - 4 freq saville (3) - 5 freq jovial (3) - 1 freq movie (3) - 15 freq |
movilla (0) - 3 freq novella (3) - 4 freq villa (3) - 7 freq milla (3) - 1 freq manilla (3) - 1 freq eivill (4) - 1 freq lovell (4) - 1 freq novelle (4) - 4 freq morally (4) - 3 freq saville (4) - 5 freq mille (4) - 1 freq millya (4) - 1 freq molly (4) - 10 freq mill (4) - 80 freq melville (4) - 1 freq ville (4) - 1 freq neville (4) - 14 freq evill (4) - 1 freq gorilla (4) - 7 freq moo'll (4) - 1 freq seville (4) - 1 freq movilla's (4) - 1 freq mysell (5) - 2 freq novils (5) - 1 freq shilla (5) - 3 freq |
SoundEx code - M140 mabel - 90 freq mobile - 57 freq maple - 6 freq maybole - 1 freq muffle - 4 freq movilla - 3 freq mayfly - 1 freq mobil - 1 freq maipil - 1 freq mbl - 1 freq mable - 2 freq |
MetaPhone code - MFL muffle - 4 freq movilla - 3 freq mayfly - 1 freq |
MOVILLA |
| Time to execute Levenshtein function - 0.265624 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.447143 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.032378 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.055119 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.000983 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. |