| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keyburd (0) - 1 freq keybuird (1) - 4 freq keyboard (2) - 17 freq keyboord (2) - 1 freq keybrod (2) - 1 freq key-wurd (2) - 1 freq weyward (3) - 1 freq khyber (3) - 1 freq neebur (3) - 11 freq keyed (3) - 4 freq reynard (3) - 3 freq kyrard (3) - 1 freq kebbers (3) - 1 freq keyboard' (3) - 1 freq keppard (3) - 1 freq key'd (3) - 1 freq hepburn (3) - 6 freq kebbuck (3) - 5 freq seaburds (3) - 1 freq nayburs (3) - 1 freq cerbuird (3) - 1 freq onybud (3) - 1 freq seabird (3) - 8 freq rayburn (3) - 1 freq keyboords (3) - 1 freq |
keyburd (0) - 1 freq keybuird (1) - 4 freq keyboord (2) - 1 freq keybrod (2) - 1 freq keyboard (2) - 17 freq keyboords (4) - 1 freq seabird (4) - 8 freq kerd (4) - 1 freq keyboard' (4) - 1 freq burd (4) - 91 freq kyard (4) - 3 freq keyboards (4) - 3 freq kyrard (4) - 1 freq key-wurd (4) - 1 freq kbd (5) - 1 freq seaboard (5) - 2 freq kord (5) - 2 freq byrd (5) - 1 freq hybrid (5) - 4 freq kebbers (5) - 1 freq bird (5) - 192 freq burde (5) - 1 freq 'abuird (5) - 1 freq kerried (5) - 23 freq kaleyard (5) - 1 freq |
SoundEx code - K163 kivert - 4 freq kivvered - 2 freq keybrod - 1 freq keyboards - 3 freq kivered - 1 freq kivvert - 5 freq kie-buirds - 1 freq keyboord - 1 freq keyboard - 17 freq keyburd - 1 freq keybuird - 4 freq keppard - 1 freq keyboords - 1 freq keyboardist - 1 freq keyboard' - 1 freq |
MetaPhone code - KBRT keybrod - 1 freq cubberd - 1 freq cabaret - 2 freq cubbart - 1 freq keyboord - 1 freq keyboard - 17 freq keyburd - 1 freq keybuird - 4 freq cuboard - 2 freq keyboard' - 1 freq |
KEYBURD |
| Time to execute Levenshtein function - 0.270741 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.441950 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.029087 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.039458 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.000859 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. |