| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceptsna (0) - 1 freq accepts (2) - 6 freq acceptin (2) - 16 freq accepting (2) - 3 freq accents' (3) - 2 freq accepte (3) - 1 freq accepin (3) - 1 freq accepted (3) - 25 freq acceps (3) - 1 freq acceppin (3) - 3 freq accepps (3) - 1 freq acceptid (3) - 1 freq accept (3) - 76 freq acceptance (3) - 31 freq accents (3) - 29 freq ceptna (3) - 2 freq acceptit (3) - 46 freq accentor (4) - 1 freq albertina (4) - 1 freq accessed (4) - 2 freq ceptin (4) - 6 freq accepit (4) - 2 freq accepp (4) - 3 freq argentina (4) - 5 freq exceptin (4) - 6 freq |
acceptsna (0) - 1 freq acceptin (3) - 16 freq accepts (3) - 6 freq accepting (4) - 3 freq accept (5) - 76 freq acceptance (5) - 31 freq acceptid (5) - 1 freq acceptit (5) - 46 freq accepps (5) - 1 freq ceptna (5) - 2 freq accents (5) - 29 freq accents' (5) - 2 freq acceppin (5) - 3 freq accepin (5) - 1 freq accepte (5) - 1 freq acceps (5) - 1 freq accepted (5) - 25 freq accepit (6) - 2 freq acceptable (6) - 25 freq ceptin (6) - 6 freq accompts (6) - 1 freq accessin (6) - 5 freq exceptin (6) - 6 freq occupyin (7) - 2 freq accountan (7) - 1 freq |
SoundEx code - A213 accept - 76 freq acceptance - 31 freq accepts - 6 freq acceptin - 16 freq accepted - 25 freq acceptable - 25 freq accepit - 2 freq acceptit - 46 freq acceptabilty - 1 freq accepting - 3 freq achieved - 14 freq aspidistra - 1 freq asphodel - 1 freq accepte - 1 freq acceppit - 12 freq acceptilautioun - 1 freq aquavit - 1 freq acceptability - 1 freq acceptid - 1 freq acceptsna - 1 freq ajfter - 1 freq assipattle - 5 freq assipattle's - 1 freq aspd - 1 freq agiftaday - 4 freq aqua-fit - 1 freq aqbudsuu - 1 freq |
MetaPhone code - AKSPTSN acceptsna - 1 freq |
ACCEPTSNA |
| Time to execute Levenshtein function - 0.299641 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.702592 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.057611 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.037172 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.000915 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. |