Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aissil-tuith (0) - 1 freq assiduity (5) - 1 freq misslouth (5) - 3 freq assistit (5) - 1 freq fossil-fish (5) - 1 freq aitkilith (5) - 1 freq assimilatit (6) - 1 freq assistin (6) - 2 freq rissolution (6) - 4 freq mussilburgh (6) - 1 freq misfittit (6) - 3 freq ainimatit (6) - 1 freq assistants (6) - 3 freq dessicatit (6) - 1 freq airn-stith (6) - 1 freq dissipatin (6) - 4 freq visitit (6) - 2 freq lossiemouth (6) - 3 freq isolatit (6) - 8 freq insistit (6) - 19 freq assignit (6) - 1 freq assistant (6) - 19 freq stiltit (6) - 1 freq again-baith (6) - 1 freq disstunt (6) - 1 freq |
aissil-tuith (0) - 1 freq fossil-fish (8) - 1 freq assaultit (8) - 1 freq assistit (8) - 1 freq misslouth (8) - 3 freq assertit (9) - 2 freq stiltit (9) - 1 freq assaultet (9) - 2 freq wallie-teeth (9) - 1 freq isolatit (9) - 8 freq assautit (9) - 1 freq assortit (9) - 3 freq assimilatit (9) - 1 freq assiduity (9) - 1 freq aitkilith (9) - 1 freq skin-taut (10) - 1 freq assyth (10) - 1 freq associatit (10) - 15 freq mesel-but (10) - 1 freq assault (10) - 14 freq slottit (10) - 2 freq assaults (10) - 1 freq assipattle (10) - 5 freq resultit (10) - 5 freq escalatit (10) - 1 freq |
SoundEx code - A243 aizelt - 1 freq assaulted - 3 freq assault - 14 freq assailed - 2 freq age-auld - 2 freq assaultin - 2 freq accolades - 1 freq acolytes - 1 freq assaultet - 2 freq agility - 1 freq assaultit - 1 freq aissil-tuith - 1 freq ajolt - 1 freq accolade - 1 freq assaults - 1 freq aggled - 1 freq asleid - 1 freq accolytes - 1 freq |
MetaPhone code - ASLT0 aissil-tuith - 1 freq |
AISSIL-TUITH |
Time to execute Levenshtein function - 0.222174 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.390509 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.028105 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.037401 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.000831 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. |