| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alphabets (0) - 1 freq alphabet (1) - 15 freq alphabetti (2) - 1 freq alphaeus (2) - 1 freq alphabee (2) - 9 freq alphabetic (2) - 2 freq alphaeus' (3) - 1 freq alphabetties (3) - 1 freq phasers (4) - 1 freq fochabers (4) - 11 freq ashets (4) - 14 freq planets (4) - 41 freq poakets (4) - 1 freq elizabeth (4) - 16 freq labels (4) - 6 freq elephants (4) - 12 freq halfgaets (4) - 1 freq alphabetical (4) - 2 freq laavets (4) - 1 freq habits (4) - 23 freq emphases (4) - 1 freq pamphlets (4) - 6 freq alpha (4) - 5 freq alkhaled (4) - 1 freq alphaeus's (4) - 1 freq |
alphabets (0) - 1 freq alphabet (2) - 15 freq alphabetti (3) - 1 freq alphabetic (3) - 2 freq alphabetties (4) - 1 freq alphabee (4) - 9 freq alphaeus (4) - 1 freq elephants (5) - 12 freq alphaeus's (6) - 1 freq alphaeus' (6) - 1 freq alphabetical (6) - 2 freq habits (6) - 23 freq phases (7) - 3 freq phaes (7) - 1 freq photes (7) - 1 freq chalets (7) - 1 freq ralphies (7) - 1 freq elisabeth (7) - 1 freq elephant's (7) - 1 freq alichts (7) - 1 freq oliphant (7) - 4 freq habitus (7) - 1 freq layaboots (7) - 1 freq 'habeas (7) - 1 freq haets (7) - 2 freq |
SoundEx code - A411 alphabet - 15 freq alphabetic - 2 freq alphabetti - 1 freq alphabee - 9 freq alphabets - 1 freq alphabetical - 2 freq albaparty - 9 freq alphabetties - 1 freq alfieboe - 1 freq albapartytime - 2 freq alfiehfc - 1 freq |
MetaPhone code - ALFBTS alphabets - 1 freq alphabetties - 1 freq |
ALPHABETS |
| Time to execute Levenshtein function - 0.217428 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.424372 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.029548 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.038365 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.000893 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. |