| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pit-pat (0) - 2 freq pit-a-pat (2) - 1 freq bit-part (2) - 2 freq pit-oot (2) - 5 freq kitkat (3) - 3 freq pittert (3) - 1 freq pithead (3) - 1 freq pittan (3) - 13 freq pitt (3) - 8 freq pit-on (3) - 7 freq fit-faw (3) - 1 freq pent-pot (3) - 1 freq sitiwat (3) - 1 freq pita (3) - 2 freq pitit (3) - 5 freq pit-by (3) - 1 freq yit-an (3) - 2 freq sitwat (3) - 1 freq pit-pony (3) - 1 freq pittit (3) - 2 freq pitcht (3) - 1 freq pet-an (3) - 1 freq nit-wit (3) - 1 freq p-p-pit (3) - 1 freq pipit (3) - 6 freq |
pit-pat (0) - 2 freq pit-oot (3) - 5 freq pit-a-pat (3) - 1 freq tea-pat (4) - 1 freq pent-pot (4) - 1 freq pit-pony (4) - 1 freq poot-poot (4) - 2 freq bit-part (4) - 2 freq pet-an (5) - 1 freq pittit (5) - 2 freq pit-poetry (5) - 1 freq up-pit (5) - 1 freq pipit (5) - 6 freq p-p-pit (5) - 1 freq nit-wit (5) - 1 freq pitcht (5) - 1 freq pittert (5) - 1 freq put-upon (5) - 1 freq pitt (5) - 8 freq pit-on (5) - 7 freq pit-by (5) - 1 freq pitit (5) - 5 freq pypet (6) - 2 freq puppet (6) - 14 freq parapet (6) - 3 freq |
SoundEx code - P313 poot-poot-pootin - 1 freq poot-poot - 2 freq phut-phut-phut-phut-phut - 1 freq pit-poetry - 1 freq pathfoot - 1 freq pee-the-bed - 1 freq pit-pat - 2 freq pit-a-pat - 1 freq putbodypartsinfilms - 1 freq ptbt - 1 freq |
MetaPhone code - PTPT poot-poot - 2 freq pit-pat - 2 freq pit-a-pat - 1 freq |
PIT-PAT |
| Time to execute Levenshtein function - 0.235323 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.366722 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.027264 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.038828 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.000921 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. |