| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pilloried (0) - 1 freq pillared (2) - 1 freq pillowed (2) - 1 freq sillerie (3) - 15 freq gloried (3) - 1 freq piloted (3) - 1 freq billowed (3) - 1 freq sillered (3) - 1 freq galleried (3) - 1 freq pillaged (3) - 2 freq floried (3) - 1 freq pilled (3) - 3 freq ploied (3) - 1 freq plojied (3) - 1 freq pillowin (3) - 1 freq sillerweed (4) - 1 freq calloused (4) - 2 freq pierie (4) - 8 freq pilie (4) - 1 freq pilling (4) - 1 freq gallerie (4) - 1 freq pittodrie (4) - 16 freq millfield (4) - 2 freq imported (4) - 4 freq millie (4) - 5 freq |
pilloried (0) - 1 freq pillared (2) - 1 freq pillowed (3) - 1 freq pillaged (4) - 2 freq sillered (4) - 1 freq pilled (4) - 3 freq galleried (4) - 1 freq willreid (5) - 13 freq pillar (5) - 15 freq pallor (5) - 4 freq hollered (5) - 5 freq palled (5) - 5 freq apollocreed (5) - 1 freq mallord (5) - 1 freq pallid (5) - 1 freq pillars (5) - 12 freq pillers (5) - 2 freq gollared (5) - 1 freq gollered (5) - 11 freq pulled (5) - 167 freq polluted (5) - 6 freq ploied (5) - 1 freq floried (5) - 1 freq billowed (5) - 1 freq piloted (5) - 1 freq |
SoundEx code - P463 playwriting - 1 freq plartin - 1 freq playwritin - 1 freq pillared - 1 freq polwart - 2 freq polaroid - 1 freq polworth - 3 freq pilloried - 1 freq |
MetaPhone code - PLRT pillared - 1 freq polaroid - 1 freq pilloried - 1 freq |
PILLORIED |
| Time to execute Levenshtein function - 0.689964 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 - 1.298959 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.085622 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.100840 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.001072 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. |