| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| abuinmentionit (0) - 1 freq mentionit (5) - 6 freq inventions (6) - 14 freq intentions (6) - 17 freq mentionin (6) - 9 freq intentional (6) - 1 freq mentiont (6) - 14 freq forementiont (6) - 1 freq aforementioned (6) - 7 freq intention (6) - 24 freq augmentin (6) - 1 freq reinvention (6) - 1 freq ruinaetion (6) - 1 freq invention (6) - 22 freq unintentional (6) - 1 freq conventionis (6) - 1 freq intentioned (6) - 1 freq mentionet (6) - 1 freq abomination (7) - 5 freq ill-intentioned (7) - 1 freq inventing (7) - 1 freq abdication (7) - 1 freq dimension (7) - 11 freq dimensions (7) - 2 freq defineetion (7) - 9 freq |
abuinmentionit (0) - 1 freq mentionit (7) - 6 freq mentionet (8) - 1 freq forementiont (8) - 1 freq mentiont (8) - 14 freq conventionis (9) - 1 freq unintentional (9) - 1 freq intentioned (9) - 1 freq abomination (9) - 5 freq abomonation (9) - 1 freq mentiounat (9) - 1 freq invention (9) - 22 freq mentiount (9) - 1 freq mentionin (9) - 9 freq intentions (9) - 17 freq inventions (9) - 14 freq aforementioned (9) - 7 freq intentional (9) - 1 freq reinvention (9) - 1 freq augmentin (9) - 1 freq intention (9) - 24 freq nominations (10) - 5 freq badminton (10) - 6 freq inventioun (10) - 1 freq mention (10) - 147 freq |
SoundEx code - A155 apenin - 10 freq apinion - 1 freq appenin - 3 freq appenan - 3 freq abomination - 5 freq aipenin - 5 freq apen-mindit - 1 freq abomination's - 1 freq abominable - 1 freq apennines - 1 freq abomonation - 1 freq abuinmentionit - 1 freq |
MetaPhone code - ABNMNXNT abuinmentionit - 1 freq |
ABUINMENTIONIT |
| Time to execute Levenshtein function - 0.282143 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.390949 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.028454 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.049411 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.001268 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. |