| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assaultit (0) - 1 freq assaultet (1) - 2 freq assautit (1) - 1 freq assaultin (1) - 2 freq assaulted (2) - 3 freq assault (2) - 14 freq assaults (2) - 1 freq vaultit (3) - 2 freq saulit (3) - 1 freq sautit (3) - 2 freq resultit (3) - 5 freq haultit (3) - 1 freq assistit (3) - 1 freq assertit (3) - 2 freq assortit (3) - 3 freq assauts (3) - 1 freq staurtit (3) - 1 freq skauldit (3) - 1 freq assailant (3) - 1 freq sauntit (3) - 9 freq statit (4) - 14 freq spartit (4) - 2 freq saetit (4) - 1 freq creautit (4) - 2 freq onfauldit (4) - 1 freq |
assaultit (0) - 1 freq assaultet (1) - 2 freq assaultin (2) - 2 freq assautit (2) - 1 freq assaults (3) - 1 freq assault (3) - 14 freq assaulted (3) - 3 freq assertit (4) - 2 freq assortit (4) - 3 freq assistit (4) - 1 freq assailant (4) - 1 freq resultit (4) - 5 freq saltet (5) - 1 freq simulatit (5) - 2 freq shieltit (5) - 1 freq salutit (5) - 1 freq resultat (5) - 1 freq associatit (5) - 15 freq slatit (5) - 1 freq escalatit (5) - 1 freq stiltit (5) - 1 freq assimilatit (5) - 1 freq sauntit (5) - 9 freq sautit (5) - 2 freq haultit (5) - 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 |
ASSAULTIT |
| Time to execute Levenshtein function - 0.181960 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.347671 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.028099 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.037110 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.000869 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. |