| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| povertee (0) - 1 freq poverty (2) - 38 freq pouertae (2) - 1 freq oversee (2) - 1 freq powertfu (3) - 1 freq hovered (3) - 11 freq dovert (3) - 9 freq overseen (3) - 1 freq iveree (3) - 7 freq covert (3) - 39 freq propertie (3) - 1 freq vertew (3) - 1 freq pouert (3) - 2 freq vertue (3) - 2 freq overtake (3) - 1 freq converted (3) - 6 freq governed (3) - 4 freq fowertie (3) - 5 freq poetre (3) - 1 freq coverage (3) - 15 freq overtly (3) - 1 freq inverted (3) - 2 freq porter (3) - 14 freq coverts (3) - 1 freq souerte (3) - 2 freq |
povertee (0) - 1 freq poverty (2) - 38 freq pouertae (3) - 1 freq pouert (4) - 2 freq pokert (4) - 1 freq vertue (4) - 2 freq overt (4) - 4 freq portie (4) - 3 freq powert (4) - 2 freq coveret (4) - 2 freq vertie (4) - 1 freq overty (4) - 1 freq oversee (4) - 1 freq covert (4) - 39 freq dovert (4) - 9 freq pertie (4) - 6 freq dyvert (5) - 1 freq virtue (5) - 15 freq livert (5) - 1 freq veritie (5) - 3 freq poort (5) - 5 freq advert (5) - 32 freq pairte (5) - 1 freq perty (5) - 33 freq covered (5) - 124 freq |
SoundEx code - P163 peppert - 1 freq pavarotti - 3 freq poverty - 38 freq powbrade - 1 freq povertee - 1 freq puberty - 3 freq pee-yoo-ber-tee - 1 freq pippered - 1 freq paper-thin - 1 freq pivvered - 1 freq peppered - 1 freq papered - 1 freq |
MetaPhone code - PFRT pavarotti - 3 freq poverty - 38 freq povertee - 1 freq pivvered - 1 freq |
POVERTEE |
| Time to execute Levenshtein function - 0.405872 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.891569 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.078865 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.092863 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.000871 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. |