| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| accep (0) - 12 freq acce (1) - 1 freq accepp (1) - 3 freq acceps (1) - 1 freq accept (1) - 74 freq accepit (2) - 2 freq accies (2) - 2 freq accepts (2) - 5 freq ance (2) - 69 freq accent (2) - 108 freq acted (2) - 8 freq cce (2) - 1 freq acre (2) - 17 freq crep (2) - 4 freq aches (2) - 10 freq actes (2) - 1 freq cep (2) - 1 freq acer (2) - 1 freq schep (2) - 2 freq ache (2) - 14 freq bicep (2) - 2 freq ccea (2) - 1 freq accede (2) - 1 freq aces (2) - 5 freq acne (2) - 1 freq |
accep (0) - 12 freq acce (2) - 1 freq accept (2) - 74 freq acceps (2) - 1 freq ccp (2) - 3 freq accepp (2) - 3 freq clep (3) - 1 freq ccea (3) - 1 freq ecce (3) - 1 freq accede (3) - 1 freq accepte (3) - 1 freq occupy (3) - 6 freq icecap (3) - 1 freq bicep (3) - 2 freq excep (3) - 14 freq accepin (3) - 1 freq accur (3) - 1 freq accies (3) - 2 freq accepit (3) - 2 freq crep (3) - 4 freq cce (3) - 1 freq cep (3) - 1 freq hiccup (4) - 1 freq taycup (4) - 4 freq ccyh (4) - 1 freq |
SoundEx code - A210 agape - 2 freq aesop - 8 freq achieve - 34 freq aseef - 1 freq accep - 12 freq asbo - 1 freq agivey - 2 freq asap - 10 freq accepp - 3 freq ashby - 1 freq ausbau - 1 freq acuv - 1 freq aygxb - 1 freq agv - 1 freq agjjp - 1 freq aqp - 1 freq askjeff - 1 freq agp - 1 freq azv - 1 freq ayqv - 1 freq auxzv - 1 freq |
MetaPhone code - AKSP accep - 12 freq accepp - 3 freq |
ACCEP |
| Time to execute Levenshtein function - 0.183911 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.341489 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.030850 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.037511 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.000831 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. |