| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ebola (0) - 1 freq ella (2) - 26 freq bla (2) - 13 freq boca (2) - 3 freq bolas (2) - 4 freq pola (2) - 6 freq bela (2) - 1 freq boll (2) - 1 freq eold (2) - 1 freq ola (2) - 1 freq ebble (2) - 1 freq boba (2) - 2 freq bolt (2) - 43 freq embla (2) - 2 freq viola (2) - 4 freq zola (2) - 1 freq bole (2) - 4 freq ebony (2) - 1 freq bold (2) - 78 freq hoola (2) - 2 freq eela (2) - 3 freq cola (2) - 10 freq engla (2) - 1 freq 'bold (2) - 1 freq bol (2) - 2 freq |
ebola (0) - 1 freq bole (2) - 4 freq bol (2) - 2 freq bela (2) - 1 freq bla (2) - 13 freq bale (3) - 8 freq bali (3) - 1 freq bul (3) - 3 freq bl (3) - 2 freq ible (3) - 1 freq bool (3) - 17 freq blaa (3) - 24 freq boily (3) - 1 freq boule (3) - 3 freq bil (3) - 1 freq boil (3) - 19 freq bal (3) - 6 freq ably (3) - 1 freq boul (3) - 15 freq blo (3) - 2 freq byle (3) - 16 freq bols (3) - 1 freq ablo (3) - 135 freq boyle (3) - 17 freq able (3) - 436 freq |
SoundEx code - E140 evil - 90 freq epple - 13 freq effel - 1 freq ebola - 1 freq eeevilly - 1 freq eiffel - 2 freq eivill - 1 freq evil' - 1 freq evill - 1 freq €˜evil - 2 freq ebble - 1 freq epl - 9 freq efl - 2 freq epely - 1 freq |
MetaPhone code - EBL ebola - 1 freq ebble - 1 freq |
EBOLA |
| Time to execute Levenshtein function - 0.198348 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.505409 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.038943 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.079624 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.001170 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. |