Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
meyfair (0) - 1 freq mayfair (1) - 7 freq effair (2) - 1 freq mid-air (3) - 8 freq fair (3) - 1530 freq mennir (3) - 1 freq eflir (3) - 1 freq efir (3) - 1 freq oonfair (3) - 1 freq meyster (3) - 2 freq unfair (3) - 10 freq meysr (3) - 1 freq eftir (3) - 500 freq mentain (3) - 1 freq perfait (3) - 2 freq machair (3) - 3 freq eynar (3) - 34 freq anymair (3) - 33 freq eyfi (3) - 1 freq weylaid (3) - 1 freq befaire (3) - 4 freq affair (3) - 36 freq meir (3) - 7 freq metafir (3) - 1 freq seanair (3) - 1 freq |
meyfair (0) - 1 freq mayfair (1) - 7 freq effair (3) - 1 freq mear (4) - 3 freq 'fair (4) - 6 freq mair (4) - 6172 freq meir (4) - 7 freq affair (4) - 36 freq miair (4) - 1 freq metafir (4) - 1 freq meyer (4) - 5 freq measuir (4) - 1 freq memoir (4) - 3 freq offair (4) - 11 freq mohair (4) - 2 freq befaire (4) - 4 freq effeir (4) - 1 freq meyfloer (4) - 1 freq befoir (4) - 2 freq oonfair (4) - 1 freq efir (4) - 1 freq fair (4) - 1530 freq meysr (4) - 1 freq unfair (4) - 10 freq efier (5) - 1 freq |
SoundEx code - M160 mayfair - 7 freq mover - 1 freq meyfair - 1 freq mffr - 1 freq |
MetaPhone code - MFR mayfair - 7 freq mover - 1 freq meyfair - 1 freq mffr - 1 freq |
MEYFAIR |
Time to execute Levenshtein function - 0.233602 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.380088 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.031494 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.038586 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.001118 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. |