| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assumptions (0) - 6 freq assumption (1) - 12 freq assumption¬ (2) - 1 freq resumption (3) - 1 freq casumptious (3) - 1 freq auditions (4) - 1 freq adoptions (4) - 2 freq assuming (4) - 6 freq associations (4) - 5 freq gumption (4) - 12 freq assignations (4) - 1 freq amputations (4) - 1 freq sumptuous (4) - 1 freq presumption (4) - 3 freq aspirations (4) - 9 freq astrictions (4) - 3 freq consumption (4) - 8 freq assertion (4) - 1 freq gumptious (4) - 1 freq ablutions (4) - 2 freq dscriptions (4) - 1 freq eruptions (4) - 2 freq assumin (4) - 10 freq accusations (4) - 7 freq scrumptious (4) - 3 freq |
assumptions (0) - 6 freq assumption (2) - 12 freq assumption¬ (4) - 1 freq casumptious (5) - 1 freq resumption (5) - 1 freq assignations (6) - 1 freq sumptuous (6) - 1 freq associations (6) - 5 freq scrumptious (7) - 3 freq assumin (7) - 10 freq eruptions (7) - 2 freq dscriptions (7) - 1 freq i'simpsons (7) - 1 freq suspicions (7) - 1 freq simpsons (7) - 2 freq symptoms (7) - 22 freq assimilation (7) - 2 freq gumptious (7) - 1 freq seemptoms (7) - 1 freq amputations (7) - 1 freq assuming (7) - 6 freq gumption (7) - 12 freq adoptions (7) - 2 freq aspirations (7) - 9 freq assertion (7) - 1 freq |
SoundEx code - A251 accompanit - 1 freq assembly - 26 freq accomplice - 3 freq accomplishments - 1 freq accompaniment - 6 freq assembled - 15 freq again-baith - 1 freq accompli - 1 freq assumptions - 6 freq assemble - 3 freq assemblie - 2 freq assumption - 12 freq accompanied - 22 freq accompany - 8 freq assembelt - 1 freq accompt - 2 freq accompts - 1 freq akimbo - 1 freq accomplishment - 1 freq auchinblae - 1 freq auchenfairlie - 1 freq assemblin - 1 freq accomplished - 2 freq accompanyin - 8 freq assembles - 1 freq auchenbinnie - 1 freq accomplist - 1 freq accumplished - 1 freq assumption¬ - 1 freq assemblan - 1 freq accomplisht - 3 freq accompong - 2 freq assembledin - 1 freq assemblet - 1 freq aknovh - 1 freq ahoajmfrwq - 1 freq accompanying - 1 freq aconfedofdunces - 1 freq |
MetaPhone code - ASMPXNS assumptions - 6 freq |
ASSUMPTIONS |
| Time to execute Levenshtein function - 0.228086 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.387588 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.027435 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.038430 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.000883 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. |