| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| maeyflooer (0) - 1 freq meyflooer (1) - 3 freq mayflooer (1) - 3 freq mayflower (2) - 1 freq mayflouer (2) - 1 freq meyfloer (2) - 1 freq monkeyflower (4) - 1 freq sookyflooer (4) - 1 freq 'flooer (4) - 1 freq cheffooer (4) - 1 freq flooer (4) - 151 freq €œflooer (4) - 1 freq caaliflooer (4) - 1 freq cauliflooer (4) - 2 freq tap-fleer (5) - 1 freq makeover (5) - 5 freq floo'er (5) - 3 freq maelody (5) - 1 freq mellowed (5) - 2 freq explorer (5) - 1 freq meeler (5) - 1 freq flower (5) - 16 freq layower (5) - 1 freq maeter (5) - 2 freq weel-looed (5) - 1 freq |
maeyflooer (0) - 1 freq meyflooer (1) - 3 freq mayflooer (1) - 3 freq mayflouer (2) - 1 freq meyfloer (2) - 1 freq mayflower (3) - 1 freq flooer (5) - 151 freq 'flooer (5) - 1 freq efler (6) - 1 freq mayfair (6) - 7 freq floor (6) - 87 freq meyfair (6) - 1 freq muffler (6) - 1 freq employer (6) - 10 freq meeler (6) - 1 freq cauliflooer (6) - 2 freq mayfly (6) - 1 freq flooery (6) - 13 freq floer (6) - 2 freq €œflooer (6) - 1 freq flouer (6) - 26 freq caaliflooer (6) - 1 freq sookyflooer (6) - 1 freq makeower (7) - 1 freq madlove (7) - 3 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 |
MAEYFLOOER |
| Time to execute Levenshtein function - 0.273052 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.416681 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.029819 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.038769 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.000949 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. |