| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assault (0) - 14 freq assaults (1) - 1 freq assaultet (2) - 2 freq assails (2) - 2 freq assauts (2) - 1 freq assaulted (2) - 3 freq assurt (2) - 1 freq assaultit (2) - 1 freq assaultin (2) - 2 freq assumt (2) - 1 freq assautit (2) - 1 freq assail (2) - 7 freq basalt (3) - 2 freq swallt (3) - 15 freq asail (3) - 1 freq avaunt (3) - 1 freq scaurt (3) - 2 freq sauft (3) - 1 freq saul (3) - 60 freq assuret (3) - 4 freq shaul (3) - 1 freq skult (3) - 2 freq cassat (3) - 1 freq swaalt (3) - 1 freq sauld (3) - 1 freq |
assault (0) - 14 freq assaults (2) - 1 freq assaultin (3) - 2 freq assumt (3) - 1 freq assail (3) - 7 freq assaultit (3) - 1 freq assautit (3) - 1 freq assurt (3) - 1 freq assails (3) - 2 freq assaultet (3) - 2 freq assaulted (3) - 3 freq saulit (4) - 1 freq shalt (4) - 6 freq assist (4) - 8 freq asset (4) - 8 freq scoult (4) - 3 freq assailed (4) - 2 freq assint (4) - 1 freq asseert (4) - 1 freq saylt (4) - 1 freq assert (4) - 7 freq result (4) - 116 freq saalt (4) - 5 freq salt (4) - 49 freq iseult (4) - 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 - ASLT aizelt - 1 freq assault - 14 freq assailed - 2 freq asleid - 1 freq |
ASSAULT |
| Time to execute Levenshtein function - 0.194397 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.358723 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.029408 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.037708 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.000856 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. |