| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assautit (0) - 1 freq assaultit (1) - 1 freq assertit (2) - 2 freq assistit (2) - 1 freq assault (2) - 14 freq sautit (2) - 2 freq assortit (2) - 3 freq assaultet (2) - 2 freq assauts (2) - 1 freq assaultin (2) - 2 freq santit (3) - 2 freq scoutit (3) - 1 freq soartit (3) - 1 freq sautin (3) - 1 freq startit (3) - 157 freq scaudit (3) - 5 freq assurt (3) - 1 freq assumt (3) - 1 freq adaptit (3) - 6 freq assumin (3) - 10 freq saantit (3) - 1 freq disputit (3) - 1 freq sattit (3) - 1 freq swattit (3) - 2 freq scartit (3) - 23 freq |
assautit (0) - 1 freq assaultit (2) - 1 freq assortit (3) - 3 freq sautit (3) - 2 freq assauts (3) - 1 freq assaultet (3) - 2 freq assault (3) - 14 freq assistit (3) - 1 freq assertit (3) - 2 freq saitit (4) - 2 freq saatit (4) - 1 freq seatit (4) - 7 freq assuret (4) - 4 freq slatit (4) - 1 freq salutit (4) - 1 freq statit (4) - 14 freq sattit (4) - 1 freq staitit (4) - 1 freq saetit (4) - 1 freq shoutit (4) - 123 freq sauntit (4) - 9 freq satit (4) - 1 freq assumet (4) - 1 freq soartit (4) - 1 freq assurt (4) - 1 freq |
SoundEx code - A233 actit - 9 freq agitated - 6 freq assiduity - 1 freq astute - 1 freq agitatin' - 1 freq acted - 9 freq aesthetic - 4 freq agitators - 1 freq agitation - 5 freq agitatin - 2 freq astutehess - 1 freq 'astute - 1 freq ae-sided - 2 freq agitatit - 2 freq assautit - 1 freq ae-siditness - 1 freq agitaitit - 1 freq azitoadcff - 1 freq |
MetaPhone code - ASTT assiduity - 1 freq astute - 1 freq 'astute - 1 freq assautit - 1 freq |
ASSAUTIT |
| Time to execute Levenshtein function - 0.248447 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.410979 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.030310 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.039622 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.000895 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. |