| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| partial (0) - 7 freq martial (1) - 5 freq pairtial (1) - 1 freq €˜partial (2) - 1 freq partisan (2) - 3 freq partied (2) - 1 freq partan (2) - 17 freq partin (2) - 5 freq partit (2) - 4 freq partially (2) - 9 freq palatial (2) - 1 freq parting (2) - 3 freq particle (2) - 1 freq impartial (2) - 1 freq portia (2) - 2 freq parties (2) - 20 freq portal (2) - 3 freq martian (2) - 7 freq mairtial (2) - 3 freq partick (2) - 12 freq pairtially (3) - 2 freq particles (3) - 6 freq patio (3) - 5 freq factual (3) - 9 freq parkin (3) - 16 freq |
partial (0) - 7 freq pairtial (1) - 1 freq portal (2) - 3 freq martial (2) - 5 freq impartial (3) - 1 freq portia (3) - 2 freq particle (3) - 1 freq partly (3) - 10 freq palatial (3) - 1 freq mairtial (3) - 3 freq parties (3) - 20 freq partan (3) - 17 freq partin (3) - 5 freq partit (3) - 4 freq partied (3) - 1 freq partially (3) - 9 freq pairtly (4) - 15 freq portie (4) - 3 freq portray (4) - 1 freq parton (4) - 4 freq pastel (4) - 2 freq marital (4) - 5 freq portion (4) - 22 freq pertit (4) - 2 freq palatal (4) - 3 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 - PRXL parochial - 10 freq partial - 7 freq partially - 9 freq pairtial - 1 freq pairtially - 2 freq €˜partial - 1 freq |
PARTIAL |
| Time to execute Levenshtein function - 0.210621 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.378496 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.029257 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.040533 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.000800 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. |