| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mayflooer (0) - 3 freq meyflooer (1) - 3 freq mayflower (1) - 1 freq maeyflooer (1) - 1 freq mayflouer (1) - 1 freq meyfloer (2) - 1 freq €œflooer (3) - 1 freq 'flooer (3) - 1 freq flooer (3) - 150 freq marlowe (4) - 1 freq mayster (4) - 1 freq malone (4) - 4 freq €œflouer (4) - 1 freq mayfair (4) - 7 freq alooed (4) - 2 freq mayor (4) - 3 freq makeover (4) - 5 freq mailoots (4) - 1 freq madlove (4) - 3 freq flooers (4) - 195 freq mayfly (4) - 1 freq layower (4) - 1 freq macaloon (4) - 1 freq clooer (4) - 2 freq mayjer (4) - 1 freq |
mayflooer (0) - 3 freq maeyflooer (1) - 1 freq meyflooer (1) - 3 freq mayflouer (1) - 1 freq meyfloer (2) - 1 freq mayflower (2) - 1 freq flooer (4) - 150 freq 'flooer (4) - 1 freq floer (5) - 2 freq flouer (5) - 26 freq mayfly (5) - 1 freq floor (5) - 87 freq muffler (5) - 1 freq flooery (5) - 13 freq €œflooer (5) - 1 freq mayfair (5) - 7 freq hauf-oor (6) - 8 freq flier (6) - 1 freq caaliflooer (6) - 1 freq meeler (6) - 1 freq mayer (6) - 1 freq cauliflooer (6) - 2 freq 'flooers (6) - 1 freq floar (6) - 6 freq flower (6) - 14 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 |
MAYFLOOER |
| Time to execute Levenshtein function - 0.195575 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.357573 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.027193 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.037406 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.000849 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. |