| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| associes (0) - 5 freq associe (1) - 32 freq associe's (1) - 1 freq associat (2) - 1 freq associates (2) - 4 freq lassies (3) - 308 freq assumes (3) - 4 freq assie (3) - 1 freq cassies (3) - 6 freq agencies (3) - 9 freq stories (3) - 359 freq shories (3) - 1 freq assizes (3) - 2 freq jassies (3) - 1 freq tassies (3) - 3 freq shoties (3) - 1 freq stovies (3) - 37 freq species (3) - 47 freq associated (3) - 10 freq assails (3) - 2 freq asses (3) - 2 freq lassock's (3) - 1 freq awbodies (3) - 1 freq abodies (3) - 1 freq associate (3) - 15 freq |
associes (0) - 5 freq associe's (2) - 1 freq associe (2) - 32 freq associates (3) - 4 freq associat (3) - 1 freq assails (4) - 2 freq species (4) - 47 freq asses (4) - 2 freq aussies (4) - 1 freq assizes (4) - 2 freq assuires (4) - 1 freq associate (4) - 15 freq assis (4) - 1 freq assumes (4) - 4 freq assauts (5) - 1 freq assets (5) - 15 freq soorces (5) - 15 freq assess (5) - 8 freq spices (5) - 16 freq issues (5) - 88 freq jassies (5) - 1 freq assyse (5) - 1 freq fasces (5) - 1 freq slices (5) - 19 freq spaces (5) - 19 freq |
SoundEx code - A222 assizes - 2 freq associe's - 1 freq accuses - 1 freq associes - 5 freq axcizojvhk - 1 freq |
MetaPhone code - ASSS assizes - 2 freq associe's - 1 freq associes - 5 freq |
ASSOCIES |
| Time to execute Levenshtein function - 0.404818 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.706875 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.076882 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.036949 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.000871 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. |