| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kettil-creill (0) - 1 freq nettrill (6) - 1 freq kettilonia (6) - 4 freq keilhill (6) - 1 freq kettlin (7) - 3 freq kell-heids (7) - 3 freq tail-tree (7) - 1 freq nethermill (7) - 1 freq kell-heid (7) - 1 freq petermurrell (7) - 4 freq wattermill (7) - 1 freq hert-ill (7) - 1 freq kestrel (7) - 2 freq settifiein (7) - 1 freq entirely (7) - 31 freq botticelli (7) - 1 freq kettle's (7) - 1 freq kettleens (7) - 3 freq gilmorehill (7) - 1 freq juliemcneill (7) - 1 freq kettlie (7) - 3 freq tattie-heids (7) - 1 freq kettles (7) - 2 freq kettle (7) - 85 freq wattir-pruif (7) - 1 freq |
kettil-creill (0) - 1 freq nettrill (10) - 1 freq reel-rall (11) - 2 freq till-till (11) - 1 freq botticelli (11) - 1 freq kettle-bellied (11) - 3 freq kil-crack (11) - 1 freq watter-well (11) - 1 freq kettilonia (11) - 4 freq keilhill (11) - 1 freq pell-mell (12) - 2 freq watter-craw (12) - 4 freq jyle-cell (12) - 1 freq kettlebilers (12) - 3 freq tattie-bogils (12) - 1 freq creill (12) - 1 freq kitten-heeled (12) - 1 freq kettlin (12) - 3 freq titli-wirli (12) - 1 freq mattcoull (12) - 5 freq little-read (12) - 1 freq kettlebellied (12) - 2 freq kettle-bilers (12) - 3 freq watter-wall (12) - 1 freq toilet-roll (12) - 1 freq |
SoundEx code - K342 kittles - 7 freq kettlespoot - 1 freq ketil's - 2 freq kettle's - 1 freq kettles - 2 freq kittle-sweeties - 1 freq kidology - 1 freq kittlesome - 8 freq kethlicks - 2 freq kethlick - 1 freq kettil-creill - 1 freq kittilskart - 8 freq |
MetaPhone code - KTLKRL kettil-creill - 1 freq |
KETTIL-CREILL |
| Time to execute Levenshtein function - 0.325078 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.523204 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.028584 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.037354 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. |