| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceptid (0) - 1 freq accepted (1) - 25 freq acceptit (1) - 46 freq acceptin (1) - 16 freq accept (2) - 76 freq accepin (2) - 1 freq accepit (2) - 2 freq acceppit (2) - 12 freq accepts (2) - 6 freq accepte (2) - 1 freq accepting (2) - 3 freq acceppin (2) - 3 freq accepps (3) - 1 freq ceptin (3) - 6 freq accentor (3) - 1 freq accents (3) - 29 freq accostit (3) - 4 freq exceptit (3) - 2 freq accent (3) - 116 freq adoptid (3) - 1 freq cheptir (3) - 9 freq sceptic (3) - 2 freq accepp (3) - 3 freq accents' (3) - 2 freq acceps (3) - 1 freq |
acceptid (0) - 1 freq accepted (1) - 25 freq acceptin (2) - 16 freq acceptit (2) - 46 freq accepts (3) - 6 freq accepte (3) - 1 freq accept (3) - 76 freq accepit (3) - 2 freq accepting (4) - 3 freq accosted (4) - 2 freq acceppin (4) - 3 freq accepin (4) - 1 freq acceppit (4) - 12 freq accep (5) - 12 freq cctd (5) - 1 freq acceptsna (5) - 1 freq acceps (5) - 1 freq exceptin (5) - 6 freq accessed (5) - 2 freq accoonted (5) - 1 freq accounted (5) - 3 freq occupeed (5) - 1 freq occupyd (5) - 1 freq adoptid (5) - 1 freq accents (5) - 29 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 - AKSPTT accepted - 25 freq acceptit - 46 freq acceptid - 1 freq |
ACCEPTID |
| Time to execute Levenshtein function - 0.257891 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.426921 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.028045 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.041812 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.000922 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. |