| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| partly (0) - 10 freq partey (1) - 3 freq party (1) - 153 freq parly (1) - 2 freq pairtly (1) - 15 freq part (2) - 188 freq patty (2) - 3 freq hardly (2) - 209 freq tarty (2) - 1 freq warmly (2) - 4 freq barely (2) - 96 freq pasty (2) - 1 freq parted (2) - 1 freq partit (2) - 4 freq eardly (2) - 1 freq arty (2) - 1 freq sparkly (2) - 9 freq purely (2) - 16 freq lastly (2) - 5 freq laytly (2) - 1 freq aaftly (2) - 1 freq sarely (2) - 1 freq paisly (2) - 1 freq farty (2) - 1 freq pairtlt (2) - 1 freq |
partly (0) - 10 freq pairtly (1) - 15 freq parly (2) - 2 freq partey (2) - 3 freq party (2) - 153 freq parts (3) - 23 freq parton (3) - 4 freq porty (3) - 1 freq pairtlt (3) - 1 freq partial (3) - 7 freq partan (3) - 17 freq perty (3) - 30 freq pearly (3) - 5 freq parity (3) - 2 freq parsley (3) - 8 freq partin (3) - 5 freq pairtlie (3) - 2 freq parle (3) - 1 freq parten (3) - 3 freq paartcy (3) - 1 freq pertlie (3) - 1 freq portal (3) - 3 freq pattle (3) - 1 freq aptly (3) - 4 freq part (3) - 188 freq |
SoundEx code - P634 proodly - 38 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq portling - 1 freq pairtylowse - 1 freq proudly - 12 freq partly - 10 freq partial - 7 freq parteelcar - 1 freq prood-lookin - 1 freq porthole - 1 freq partially - 9 freq portals - 1 freq prattle's - 1 freq proodlie - 2 freq pairtlie - 2 freq pairtial - 1 freq proudlie - 1 freq prood-like - 1 freq portaloo - 1 freq pairtlt - 1 freq pertlie - 1 freq pairtially - 2 freq portland - 13 freq proodlik - 1 freq €˜partial - 1 freq portlethen - 1 freq prattlin - 1 freq portaloos - 1 freq |
MetaPhone code - PRTL proodly - 38 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq proudly - 12 freq partly - 10 freq proodlie - 2 freq pairtlie - 2 freq proudlie - 1 freq portaloo - 1 freq pertlie - 1 freq |
PARTLY |
| Time to execute Levenshtein function - 0.190866 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.341179 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.027223 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.036699 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.000792 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. |