| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kenable (0) - 19 freq enable (1) - 4 freq tenable (1) - 1 freq kenably (1) - 6 freq kennable (1) - 3 freq kennle (2) - 2 freq rewable (2) - 1 freq enables (2) - 1 freq 'unable (2) - 1 freq seeable (2) - 1 freq enabled (2) - 1 freq unable (2) - 19 freq feable (2) - 1 freq deeable (2) - 1 freq kenan (3) - 3 freq kele (3) - 1 freq kettle (3) - 82 freq winnable (3) - 1 freq keyhole (3) - 5 freq feeble (3) - 9 freq nables (3) - 1 freq enviable (3) - 1 freq menace (3) - 5 freq regale (3) - 2 freq ebble (3) - 1 freq |
kenable (0) - 19 freq kenably (1) - 6 freq kennable (2) - 3 freq tenable (2) - 1 freq enable (2) - 4 freq unable (3) - 19 freq 'unable (3) - 1 freq kennle (3) - 2 freq kibble (4) - 1 freq noble (4) - 30 freq inablo (4) - 5 freq kinnle (4) - 3 freq kenobi (4) - 1 freq knabbie (4) - 4 freq kennel (4) - 11 freq knobble (4) - 4 freq kunal (4) - 11 freq kindle (4) - 4 freq 'noble (4) - 1 freq deeable (4) - 1 freq enabled (4) - 1 freq enables (4) - 1 freq seeable (4) - 1 freq rewable (4) - 1 freq feable (4) - 1 freq |
SoundEx code - K514 knobbly - 4 freq kinfolk - 1 freq kennable - 3 freq kneevlick - 1 freq knablich - 1 freq kenable - 19 freq knobble - 4 freq kenably - 6 freq kimblecheat - 1 freq komplettwayne - 1 freq |
MetaPhone code - KNBL cannibal - 2 freq kennable - 3 freq kenable - 19 freq kenably - 6 freq |
KENABLE |
| Time to execute Levenshtein function - 0.195391 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.386972 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.027588 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.039135 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.001126 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. |