| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kipeet-nosed (0) - 1 freq toffee-nosed (5) - 1 freq hypertensed (5) - 1 freq poke-nosed (5) - 1 freq pink-nosed (5) - 1 freq broon-nosed (6) - 1 freq weel-looed (6) - 1 freq pensed (6) - 3 freq mither-naked (6) - 1 freq penthoose (6) - 2 freq green-niled (6) - 1 freq peat-choked (6) - 1 freq pre-norse (6) - 1 freq kert-horse (6) - 1 freq insensed (6) - 4 freq weel-lo'ed (6) - 1 freq peenged (6) - 2 freq hippened (6) - 1 freq best-loved (6) - 2 freq incensed (6) - 3 freq dispensed (6) - 1 freq open-moued (6) - 1 freq spleet-new (6) - 5 freq weel-loved (6) - 1 freq peel-touer (6) - 1 freq |
kipeet-nosed (0) - 1 freq poke-nosed (7) - 1 freq toffee-nosed (8) - 1 freq hypertensed (8) - 1 freq pink-nosed (8) - 1 freq broom-nosed (9) - 1 freq patronised (9) - 1 freq keep-hoose (9) - 3 freq broon-nosed (9) - 1 freq pensed (9) - 3 freq tip-toed (10) - 1 freq lippened (10) - 11 freq licensed (10) - 4 freq weel-used (10) - 1 freq poseetioned (10) - 1 freq pretended (10) - 11 freq sweetened (10) - 1 freq aipened (10) - 4 freq diagnosed (10) - 2 freq speened (10) - 1 freq tensed (10) - 2 freq rat-arsed (10) - 1 freq kittenish (10) - 1 freq petitioned (10) - 1 freq kittens (10) - 7 freq |
SoundEx code - K135 kaftan - 1 freq kipeet-nosed - 1 freq keepitna - 1 freq kipfatnh - 1 freq kbdnsehr - 1 freq |
MetaPhone code - KPTNST kipeet-nosed - 1 freq |
KIPEET-NOSED |
| Time to execute Levenshtein function - 0.214178 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.375831 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.027715 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.037625 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.000931 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. |