| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pillars (0) - 12 freq pillers (1) - 2 freq pillas (1) - 3 freq pillar (1) - 15 freq sillars (1) - 2 freq pillaes (1) - 7 freq willans (2) - 1 freq killers (2) - 9 freq dollars (2) - 7 freq poplars (2) - 2 freq sillar (2) - 3 freq pill's (2) - 1 freq villas (2) - 2 freq fillers (2) - 1 freq collars (2) - 8 freq millar (2) - 11 freq pallas (2) - 2 freq pilla (2) - 11 freq pillows (2) - 4 freq pills (2) - 16 freq sellars (2) - 1 freq pullar (2) - 5 freq pillls (2) - 1 freq millans (2) - 1 freq pillage (2) - 4 freq |
pillars (0) - 12 freq pillers (1) - 2 freq pillaes (2) - 7 freq sillars (2) - 2 freq pillas (2) - 3 freq pillar (2) - 15 freq pullar (3) - 5 freq pills (3) - 16 freq pillls (3) - 1 freq sellars (3) - 1 freq cellars (3) - 1 freq pillows (3) - 4 freq pedlars (3) - 1 freq pillared (3) - 1 freq pallas (3) - 2 freq killers (3) - 9 freq pill's (3) - 1 freq fillers (3) - 1 freq collars (3) - 8 freq dollars (3) - 7 freq poplars (3) - 2 freq pallets (4) - 7 freq puller (4) - 1 freq keillers (4) - 1 freq poller (4) - 1 freq |
SoundEx code - P462 players - 152 freq pleywrights - 6 freq pleywright - 2 freq playwricht - 4 freq pillars - 12 freq playwright - 3 freq playwrights - 3 freq pillers - 2 freq peelers - 7 freq pleyers - 7 freq pliers - 2 freq polaris - 3 freq playwrichts - 6 freq player's - 1 freq polarisin - 1 freq pluricentric - 1 freq paullawriegolf - 4 freq polarised - 1 freq paulharris - 3 freq philharrison - 1 freq |
MetaPhone code - PLRS pillars - 12 freq pillers - 2 freq peelers - 7 freq pliers - 2 freq polaris - 3 freq |
PILLARS |
| Time to execute Levenshtein function - 0.207158 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.413567 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.027644 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.039735 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.001103 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. |