| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ebb (0) - 26 freq ebg (1) - 1 freq evb (1) - 1 freq ebbe (1) - 5 freq eb (1) - 6 freq webb (1) - 1 freq ebc (1) - 1 freq bb (1) - 9 freq cbb (1) - 4 freq ebbs (1) - 5 freq ecb (1) - 1 freq ebr (1) - 1 freq ebv (1) - 1 freq ezb (1) - 1 freq mebbe (2) - 690 freq obg (2) - 1 freq ytb (2) - 1 freq eil (2) - 10 freq rbj (2) - 1 freq rubb (2) - 1 freq ead (2) - 1 freq wb (2) - 4 freq eet (2) - 581 freq eat (2) - 460 freq ktb (2) - 1 freq |
ebb (0) - 26 freq bb (1) - 9 freq ebbe (1) - 5 freq bab (2) - 13 freq bebe (2) - 3 freq bba (2) - 1 freq bob (2) - 213 freq abby (2) - 16 freq bib (2) - 8 freq beb (2) - 1 freq ezb (2) - 1 freq bebo (2) - 1 freq beeb (2) - 1 freq evb (2) - 1 freq ebg (2) - 1 freq cbb (2) - 4 freq ebv (2) - 1 freq ebc (2) - 1 freq ebr (2) - 1 freq webb (2) - 1 freq ecb (2) - 1 freq eb (2) - 6 freq ebbs (2) - 5 freq feba (3) - 1 freq jb (3) - 2 freq |
SoundEx code - E100 eb - 6 freq ee've - 16 freq ev - 3 freq e've - 1 freq eve - 80 freq efi - 1 freq eva - 7 freq ebb - 26 freq ef - 14 freq eff - 13 freq eif - 46 freq eiff - 1 freq eye-up - 1 freq eyebaw - 4 freq 'ee've - 1 freq eh've - 66 freq eppy - 1 freq ebay - 6 freq effi - 1 freq evie - 8 freq effie - 11 freq eep - 1 freq eye-view - 1 freq eeva - 1 freq eup - 2 freq epi - 1 freq ey've - 1 freq eyup - 1 freq evi - 1 freq evi - 1 freq ep - 10 freq ebv - 1 freq efia - 1 freq eiav - 1 freq eev - 5 freq efh - 1 freq ebbe - 5 freq eyfi - 1 freq eapbee - 1 freq epbbow - 1 freq efouy - 1 freq efp - 1 freq evy - 1 freq ebb - 1 freq ee'v - 1 freq eeav - 3 freq evb - 1 freq eeve - 8 freq efo - 1 freq |
MetaPhone code - EB eb - 6 freq ebb - 26 freq ebay - 6 freq ebbe - 5 freq ebb - 1 freq |
EBB |
| Time to execute Levenshtein function - 0.183007 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.323049 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.027314 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.037247 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.000885 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. |