| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jpegmacdonald (0) - 1 freq janemacdonald (3) - 1 freq macdonald (4) - 26 freq mcdonald (5) - 20 freq mathsmacdonald (5) - 1 freq macdonalds (5) - 3 freq iannmcdonald (5) - 1 freq macdonals (5) - 1 freq macdonald's (6) - 1 freq cardonald (6) - 1 freq madonal (6) - 5 freq operational (6) - 3 freq allanmcdonald (6) - 2 freq madonals (6) - 1 freq mcdonalds (6) - 6 freq thenational (7) - 5 freq dundonald (7) - 2 freq mcdonald's (7) - 8 freq macdougall (7) - 8 freq macdougal (7) - 1 freq anecdotal (7) - 2 freq donald (7) - 193 freq regional (7) - 106 freq promotional (7) - 4 freq 'personal (7) - 1 freq |
jpegmacdonald (0) - 1 freq janemacdonald (5) - 1 freq macdonald (7) - 26 freq mcdonald (8) - 20 freq iannmcdonald (8) - 1 freq macdonals (9) - 1 freq macdonalds (9) - 3 freq allanmcdonald (9) - 2 freq mathsmacdonald (9) - 1 freq mcdonalds (10) - 6 freq madonals (11) - 1 freq macdonald's (11) - 1 freq madonal (11) - 5 freq cardonald (11) - 1 freq 'donald (12) - 2 freq pardoned (12) - 4 freq €œdonald (12) - 1 freq gcdnd (12) - 1 freq stewartmcdonald (12) - 7 freq stefmcdougall (12) - 2 freq m'donal (12) - 1 freq karengdonald (12) - 1 freq jpdeacons (12) - 1 freq macdougal (12) - 1 freq donald (12) - 193 freq |
SoundEx code - J125 joabcentre - 2 freq jobson's - 1 freq jvquinie - 1 freq jpegmacdonald - 1 freq jeabzmdjfj - 1 freq jjbugon - 1 freq |
MetaPhone code - JPKMKTNL |
JPEGMACDONALD |
| Time to execute Levenshtein function - 0.330303 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.510137 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.032321 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.040974 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.000999 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. |