| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poorer (0) - 5 freq pooer (1) - 161 freq poored (1) - 56 freq pooper (1) - 1 freq pooren (1) - 2 freq poo'er (1) - 8 freq pooter (1) - 1 freq pooder (1) - 49 freq poocher (2) - 2 freq pooerd (2) - 1 freq plooter (2) - 1 freq ponder (2) - 11 freq corer (2) - 1 freq poors (2) - 30 freq coored (2) - 2 freq hooler (2) - 1 freq poother (2) - 5 freq moored (2) - 2 freq posher (2) - 1 freq tooer (2) - 11 freq hooer (2) - 2 freq puirer (2) - 6 freq fooner (2) - 4 freq porres (2) - 1 freq ooer (2) - 17 freq |
poorer (0) - 5 freq pooder (2) - 49 freq puirer (2) - 6 freq paerer (2) - 1 freq purer (2) - 2 freq pooter (2) - 1 freq porr (2) - 1 freq poored (2) - 56 freq pooer (2) - 161 freq poo'er (2) - 8 freq pooper (2) - 1 freq pooren (2) - 2 freq po'er (3) - 2 freq pores (3) - 5 freq porter (3) - 14 freq poured (3) - 28 freq pouer (3) - 151 freq orrer (3) - 1 freq proper (3) - 184 freq purr (3) - 3 freq pore (3) - 2 freq poor (3) - 424 freq pooered (3) - 3 freq pooers (3) - 27 freq dourer (3) - 2 freq |
SoundEx code - P660 prayer - 96 freq purer - 2 freq priorie - 7 freq prior - 18 freq poorer - 5 freq puirer - 6 freq peerier - 17 freq priory - 3 freq peerie-weerie - 1 freq pre-war - 2 freq 'prayer - 1 freq prairie - 1 freq paerer - 1 freq prayer' - 3 freq |
MetaPhone code - PRR purer - 2 freq priorie - 7 freq prior - 18 freq poorer - 5 freq puirer - 6 freq peerier - 17 freq priory - 3 freq prairie - 1 freq paerer - 1 freq |
POORER poor - 424 freq poorest - 9 freq poorer - 5 freq |
| Time to execute Levenshtein function - 0.211468 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.388836 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.027964 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.036764 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.000950 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. |