| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| apocrypha (0) - 3 freq apocryphal (1) - 4 freq apocalypse (4) - 10 freq apostophe (4) - 1 freq apostrophe (4) - 13 freq topography (5) - 2 freq oocha (5) - 3 freq ponyta (5) - 1 freq alpha (5) - 5 freq autograph (5) - 1 freq autographs (5) - 2 freq ooocha (5) - 2 freq pocky (5) - 2 freq crypt (5) - 2 freq amorra (5) - 2 freq apocalyptic (5) - 6 freq aoirmh (5) - 1 freq morph (5) - 1 freq geograph (5) - 2 freq knockha (5) - 1 freq atrophy (5) - 1 freq apapa (5) - 1 freq €˜orphan (5) - 1 freq apache (5) - 2 freq biography (5) - 7 freq |
apocrypha (0) - 3 freq apocryphal (2) - 4 freq apostrophe (6) - 13 freq apostophe (6) - 1 freq apocalypse (6) - 10 freq biography (7) - 7 freq apache (7) - 2 freq geograph (7) - 2 freq approch (7) - 1 freq atrophy (7) - 1 freq porch (7) - 22 freq aproch (7) - 6 freq acoorsh (7) - 1 freq morph (7) - 1 freq poarch (7) - 1 freq pochi (7) - 1 freq geography (7) - 37 freq crypt (7) - 2 freq autograph (7) - 1 freq topography (7) - 2 freq scrip (8) - 3 freq pech (8) - 35 freq paerish (8) - 1 freq crips (8) - 1 freq scraps (8) - 22 freq |
SoundEx code - A126 absurdness - 1 freq absurd - 9 freq absorbed - 4 freq absorbing - 1 freq abusers - 1 freq absorbit - 4 freq apsire - 1 freq apocryphal - 4 freq apocrypha - 3 freq apgrade - 3 freq absorbin - 4 freq absurdities - 1 freq affshore - 2 freq absurdly - 1 freq absorb - 2 freq abjuration - 1 freq afcherewego - 14 freq afcred - 3 freq afcheritage - 1 freq abxr - 1 freq |
MetaPhone code - APKRF apocrypha - 3 freq |
APOCRYPHA |
| Time to execute Levenshtein function - 0.194464 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.366441 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.027440 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.041268 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.000936 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. |