| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kittlerumpit (0) - 8 freq kitterumpit (1) - 1 freq interuppit (4) - 1 freq intteruptit (5) - 1 freq trumpit (5) - 5 freq kittlet-up (5) - 1 freq littlemusic (5) - 4 freq kittled-up (5) - 1 freq kittlit (5) - 1 freq interrupit (5) - 1 freq interruppit (5) - 8 freq kittlet (5) - 5 freq kittlesome (5) - 8 freq contermit (6) - 4 freq interessit (6) - 3 freq little-bookit (6) - 1 freq skitterin (6) - 11 freq bittersie (6) - 2 freq letterit (6) - 1 freq lempit (6) - 2 freq sattlement (6) - 2 freq intromit (6) - 3 freq mutterit (6) - 2 freq settlement (6) - 17 freq kittl't (6) - 1 freq |
kittlerumpit (0) - 8 freq kitterumpit (2) - 1 freq kittlesome (8) - 8 freq kittlit (8) - 1 freq kettlespoot (8) - 1 freq kittled-up (8) - 1 freq kittlet (8) - 5 freq interuppit (8) - 1 freq trumpit (8) - 5 freq kittlet-up (8) - 1 freq trumpat (9) - 1 freq bettermaist (9) - 5 freq kittelt (9) - 7 freq kittl't (9) - 1 freq attempt (9) - 77 freq bettherment (9) - 3 freq betterment (9) - 6 freq kittilt-up (9) - 1 freq muintrampit (9) - 1 freq settlement (9) - 17 freq trampit (9) - 6 freq strampit (9) - 2 freq trumpet (9) - 25 freq kittlt (9) - 4 freq interrupit (9) - 1 freq |
SoundEx code - K346 kittlerumpit - 8 freq kdeller - 1 freq |
MetaPhone code - KTLRMPT kittlerumpit - 8 freq |
KITTLERUMPIT |
| Time to execute Levenshtein function - 0.324352 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.415882 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.026952 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.036676 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.000841 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. |