| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| makrel (0) - 1 freq manuel (2) - 2 freq makken (2) - 14 freq maree (2) - 1 freq mackerel (2) - 8 freq makker (2) - 7 freq maire (2) - 146 freq maker (2) - 18 freq mael (2) - 2 freq marred (2) - 5 freq make (2) - 649 freq ma'sel (2) - 3 freq mareel (2) - 3 freq baurel (2) - 2 freq murrel (2) - 1 freq marl (2) - 1 freq maked (2) - 1 freq maken (2) - 3 freq mares (2) - 2 freq laurel (2) - 4 freq makes (2) - 189 freq marvel (2) - 6 freq maasel (2) - 2 freq mairvel (2) - 2 freq maireh (2) - 3 freq |
makrel (0) - 1 freq mareel (3) - 3 freq marl (3) - 1 freq mackerel (3) - 8 freq murrel (3) - 1 freq mikael (3) - 1 freq maker (3) - 18 freq karl (4) - 6 freq muriel (4) - 5 freq murl (4) - 2 freq makaris (4) - 1 freq maesel (4) - 19 freq mabel (4) - 91 freq natrel (4) - 3 freq magret (4) - 2 freq macel (4) - 1 freq makem (4) - 1 freq kriel (4) - 1 freq farel (4) - 1 freq mikebel (4) - 1 freq makar (4) - 98 freq marley (4) - 4 freq hkrl (4) - 1 freq mayoral (4) - 1 freq makar' (4) - 1 freq |
SoundEx code - M264 mcguire'll - 1 freq mackerel - 8 freq makrel - 1 freq majorly - 2 freq micro-licht - 1 freq makar-like - 1 freq measureless - 1 freq mackerrell - 1 freq microloans - 1 freq miserly - 1 freq macsorley - 1 freq mcarle - 2 freq mccarlie - 1 freq mozzarella - 1 freq misrule - 1 freq |
MetaPhone code - MKRL mackerel - 8 freq makrel - 1 freq mackerrell - 1 freq mcarle - 2 freq |
MAKREL |
| Time to execute Levenshtein function - 0.240574 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.420940 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.028403 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.040840 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.000910 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. |