Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
mayfieldtait (0) - 1 freq mayfield (4) - 3 freq hayfield (5) - 3 freq maryfield (5) - 1 freq maetit (6) - 1 freq midfielder- (6) - 1 freq meltit (6) - 26 freq marytait (6) - 1 freq maintaint (6) - 1 freq wayfindin (6) - 1 freq afield (6) - 7 freq jail-bait (6) - 1 freq affectit (6) - 11 freq fieldwark (6) - 3 freq hadfield (6) - 4 freq midfield- (6) - 1 freq mutilatit (6) - 1 freq maieutic (6) - 1 freq yieldin (6) - 3 freq mayritt (6) - 1 freq mansfield (6) - 5 freq maitit (6) - 1 freq heyfields (6) - 1 freq midfield (6) - 18 freq maintain (6) - 16 freq |
mayfieldtait (0) - 1 freq mayfield (6) - 3 freq mutilatit (8) - 1 freq maladetta (8) - 1 freq affleectit (8) - 1 freq meltit (8) - 26 freq maryfield (8) - 1 freq hayfield (8) - 3 freq mediatit (9) - 1 freq reflectit (9) - 16 freq muildert (9) - 2 freq molestit (9) - 1 freq unfoldit (9) - 3 freq affloadit (9) - 1 freq midfielder (9) - 4 freq militant (9) - 2 freq matilda (9) - 372 freq moldit (9) - 2 freq foldit (9) - 12 freq aflott (9) - 3 freq inflectit (9) - 3 freq enfauldit (9) - 1 freq flittit (9) - 44 freq unfauldit (9) - 4 freq fledgit (9) - 1 freq |
SoundEx code - M143 muffled - 18 freq mobility - 6 freq mayfield - 3 freq mayfieldtait - 1 freq |
MetaPhone code - MFLTTT mayfieldtait - 1 freq |
MAYFIELDTAIT |
Time to execute Levenshtein function - 0.266964 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.420679 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.029481 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.041630 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.000879 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. |