| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assaultet (0) - 2 freq assaultit (1) - 1 freq assaulted (1) - 3 freq assautit (2) - 1 freq assaultin (2) - 2 freq assaults (2) - 1 freq assault (2) - 14 freq saltet (3) - 1 freq assailed (3) - 2 freq assailant (3) - 1 freq assumet (3) - 1 freq assauts (3) - 1 freq assuret (3) - 4 freq assisted (4) - 1 freq assured (4) - 30 freq assail (4) - 7 freq sauled (4) - 4 freq erkaltet (4) - 1 freq assails (4) - 2 freq startet (4) - 150 freq assume (4) - 25 freq assortit (4) - 3 freq resultit (4) - 5 freq scarlet (4) - 22 freq stairtet (4) - 92 freq |
assaultet (0) - 2 freq assaultit (1) - 1 freq assaulted (2) - 3 freq assaults (3) - 1 freq assault (3) - 14 freq assaultin (3) - 2 freq assautit (3) - 1 freq assailant (4) - 1 freq saltet (4) - 1 freq resultit (5) - 5 freq assertit (5) - 2 freq assistit (5) - 1 freq resultat (5) - 1 freq assortit (5) - 3 freq assailed (5) - 2 freq assauts (5) - 1 freq assuret (5) - 4 freq assumet (5) - 1 freq skauldit (6) - 1 freq staurtit (6) - 1 freq vaultit (6) - 2 freq sselliat (6) - 1 freq suitet (6) - 3 freq shoutet (6) - 54 freq asserted (6) - 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 - ASLTT assaulted - 3 freq assaultet - 2 freq assaultit - 1 freq |
ASSAULTET |
| Time to execute Levenshtein function - 0.186890 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.345663 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.027837 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.037282 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.000899 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. |