| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| apocryphal (0) - 4 freq apocrypha (1) - 3 freq €˜orphan (5) - 1 freq approchan (5) - 1 freq avochat (5) - 1 freq appruval (5) - 1 freq amoral (5) - 1 freq pochil (5) - 1 freq portal (5) - 3 freq appeal (5) - 37 freq poortugal (5) - 1 freq crystal (5) - 27 freq aforehan (5) - 3 freq apocalypse (5) - 10 freq apostophe (5) - 1 freq apolitical (5) - 2 freq orphan (5) - 14 freq pokey-hat (5) - 1 freq apostrophe' (5) - 2 freq apocalyptic (5) - 6 freq locyal (5) - 3 freq portugal (5) - 11 freq apostrophe (5) - 13 freq approval (5) - 14 freq apostrophes (5) - 17 freq |
apocryphal (0) - 4 freq apocrypha (2) - 3 freq pochil (7) - 1 freq prophet (8) - 13 freq apostrophes (8) - 17 freq porthole (8) - 1 freq approval (8) - 14 freq portugal (8) - 11 freq apostrophe (8) - 13 freq propel (8) - 2 freq peripheral (8) - 7 freq creppul (8) - 1 freq proposal (8) - 10 freq parochial (8) - 11 freq scrapheap (8) - 1 freq mcphail (8) - 5 freq apocalyptic (8) - 6 freq porphory (8) - 1 freq corporal (8) - 22 freq portal (8) - 3 freq appeal (8) - 37 freq poortugal (8) - 1 freq propale (8) - 1 freq appruval (8) - 1 freq €˜orphan (8) - 1 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 - APKRFL apocryphal - 4 freq |
APOCRYPHAL |
| Time to execute Levenshtein function - 0.245264 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.418191 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.028073 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.044271 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.000872 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. |