| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kerb (0) - 6 freq kerby (1) - 2 freq yerb (1) - 1 freq herb (1) - 2 freq keb (1) - 2 freq kert (1) - 8 freq ker (1) - 24 freq kerl (1) - 1 freq kerd (1) - 1 freq kers (1) - 6 freq verb (1) - 129 freq kerbs (1) - 3 freq kirb (1) - 1 freq kerr (1) - 31 freq kern (1) - 3 freq kerds (2) - 1 freq rb (2) - 8 freq kens (2) - 531 freq ere (2) - 287 freq kirk (2) - 528 freq dern (2) - 21 freq zero (2) - 9 freq kedy (2) - 1 freq jer (2) - 1 freq erm (2) - 66 freq |
kerb (0) - 6 freq kirb (1) - 1 freq kerby (1) - 2 freq kerbs (2) - 3 freq yerb (2) - 1 freq kern (2) - 3 freq kirby (2) - 3 freq korba (2) - 1 freq verb (2) - 129 freq kerr (2) - 31 freq kers (2) - 6 freq herb (2) - 2 freq kert (2) - 8 freq keb (2) - 2 freq kerd (2) - 1 freq ker (2) - 24 freq kerl (2) - 1 freq ahrb (3) - 1 freq kre (3) - 1 freq knob (3) - 12 freq kgb (3) - 3 freq kebab (3) - 6 freq kb (3) - 4 freq garb (3) - 4 freq karm (3) - 2 freq |
SoundEx code - K610 kerb - 6 freq kirov' - 1 freq kreepee - 1 freq karep - 1 freq kirby - 3 freq krapp - 1 freq kerve - 5 freq krap - 1 freq kirb - 1 freq korba - 1 freq kerby - 2 freq kqrfb - 1 freq kqrv - 1 freq kerav - 1 freq |
MetaPhone code - KRB grab - 110 freq crab - 32 freq corbie - 27 freq kerb - 6 freq crib - 7 freq grub - 39 freq craib - 5 freq crub - 3 freq grubby - 2 freq greba - 8 freq crabbie - 2 freq kirby - 3 freq cribbie - 1 freq grabbie - 3 freq garb - 4 freq curb - 1 freq kirb - 1 freq korba - 1 freq kerby - 2 freq grab - 1 freq greeba - 1 freq 'greba' - 1 freq garyb - 2 freq crbi - 1 freq grabby - 1 freq gorb - 1 freq |
KERB |
| Time to execute Levenshtein function - 0.212049 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.391183 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.035300 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.054107 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.001042 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. |