| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mayfield (0) - 4 freq hayfield (1) - 3 freq maryfield (1) - 1 freq mansfield (2) - 5 freq heyfield (2) - 3 freq hadfield (2) - 4 freq afield (2) - 8 freq midfield (2) - 18 freq married (3) - 30 freq renfield (3) - 2 freq midfield- (3) - 1 freq heyfields (3) - 1 freq field (3) - 230 freq mayfly (3) - 1 freq caulfield (3) - 1 freq mid-field (3) - 1 freq minefield (3) - 4 freq nuffield (3) - 3 freq lea-field (3) - 1 freq sanfiel (3) - 1 freq maitied (3) - 1 freq ootfield (3) - 1 freq fairfield (3) - 1 freq millfield (3) - 2 freq murrayfield (3) - 8 freq |
mayfield (0) - 4 freq hayfield (2) - 3 freq maryfield (2) - 1 freq afield (3) - 8 freq midfield (3) - 18 freq heyfield (3) - 3 freq minefield (4) - 4 freq mayfly (4) - 1 freq enfield (4) - 7 freq field (4) - 230 freq ootfield (4) - 1 freq seafield (4) - 7 freq hadfield (4) - 4 freq mansfield (4) - 5 freq muild (5) - 4 freq myld (5) - 1 freq heyfields (5) - 1 freq mairied (5) - 10 freq malkied (5) - 3 freq meld (5) - 4 freq feeld (5) - 1 freq mailed (5) - 2 freq mild (5) - 40 freq marled (5) - 2 freq moild (5) - 1 freq |
SoundEx code - M143 mayfield - 4 freq muffled - 18 freq mobility - 6 freq mayfieldtait - 1 freq |
MetaPhone code - MFLT mayfield - 4 freq muffled - 18 freq |
MAYFIELD |
| Time to execute Levenshtein function - 0.233133 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.412657 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.028141 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.040842 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.000978 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. |