Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pinpint (0) - 1 freq pinpoint (1) - 2 freq pinpynt (1) - 1 freq pining (2) - 1 freq pipit (2) - 6 freq piping (2) - 5 freq pircint (2) - 2 freq pipin (2) - 8 freq pintit (2) - 14 freq inpit (2) - 49 freq pinging (2) - 1 freq pintins (2) - 6 freq pintin' (2) - 1 freq pingilt (2) - 1 freq pipin' (2) - 1 freq pippins (2) - 1 freq pintin (2) - 17 freq pinkin (2) - 1 freq pin-point (2) - 1 freq pinyin (2) - 1 freq pingin (2) - 3 freq pinting (2) - 1 freq pinnin (2) - 4 freq pungent (3) - 2 freq poppin (3) - 22 freq |
pinpint (0) - 1 freq pinpynt (1) - 1 freq pinpoint (1) - 2 freq pin-point (3) - 1 freq pinpointed (4) - 1 freq pungent (4) - 2 freq pingin (4) - 3 freq pinting (4) - 1 freq pinnin (4) - 4 freq pungunt (4) - 1 freq pennant (4) - 1 freq oppint (4) - 2 freq pendant (4) - 1 freq pinnet (4) - 1 freq pinkin (4) - 1 freq pennit (4) - 1 freq propont (4) - 1 freq pinyin (4) - 1 freq pintit (4) - 14 freq inpit (4) - 49 freq pintin (4) - 17 freq pipin (4) - 8 freq pircint (4) - 2 freq pining (4) - 1 freq pipit (4) - 6 freq |
SoundEx code - P515 pom-poms - 1 freq pumpin - 19 freq pin-point - 1 freq penny-pincheen - 1 freq pinpoint - 2 freq pam-pon - 1 freq pin-pointin - 1 freq pinpointed - 1 freq pumping - 2 freq pinpint - 1 freq piano-piano - 1 freq pompoms - 1 freq pinpynt - 1 freq pumpin - 1 freq |
MetaPhone code - PNPNT pin-point - 1 freq pinpoint - 2 freq pinpint - 1 freq pinpynt - 1 freq |
PINPINT |
Time to execute Levenshtein function - 0.208081 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.419816 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.034785 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.038951 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.000905 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. |