| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pitchfork (0) - 1 freq pitchforks (1) - 3 freq patchwork (2) - 2 freq hitchcock (3) - 1 freq patchwark (3) - 1 freq patchwirk (3) - 4 freq pitcher (3) - 1 freq pictoors (4) - 1 freq pincher (4) - 2 freq pitchin (4) - 2 freq dischort (4) - 1 freq pilchard (4) - 1 freq pinchers (4) - 2 freq litcors (4) - 3 freq ichor (4) - 1 freq pitcht (4) - 1 freq stitchwort (4) - 1 freq pitmirk (4) - 9 freq pitch-daurk (4) - 1 freq picher (4) - 4 freq pitch (4) - 89 freq pathfoot (4) - 1 freq witchery (4) - 3 freq pitches (4) - 15 freq pit-mirk (4) - 3 freq |
pitchfork (0) - 1 freq pitchforks (2) - 3 freq patchwork (3) - 2 freq patchwark (4) - 1 freq patchwirk (4) - 4 freq pitcher (5) - 1 freq pitch-daurk (6) - 1 freq hitchcock (6) - 1 freq witchery (7) - 3 freq pathfoot (7) - 1 freq picher (7) - 4 freq pitches (7) - 15 freq pitch (7) - 89 freq pichert (7) - 1 freq chork (7) - 1 freq pitched (7) - 7 freq pitlochory (7) - 1 freq pit-mirk (7) - 3 freq pitt-mirk (7) - 1 freq pinchers (7) - 2 freq pitchin (7) - 2 freq pincher (7) - 2 freq pitmirk (7) - 9 freq pilchard (7) - 1 freq pitcht (7) - 1 freq |
SoundEx code - P321 pots-buta - 1 freq pit-cowp - 1 freq puddockflunkie - 1 freq pittsburgh - 3 freq pitchfork - 1 freq photocopyin - 2 freq pitch-black - 1 freq patch-bay - 1 freq photocoapie - 1 freq photocopiers - 1 freq photo-copier - 1 freq pitchforks - 3 freq pitch-perfeck - 1 freq phdtkpt - 1 freq pdtasfh - 1 freq photocopier - 1 freq photoshop - 1 freq photo-shopped - 1 freq pfptcvc - 1 freq |
MetaPhone code - PXFRK pitchfork - 1 freq |
PITCHFORK |
| Time to execute Levenshtein function - 0.226763 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.437144 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.027870 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.037017 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.000850 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. |