| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| partitch (0) - 1 freq parritch (1) - 66 freq partit (2) - 4 freq pairritch (2) - 1 freq partick (2) - 12 freq porritch (2) - 7 freq purritch (2) - 3 freq garrioch (3) - 1 freq parfit (3) - 2 freq scritch (3) - 1 freq partin (3) - 5 freq scraitch (3) - 1 freq particle (3) - 1 freq pastiche (3) - 2 freq dartit (3) - 2 freq parity (3) - 2 freq streitch (3) - 12 freq stitch (3) - 11 freq cabbitch (3) - 3 freq titch (3) - 5 freq poortith (3) - 5 freq pitch (3) - 89 freq paitish (3) - 1 freq patch (3) - 79 freq pattit (3) - 20 freq |
partitch (0) - 1 freq parritch (2) - 66 freq porritch (3) - 7 freq purritch (3) - 3 freq pairritch (3) - 1 freq puirtith (4) - 21 freq pirraitch (4) - 1 freq poortith (4) - 5 freq partick (4) - 12 freq partit (4) - 4 freq pairtic (5) - 1 freq prattick (5) - 18 freq pertit (5) - 2 freq paroch (5) - 2 freq patch (5) - 79 freq praith (5) - 1 freq portico (5) - 1 freq garevitch (5) - 1 freq partition (5) - 4 freq pairtit (5) - 21 freq pitch (5) - 89 freq praich (5) - 10 freq stitch (5) - 11 freq prattics (5) - 2 freq titch (5) - 5 freq |
SoundEx code - P633 pairtit - 21 freq poortith - 5 freq parteetion - 6 freq partition - 4 freq predation - 1 freq predator - 7 freq peerie-heidit - 4 freq parteition - 3 freq pertit - 2 freq puirtith - 21 freq partitch - 1 freq partit - 4 freq predetermined - 2 freq parted - 1 freq parauded - 1 freq prided - 2 freq parrotit - 1 freq paraded - 3 freq pairted - 5 freq pairtied - 2 freq peerie-wee-tottie - 1 freq parradiddle - 1 freq pre-date - 1 freq partied - 1 freq pre-daets - 1 freq pirated - 1 freq proddit - 1 freq predators - 1 freq peerie-heedit - 1 freq prodded - 1 freq perdition - 1 freq pooer-athoot-responsibility - 1 freq pridit - 1 freq predatory - 1 freq pirhouetted - 1 freq portaedoon - 1 freq prototype - 1 freq pruetweets - 3 freq parroted - 1 freq |
MetaPhone code - PRTX partitch - 1 freq |
PARTITCH |
| Time to execute Levenshtein function - 0.225865 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.422443 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.030357 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.037687 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.000956 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. |