| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pedant (0) - 3 freq pendant (1) - 1 freq pedals (2) - 3 freq eerant (2) - 2 freq verdant (2) - 7 freq dant (2) - 1 freq peynt (2) - 1 freq pent (2) - 39 freq bejant (2) - 4 freq plant (2) - 82 freq peent (2) - 1 freq pant (2) - 3 freq peasant (2) - 12 freq weant (2) - 1 freq sevant (2) - 1 freq peratt (2) - 1 freq peyan (2) - 1 freq penann (2) - 1 freq pliant (2) - 1 freq peart (2) - 1 freq pedal (2) - 6 freq leant (2) - 34 freq peint (2) - 5 freq remant (2) - 1 freq peat (2) - 59 freq |
pedant (0) - 3 freq pendant (2) - 1 freq pant (3) - 3 freq peasant (3) - 12 freq peent (3) - 1 freq peint (3) - 5 freq peden (3) - 30 freq plant (3) - 82 freq pliant (3) - 1 freq peanut (3) - 11 freq dant (3) - 1 freq peynt (3) - 1 freq pent (3) - 39 freq ordanit (4) - 3 freq plaunt (4) - 2 freq piynt (4) - 2 freq dint (4) - 10 freq point (4) - 403 freq plunt (4) - 6 freq dont (4) - 76 freq wident (4) - 2 freq peyment (4) - 6 freq didnt (4) - 3 freq plaint (4) - 1 freq planet (4) - 212 freq |
SoundEx code - P353 patiently - 28 freq patient - 60 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 - 60 freq patent - 39 freq potent - 6 freq pittin't - 1 freq pedant - 3 freq patient' - 1 freq pautent - 1 freq |
PEDANT |
| Time to execute Levenshtein function - 0.309616 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.538492 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.031626 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.048120 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.001163 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. |