| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poverty (0) - 38 freq overty (1) - 1 freq porty (2) - 1 freq powert (2) - 2 freq coverts (2) - 1 freq pouert (2) - 2 freq puberty (2) - 3 freq popery (2) - 2 freq overtly (2) - 1 freq doherty (2) - 1 freq fowerty (2) - 5 freq novelty (2) - 9 freq covert (2) - 39 freq property (2) - 35 freq overly (2) - 6 freq perty (2) - 33 freq pokert (2) - 1 freq povertee (2) - 1 freq overt (2) - 4 freq dovert (2) - 9 freq poietry (3) - 3 freq dovey (3) - 3 freq robert (3) - 238 freq poshity (3) - 1 freq livery (3) - 13 freq |
poverty (0) - 38 freq overty (2) - 1 freq povertee (2) - 1 freq perty (3) - 33 freq dovert (3) - 9 freq covert (3) - 39 freq overt (3) - 4 freq pokert (3) - 1 freq pouert (3) - 2 freq puberty (3) - 3 freq powert (3) - 2 freq porty (3) - 1 freq livert (4) - 1 freq coverit (4) - 6 freq coveret (4) - 2 freq severt (4) - 1 freq doverit (4) - 1 freq cuvert (4) - 1 freq poudert (4) - 2 freq pairty (4) - 293 freq verity (4) - 2 freq pert (4) - 60 freq pervert (4) - 1 freq revert (4) - 4 freq pouertae (4) - 1 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 |
POVERTY |
| Time to execute Levenshtein function - 0.284014 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.507250 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.063301 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.036982 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.000882 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. |