| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mabinogion (0) - 1 freq maginations (4) - 1 freq painsion (4) - 1 freq imagination (4) - 60 freq maintain (4) - 17 freq bingin (4) - 1 freq mintion (4) - 1 freq mainin (4) - 3 freq mayunion (4) - 1 freq martinocon (4) - 2 freq macinnon (4) - 1 freq mansion (4) - 25 freq lamination (4) - 1 freq apinion (4) - 1 freq managin (4) - 21 freq minion (4) - 3 freq mingin (4) - 103 freq mangin (4) - 13 freq habitation (4) - 6 freq nomination (5) - 1 freq hangin (5) - 29 freq machinin (5) - 1 freq combination (5) - 23 freq imaginin (5) - 14 freq mission (5) - 33 freq |
mabinogion (0) - 1 freq managin (5) - 21 freq mangin (5) - 13 freq bingin (5) - 1 freq mingin (5) - 103 freq maintain (6) - 17 freq bangin (6) - 41 freq mungin (6) - 2 freq munagin (6) - 1 freq bungin (6) - 3 freq minion (6) - 3 freq imagination (6) - 60 freq mayunion (6) - 1 freq mainin (6) - 3 freq mintion (6) - 1 freq macinnon (6) - 1 freq managan (6) - 1 freq mansion (6) - 25 freq mingie (7) - 2 freq ingin (7) - 18 freq robinson (7) - 22 freq minin (7) - 26 freq madigan (7) - 1 freq maginn (7) - 1 freq bingo (7) - 38 freq |
SoundEx code - M152 moving - 24 freq mabinogion - 1 freq mabonslaw - 2 freq map-makar - 1 freq mvmccu - 1 freq mpnxgjebep - 1 freq mibmj - 1 freq moving - 1 freq mbanks - 1 freq muffbeans - 16 freq |
MetaPhone code - MBNJN mabinogion - 1 freq |
MABINOGION |
| Time to execute Levenshtein function - 0.223745 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.392641 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.028973 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.037949 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.000919 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. |