| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| partly (0) - 10 freq parly (1) - 2 freq pairtly (1) - 15 freq party (1) - 157 freq partey (1) - 3 freq perty (2) - 33 freq factly (2) - 1 freq early (2) - 366 freq laytly (2) - 1 freq parity (2) - 2 freq laetly (2) - 2 freq darkly (2) - 3 freq warmly (2) - 4 freq partin (2) - 5 freq paety (2) - 1 freq sactly (2) - 1 freq pearly (2) - 5 freq parten (2) - 3 freq parsley (2) - 8 freq paisly (2) - 1 freq purely (2) - 16 freq parry (2) - 1 freq part (2) - 196 freq porty (2) - 1 freq rarely (2) - 43 freq |
partly (0) - 10 freq pairtly (1) - 15 freq partey (2) - 3 freq party (2) - 157 freq parly (2) - 2 freq parle (3) - 1 freq partan (3) - 17 freq pertlie (3) - 1 freq parts (3) - 24 freq part (3) - 196 freq porty (3) - 1 freq parton (3) - 4 freq portal (3) - 3 freq pairtlie (3) - 2 freq partit (3) - 4 freq purely (3) - 16 freq pairtlt (3) - 1 freq aptly (3) - 4 freq pattle (3) - 1 freq paartcy (3) - 1 freq pairty (3) - 293 freq perty (3) - 33 freq parity (3) - 2 freq partial (3) - 8 freq partin (3) - 5 freq |
SoundEx code - P634 proodly - 39 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq portling - 1 freq pairtylowse - 1 freq proudly - 12 freq partially - 10 freq partial - 8 freq partly - 10 freq parteelcar - 1 freq prood-lookin - 1 freq porthole - 1 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 - 39 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.203921 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.675486 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.030700 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.090192 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.000878 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. |