| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kbd (0) - 1 freq jbd (1) - 1 freq abd (1) - 2 freq kgd (1) - 2 freq bd (1) - 6 freq cbd (1) - 1 freq kbp (1) - 1 freq kad (1) - 1 freq kb (1) - 4 freq sbd (1) - 2 freq kd (1) - 2 freq kid (1) - 104 freq qzd (2) - 1 freq wld (2) - 1 freq abdn (2) - 6 freq 'be (2) - 13 freq dpd (2) - 1 freq kep (2) - 136 freq b (2) - 751 freq kir (2) - 2 freq keg (2) - 2 freq ed (2) - 53 freq ekd (2) - 1 freq mad (2) - 356 freq eid (2) - 4 freq |
kbd (0) - 1 freq kad (2) - 1 freq kb (2) - 4 freq kd (2) - 2 freq kbp (2) - 1 freq sbd (2) - 2 freq kid (2) - 104 freq jbd (2) - 1 freq abd (2) - 2 freq kgd (2) - 2 freq cbd (2) - 1 freq bd (2) - 6 freq kord (3) - 2 freq ktid (3) - 1 freq bad (3) - 949 freq kdy (3) - 1 freq bud (3) - 36 freq eked (3) - 3 freq obda (3) - 1 freq bed (3) - 930 freq keb (3) - 2 freq 'bad (3) - 6 freq kerd (3) - 1 freq aked (3) - 1 freq akd (3) - 1 freq |
SoundEx code - K130 kept - 510 freq keppit - 17 freq keepit - 151 freq kaipt - 1 freq keipit - 4 freq keypt - 1 freq kepta - 1 freq keppet - 1 freq keepet - 1 freq keeped - 1 freq kepit - 3 freq keepid - 3 freq kaput - 1 freq keipet - 1 freq €¦kept - 1 freq kopite - 2 freq kpt - 1 freq kbd - 1 freq |
MetaPhone code - KBT gobbit - 1 freq gubbed - 10 freq gobbed - 3 freq gabbit - 3 freq qbt - 1 freq cbd - 1 freq gbuta - 1 freq kbd - 1 freq |
KBD |
| Time to execute Levenshtein function - 0.259408 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.429813 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.031281 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.046848 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.001131 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. |