| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| meyflooer (0) - 3 freq mayflooer (1) - 3 freq maeyflooer (1) - 1 freq meyfloer (1) - 1 freq mayflouer (2) - 1 freq mayflower (2) - 1 freq flooer (3) - 151 freq 'flooer (3) - 1 freq €œflooer (3) - 1 freq bellower (4) - 1 freq sunflooers (4) - 1 freq belltooer (4) - 1 freq cheffooer (4) - 1 freq flooery (4) - 13 freq meyer (4) - 5 freq monkeyflower (4) - 1 freq clooer (4) - 2 freq flouer (4) - 26 freq beyler (4) - 1 freq employer (4) - 10 freq sookyflooer (4) - 1 freq meyfair (4) - 1 freq mellowed (4) - 2 freq melter (4) - 1 freq sunfloor (4) - 1 freq |
meyflooer (0) - 3 freq maeyflooer (1) - 1 freq meyfloer (1) - 1 freq mayflooer (1) - 3 freq mayflouer (2) - 1 freq mayflower (3) - 1 freq 'flooer (4) - 1 freq flooer (4) - 151 freq meyfair (5) - 1 freq flouer (5) - 26 freq muffler (5) - 1 freq floer (5) - 2 freq employer (5) - 10 freq meeler (5) - 1 freq floor (5) - 87 freq €œflooer (5) - 1 freq flooery (5) - 13 freq efler (5) - 1 freq mayfair (6) - 7 freq flouery (6) - 1 freq meyster (6) - 2 freq flower (6) - 16 freq floo'er (6) - 3 freq mayfly (6) - 1 freq empooer (6) - 2 freq |
SoundEx code - M146 mayflouer - 1 freq muffler - 1 freq maeyflooer - 1 freq meyflooer - 3 freq meyfloer - 1 freq mayflooer - 3 freq mayflower - 1 freq |
MetaPhone code - MFLR mayflouer - 1 freq muffler - 1 freq maeyflooer - 1 freq meyflooer - 3 freq meyfloer - 1 freq mayflooer - 3 freq |
MEYFLOOER |
| Time to execute Levenshtein function - 0.237192 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.411458 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.031187 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.037926 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.000942 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. |