| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ebbs (0) - 5 freq ebbe (1) - 5 freq ebb (1) - 27 freq hbbs (1) - 1 freq ebr (2) - 1 freq bbt (2) - 1 freq cbus (2) - 1 freq serbs (2) - 2 freq ears (2) - 112 freq gbbo (2) - 1 freq dbis (2) - 1 freq bba (2) - 1 freq nbs (2) - 1 freq bobs (2) - 9 freq cubs (2) - 7 freq ens (2) - 16 freq eiss (2) - 31 freq emus (2) - 1 freq erns (2) - 1 freq ess (2) - 258 freq bbc (2) - 174 freq eens (2) - 131 freq obvs (2) - 4 freq cobs (2) - 1 freq enes (2) - 2 freq |
ebbs (0) - 5 freq bobs (2) - 9 freq babs (2) - 2 freq hbbs (2) - 1 freq ebbe (2) - 5 freq ebb (2) - 27 freq yabbs (2) - 1 freq vbs (3) - 1 freq neebs (3) - 13 freq gabs (3) - 3 freq webs (3) - 2 freq ebbin (3) - 3 freq wabs (3) - 10 freq obs (3) - 1 freq biebs (3) - 1 freq boobs (3) - 7 freq bs (3) - 6 freq ebbit (3) - 1 freq jabs (3) - 2 freq abbeys (3) - 3 freq lobs (3) - 2 freq obes (3) - 1 freq elbas (3) - 9 freq mbes (3) - 1 freq gubs (3) - 1 freq |
SoundEx code - E120 eves - 1 freq effeck - 36 freq epic - 20 freq evoke - 3 freq eevees - 1 freq effecks - 21 freq ebc - 1 freq ee-baws - 1 freq effie's - 1 freq ebbs - 5 freq effek - 4 freq eyebas - 1 freq effeks - 1 freq eaves - 2 freq evacuee - 1 freq ep's - 2 freq efuc - 1 freq evfejh - 1 freq ebbes - 1 freq evoc - 1 freq eifgw - 1 freq efj - 1 freq evz - 1 freq ebka - 1 freq eeweeehvoq - 1 freq ebswe - 1 freq epusgw - 1 freq eiwahhwyfx - 1 freq efc - 1 freq effies - 1 freq ebg - 1 freq evoygu - 1 freq |
MetaPhone code - EBS ee-baws - 1 freq ebbs - 5 freq ebbes - 1 freq |
EBBS |
| Time to execute Levenshtein function - 0.253267 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.379190 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.027834 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.036723 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.000910 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. |