| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kebab (0) - 6 freq kebabs (1) - 3 freq keb (2) - 2 freq kerav (2) - 1 freq kebab (2) - 1 freq kabb (2) - 1 freq kedar (2) - 1 freq kenan (2) - 3 freq bab (2) - 13 freq feba (2) - 1 freq ebb (2) - 27 freq kerb (2) - 6 freq kyoab (2) - 1 freq rebat (2) - 5 freq ebay (2) - 6 freq rehab (2) - 1 freq webb (2) - 1 freq knoab (2) - 1 freq debs (3) - 1 freq cbb (3) - 4 freq ena (3) - 16 freq seaf (3) - 1 freq kemp (3) - 46 freq seya (3) - 1 freq bas (3) - 9 freq |
kebab (0) - 6 freq kebabs (2) - 3 freq kabb (2) - 1 freq kerb (3) - 6 freq ebb (3) - 27 freq knoab (3) - 1 freq bab (3) - 13 freq webb (3) - 1 freq kyoab (3) - 1 freq keb (3) - 2 freq kubby (3) - 1 freq abbay (4) - 1 freq knob (4) - 12 freq nabob (4) - 1 freq hobb (4) - 1 freq rbib (4) - 1 freq kebbok (4) - 1 freq bib (4) - 8 freq kirb (4) - 1 freq babe (4) - 11 freq bebe (4) - 3 freq boba (4) - 2 freq ktb (4) - 1 freq ibebb (4) - 1 freq kneb (4) - 1 freq |
SoundEx code - K110 kebab - 6 freq keepie-uppie - 2 freq kbip - 1 freq kebab - 1 freq |
MetaPhone code - KBB kebab - 6 freq kebab - 1 freq |
KEBAB |
| Time to execute Levenshtein function - 0.205923 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.346809 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.027351 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.000849 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. |