| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mayfly (0) - 1 freq mally (2) - 1 freq madly (2) - 5 freq laytly (2) - 1 freq mainly (2) - 40 freq saifly (2) - 1 freq mayol (2) - 1 freq manly (2) - 7 freq saufly (2) - 1 freq vainly (3) - 3 freq factly (3) - 1 freq mangle (3) - 4 freq malay (3) - 1 freq lykly (3) - 1 freq moyle (3) - 6 freq wainly (3) - 1 freq awffy (3) - 1 freq faitly (3) - 2 freq harly (3) - 13 freq waly (3) - 27 freq shyly (3) - 8 freq bumfly (3) - 1 freq eardly (3) - 1 freq ayday (3) - 1 freq payl (3) - 1 freq |
mayfly (0) - 1 freq manly (3) - 7 freq saufly (3) - 1 freq saifly (3) - 1 freq mayol (3) - 1 freq mainly (3) - 40 freq mally (3) - 1 freq madly (3) - 5 freq mall (4) - 4 freq maple (4) - 6 freq marl (4) - 1 freq mirly (4) - 1 freq manila (4) - 1 freq maol (4) - 1 freq mayfair (4) - 7 freq meyle (4) - 1 freq mal (4) - 2 freq mael (4) - 2 freq myle (4) - 15 freq masala (4) - 1 freq mily (4) - 2 freq meanly (4) - 1 freq safely (4) - 41 freq mahal (4) - 3 freq molly (4) - 10 freq |
SoundEx code - M140 mabel - 91 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 |
MAYFLY |
| Time to execute Levenshtein function - 0.407161 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 - 1.187119 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.099505 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.098638 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.000852 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. |