| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| krispy (0) - 4 freq crispy (1) - 10 freq grisly (2) - 3 freq kris (2) - 1 freq raspy (2) - 2 freq grippy (2) - 9 freq wispy (2) - 5 freq krista (2) - 4 freq prissy (2) - 1 freq crisp (2) - 42 freq frisky (2) - 4 freq tristy (2) - 1 freq risp (2) - 2 freq risky (2) - 8 freq crisps (2) - 34 freq trippy (2) - 2 freq drippy (2) - 1 freq skippy (3) - 2 freq chisty (3) - 1 freq briskly (3) - 3 freq priory (3) - 3 freq shippy (3) - 1 freq wrily (3) - 1 freq chrissy (3) - 9 freq fishy (3) - 14 freq |
krispy (0) - 4 freq crispy (2) - 10 freq crisp (3) - 42 freq risp (3) - 2 freq krista (3) - 4 freq kris (3) - 1 freq raspy (3) - 2 freq gresp (4) - 2 freq grasp (4) - 27 freq drippy (4) - 1 freq krispies (4) - 1 freq kirsty (4) - 159 freq krap (4) - 1 freq rasp (4) - 11 freq trippy (4) - 2 freq krapp (4) - 1 freq tristy (4) - 1 freq wispy (4) - 5 freq prissy (4) - 1 freq frisky (4) - 4 freq crisps (4) - 34 freq grippy (4) - 9 freq risky (4) - 8 freq grisly (4) - 3 freq knappy (5) - 1 freq |
SoundEx code - K621 kirkbean - 2 freq krassivy - 1 freq kirkfieldbank - 1 freq kirk-brae - 1 freq kirkpatrick - 6 freq kircubbin - 1 freq kirk-fowk - 1 freq kershopefit - 1 freq krazibaker - 1 freq krispies - 1 freq krzwyf - 1 freq krisboydssmile - 1 freq krispy - 4 freq |
MetaPhone code - KRSP crisp - 42 freq crispy - 10 freq grasp - 27 freq gresp - 2 freq krispy - 4 freq |
KRISPY |
| Time to execute Levenshtein function - 0.212042 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.366590 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.027951 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.039107 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.000808 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. |