| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absurdities (0) - 1 freq abilities (4) - 6 freq casuities (4) - 1 freq absurdness (4) - 1 freq obscenities (4) - 2 freq burdies (4) - 7 freq autorities (4) - 2 freq impurities (4) - 2 freq asperities (4) - 1 freq abeilities (4) - 2 freq aunties (5) - 16 freq bruinies (5) - 1 freq abilitie (5) - 1 freq ambiguities (5) - 1 freq bourichies (5) - 1 freq auditions (5) - 1 freq sardines (5) - 3 freq birdies (5) - 27 freq suites (5) - 2 freq auldies (5) - 1 freq assurances (5) - 2 freq ascribes (5) - 1 freq actvities (5) - 1 freq abeelitie (5) - 4 freq priorities (5) - 19 freq |
absurdities (0) - 1 freq burdies (6) - 7 freq absurdness (6) - 1 freq obscenities (6) - 2 freq absurd (7) - 9 freq absorbit (7) - 4 freq absurdly (7) - 1 freq birdies (7) - 27 freq burdis (7) - 1 freq burdie's (7) - 1 freq musardries (7) - 1 freq bridies (7) - 1 freq bairdies (7) - 1 freq sardines (7) - 3 freq bardies (7) - 1 freq breeties (7) - 1 freq beardies (7) - 1 freq casuities (7) - 1 freq impurities (7) - 2 freq autorities (7) - 2 freq abilities (7) - 6 freq asperities (7) - 1 freq abeilities (7) - 2 freq versities (8) - 4 freq haurdlies (8) - 1 freq |
SoundEx code - A126 absurdness - 1 freq absurd - 9 freq absorbed - 4 freq absorbing - 1 freq abusers - 1 freq absorbit - 4 freq apsire - 1 freq apocryphal - 4 freq apocrypha - 3 freq apgrade - 3 freq absorbin - 4 freq absurdities - 1 freq affshore - 2 freq absurdly - 1 freq absorb - 2 freq abjuration - 1 freq afcherewego - 14 freq afcred - 3 freq afcheritage - 1 freq abxr - 1 freq |
MetaPhone code - ABSRTTS absurdities - 1 freq |
ABSURDITIES |
| Time to execute Levenshtein function - 0.206217 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.392893 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.028412 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.040157 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.000917 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. |