| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kidnapped (0) - 5 freq 'kidnapped' (2) - 1 freq kidnappin (2) - 1 freq kidnap (3) - 4 freq drapped (3) - 109 freq snapped (3) - 40 freq knapper (3) - 2 freq clapped (4) - 28 freq snipped (4) - 6 freq kirned (4) - 3 freq drappet (4) - 5 freq drappd (4) - 2 freq kinred (4) - 2 freq widnad (4) - 1 freq cidnae (4) - 2 freq stoapped (4) - 18 freq snappet (4) - 5 freq inated (4) - 1 freq kindled (4) - 1 freq crapped (4) - 1 freq lapped (4) - 4 freq unwrapped (4) - 3 freq kinnae (4) - 10 freq 'kidnap' (4) - 1 freq droapped (4) - 5 freq |
kidnapped (0) - 5 freq kidnappin (3) - 1 freq 'kidnapped' (4) - 1 freq snapped (5) - 40 freq knapper (5) - 2 freq drapped (5) - 109 freq kidnap (5) - 4 freq knappy (6) - 1 freq dipped (6) - 23 freq droapped (6) - 5 freq nipped (6) - 22 freq knappis (6) - 1 freq knapp (6) - 2 freq kniped (6) - 1 freq knappin (6) - 4 freq drappd (6) - 2 freq knappit (6) - 3 freq dropped (6) - 35 freq snipped (6) - 6 freq dapper (7) - 4 freq trapped (7) - 24 freq strapped (7) - 12 freq snaped (7) - 1 freq anclapped (7) - 1 freq sipped (7) - 6 freq |
SoundEx code - K351 kidnap - 4 freq kidnapped - 5 freq 'kidnapped' - 1 freq 'kidnappit' - 1 freq kidnappin - 1 freq kywetmb - 1 freq 'kidnap' - 1 freq katehumble - 1 freq |
MetaPhone code - KTNPT kidnapped - 5 freq 'kidnapped' - 1 freq 'kidnappit' - 1 freq |
KIDNAPPED |
| Time to execute Levenshtein function - 0.182049 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.353057 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.028516 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.040379 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.000872 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. |