| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kardashians (0) - 2 freq kardashian (1) - 1 freq barbarians (4) - 2 freq warnishins (4) - 2 freq arabians (4) - 1 freq karpethian (4) - 3 freq hardships (4) - 3 freq asians (5) - 4 freq eurasian (5) - 2 freq rashis (5) - 1 freq corinthians (5) - 5 freq bashans (5) - 1 freq firmaeshins (5) - 1 freq warslins (5) - 1 freq rashan (5) - 2 freq carinthian (5) - 1 freq aathins (5) - 3 freq paraffins (5) - 1 freq waashan (5) - 1 freq fashions (5) - 3 freq bartisans (5) - 1 freq roushian (5) - 1 freq dalmatians (5) - 4 freq barbarian (5) - 2 freq warnishin (5) - 3 freq |
kardashians (0) - 2 freq kardashian (2) - 1 freq warnishins (6) - 2 freq krishnas (6) - 5 freq hardships (6) - 3 freq firmaeshins (7) - 1 freq roushianes (7) - 1 freq kurdistan (7) - 1 freq haurdships (7) - 1 freq furnishins (7) - 1 freq karpethian (7) - 3 freq krishnan (7) - 1 freq dashin (8) - 7 freq sandisans (8) - 1 freq russians (8) - 9 freq reasins (8) - 1 freq dashan (8) - 1 freq warkshoaps (8) - 2 freq marathons (8) - 4 freq trashin (8) - 1 freq frisians (8) - 3 freq cardigans (8) - 5 freq rooshian (8) - 1 freq varshini (8) - 16 freq galoshans (8) - 1 freq |
SoundEx code - K632 kerrots - 1 freq kerds - 1 freq keywirds - 1 freq kurds - 1 freq kurdish - 1 freq kurdistan - 1 freq kardashians - 2 freq kurtas - 1 freq kurtoglu - 1 freq kardashian - 1 freq kiritekatawa - 1 freq kurtisbrown - 4 freq |
MetaPhone code - KRTXNS gradations - 1 freq kardashians - 2 freq |
KARDASHIANS |
| Time to execute Levenshtein function - 0.225801 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.449421 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.030453 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.037219 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.000902 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. |