| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| partial (0) - 8 freq pairtial (1) - 1 freq martial (1) - 5 freq partit (2) - 4 freq parties (2) - 20 freq €˜partial (2) - 1 freq impartial (2) - 1 freq particle (2) - 1 freq palatial (2) - 1 freq portal (2) - 3 freq martian (2) - 7 freq partied (2) - 1 freq partan (2) - 17 freq partisan (2) - 3 freq partially (2) - 10 freq parting (2) - 3 freq portia (2) - 2 freq partick (2) - 12 freq mairtial (2) - 3 freq partin (2) - 5 freq wartim (3) - 1 freq nuptial (3) - 8 freq natal (3) - 2 freq carian (3) - 1 freq artist (3) - 27 freq |
partial (0) - 8 freq pairtial (1) - 1 freq portal (2) - 3 freq martial (2) - 5 freq partan (3) - 17 freq partly (3) - 10 freq partin (3) - 5 freq partied (3) - 1 freq mairtial (3) - 3 freq partially (3) - 10 freq portia (3) - 2 freq partit (3) - 4 freq parties (3) - 20 freq impartial (3) - 1 freq particle (3) - 1 freq palatial (3) - 1 freq parten (4) - 3 freq pastel (4) - 2 freq marital (4) - 5 freq partake (4) - 4 freq portals (4) - 1 freq portray (4) - 1 freq pairtly (4) - 15 freq persil (4) - 1 freq pistil (4) - 3 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 - PRXL parochial - 11 freq partially - 10 freq partial - 8 freq pairtial - 1 freq pairtially - 2 freq €˜partial - 1 freq |
PARTIAL |
| Time to execute Levenshtein function - 0.194573 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.427419 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.058429 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.036971 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.000861 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. |