| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pinkies (0) - 3 freq pinkie (1) - 18 freq dinkies (1) - 1 freq tinkies (1) - 2 freq dinkie (2) - 3 freq pickles (2) - 2 freq piecies (2) - 1 freq silkies (2) - 2 freq linkie (2) - 3 freq binkie (2) - 1 freq punnies (2) - 4 freq pawkies (2) - 2 freq dunkies (2) - 1 freq ponies (2) - 6 freq pintins (2) - 6 freq birkies (2) - 1 freq pennies (2) - 23 freq hankies (2) - 3 freq pliskies (2) - 3 freq pines (2) - 9 freq wilkies (2) - 1 freq pickie (2) - 2 freq wingies (2) - 1 freq jinnies (2) - 1 freq indies (2) - 6 freq |
pinkies (0) - 3 freq pinkie (2) - 18 freq tinkies (2) - 2 freq pinks (2) - 4 freq dinkies (2) - 1 freq yankies (3) - 1 freq pines (3) - 9 freq hunkies (3) - 3 freq pansies (3) - 4 freq hankies (3) - 3 freq pikes (3) - 8 freq pinkish (3) - 2 freq spunkies (3) - 1 freq pennies (3) - 23 freq pokkies (3) - 2 freq nikies (3) - 1 freq panties (3) - 2 freq junkies (3) - 9 freq punks (3) - 2 freq punies (3) - 3 freq pockies (3) - 1 freq punnies (3) - 4 freq pinkin (3) - 1 freq ponies (3) - 6 freq porkies (3) - 2 freq |
SoundEx code - P522 pinkies - 3 freq pancake - 52 freq punches - 5 freq pansies - 4 freq pinkish - 2 freq penicuik - 5 freq pinnaces - 2 freq pancakes - 14 freq paunch-gabbed - 1 freq pences - 3 freq punsis - 1 freq painches - 1 freq pounces - 1 freq pinches - 2 freq pan-haggis - 1 freq pancakeday - 1 freq punshees - 1 freq pingusu - 8 freq pamgosalmsp - 1 freq punkasfuck - 4 freq penicuikath - 21 freq penicuikathu - 2 freq penicuikafc - 2 freq pinechest - 1 freq pinocchios - 1 freq |
MetaPhone code - PNKS pinkies - 3 freq panic's - 1 freq pongs - 2 freq pings - 4 freq pinks - 4 freq panics - 2 freq pangs - 2 freq punks - 2 freq pingusu - 8 freq |
PINKIES |
| Time to execute Levenshtein function - 0.404597 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.695324 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.029185 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.074708 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.000828 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. |