| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| murphy (0) - 27 freq murray (2) - 96 freq mumph (2) - 1 freq murky (2) - 10 freq mushy (2) - 7 freq muithy (2) - 1 freq dumphy (2) - 50 freq marshy (2) - 3 freq furthy (2) - 1 freq morph (2) - 1 freq humphy (2) - 52 freq murfy (2) - 1 freq curry (3) - 30 freq morphed (3) - 1 freq mueh (3) - 1 freq myrh (3) - 1 freq pulpy (3) - 1 freq murmur (3) - 6 freq marky (3) - 1 freq hurly (3) - 4 freq much- (3) - 2 freq ury (3) - 2 freq surely (3) - 179 freq murder (3) - 85 freq muchly (3) - 2 freq |
murphy (0) - 27 freq morph (2) - 1 freq mumph (3) - 1 freq marshy (3) - 3 freq mph (4) - 2 freq mrp (4) - 1 freq march (4) - 138 freq martha (4) - 7 freq marsh (4) - 8 freq mirth (4) - 10 freq marcha (4) - 1 freq mmph (4) - 2 freq merch (4) - 43 freq atrophy (4) - 1 freq trophy (4) - 15 freq marche (4) - 1 freq myrrh (4) - 10 freq marple (4) - 2 freq mareh (4) - 3 freq muithy (4) - 1 freq murray (4) - 96 freq morphed (4) - 1 freq dumphy (4) - 50 freq murfy (4) - 1 freq humphy (4) - 52 freq |
SoundEx code - M610 murphy - 27 freq mirabeau - 1 freq €™marv - 1 freq marv - 3 freq morph - 1 freq murfy - 1 freq mrp - 1 freq |
MetaPhone code - MRF murphy - 27 freq €™marv - 1 freq marv - 3 freq morph - 1 freq murfy - 1 freq |
MURPHY |
| Time to execute Levenshtein function - 0.209271 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.315502 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.026888 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.036482 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.000866 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. |