| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceppit (0) - 12 freq acceppin (1) - 3 freq acceptit (1) - 46 freq accepit (1) - 2 freq acceptid (2) - 1 freq acceptin (2) - 16 freq accepp (2) - 3 freq accepin (2) - 1 freq accepps (2) - 1 freq accept (2) - 76 freq exceppin (3) - 2 freq accursit (3) - 1 freq accordit (3) - 4 freq adoppit (3) - 1 freq cheepit (3) - 3 freq accostit (3) - 4 freq clespit (3) - 3 freq ascendit (3) - 3 freq creipit (3) - 2 freq clappit (3) - 46 freq accep (3) - 12 freq acceps (3) - 1 freq cuppit (3) - 3 freq cappit (3) - 3 freq fleppit (3) - 1 freq |
acceppit (0) - 12 freq accepit (2) - 2 freq acceptit (2) - 46 freq acceppin (2) - 3 freq accepps (3) - 1 freq accepp (3) - 3 freq accept (3) - 76 freq accompt (4) - 2 freq accepte (4) - 1 freq croppit (4) - 1 freq cappit (4) - 3 freq cuppit (4) - 3 freq chappit (4) - 45 freq cloppit (4) - 1 freq chippit (4) - 7 freq clappit (4) - 46 freq crappit (4) - 4 freq coppit (4) - 3 freq clippit (4) - 5 freq cruppit (4) - 1 freq acceptin (4) - 16 freq accepin (4) - 1 freq acceptid (4) - 1 freq occupant (5) - 2 freq clappet (5) - 1 freq |
SoundEx code - A213 accept - 76 freq acceptance - 31 freq accepts - 6 freq acceptin - 16 freq accepted - 25 freq acceptable - 24 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 - AKSPT accept - 76 freq accepit - 2 freq accepte - 1 freq acceppit - 12 freq |
ACCEPPIT |
| Time to execute Levenshtein function - 0.181085 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.340223 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.027775 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.038021 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.000955 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. |