Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
patent (0) - 39 freq pautent (1) - 1 freq patents (1) - 3 freq patient (1) - 59 freq potent (1) - 6 freq parent (1) - 21 freq parent- (2) - 1 freq ladent (2) - 1 freq pent (2) - 39 freq ahent (2) - 100 freq dacent (2) - 14 freq patel (2) - 1 freq stent (2) - 29 freq paket (2) - 1 freq petert (2) - 1 freq patane (2) - 1 freq pagett (2) - 2 freq paint (2) - 60 freq preent (2) - 2 freq latest (2) - 71 freq saftent (2) - 3 freq attent (2) - 1 freq intent (2) - 37 freq prsent (2) - 1 freq faent (2) - 2 freq |
patent (0) - 39 freq patient (1) - 59 freq potent (1) - 6 freq pautent (1) - 1 freq parent (2) - 21 freq patents (2) - 3 freq patently (3) - 6 freq payment (3) - 4 freq paton (3) - 2 freq paument (3) - 1 freq peent (3) - 1 freq pattet (3) - 2 freq prent (3) - 42 freq patient' (3) - 1 freq pacient (3) - 3 freq pattit (3) - 20 freq pant (3) - 2 freq patina (3) - 1 freq paurent (3) - 4 freq panet (3) - 1 freq apent (3) - 29 freq patients (3) - 29 freq paarent (3) - 1 freq pageant (3) - 2 freq extent (3) - 47 freq |
SoundEx code - P353 patiently - 27 freq patient - 59 freq patent - 39 freq potent - 6 freq potential - 90 freq patientfu - 2 freq potentate - 1 freq pittin't - 1 freq patently - 6 freq potentially - 11 freq patients - 29 freq patient's - 5 freq patents - 3 freq pittendreich - 1 freq pedant - 3 freq potentiallie - 1 freq potentials - 1 freq pudendum - 2 freq patient' - 1 freq pautent - 1 freq pitmeeden - 1 freq pitmedden - 1 freq peatanddiesel - 1 freq |
MetaPhone code - PTNT patient - 59 freq patent - 39 freq potent - 6 freq pittin't - 1 freq pedant - 3 freq patient' - 1 freq pautent - 1 freq |
PATENT |
Time to execute Levenshtein function - 0.204779 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.375839 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.027359 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.039516 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.000824 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. |