| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| papists (0) - 2 freq papist (1) - 3 freq pasts (2) - 4 freq paints (2) - 2 freq gaists (2) - 1 freq baists (2) - 22 freq preists (2) - 3 freq pairts (2) - 230 freq papish (2) - 1 freq waists (2) - 3 freq paist (2) - 1 freq racists (2) - 6 freq paisty (2) - 1 freq laists (2) - 1 freq purists (2) - 5 freq rapids (3) - 1 freq points (3) - 79 freq wrists (3) - 10 freq faiss (3) - 7 freq airts (3) - 356 freq gapit (3) - 1 freq playlists (3) - 1 freq pairt (3) - 933 freq waits (3) - 27 freq piss (3) - 72 freq |
papists (0) - 2 freq papist (2) - 3 freq purists (3) - 5 freq preists (3) - 3 freq pasts (3) - 4 freq pastas (4) - 1 freq poasts (4) - 1 freq pests (4) - 2 freq poopits (4) - 1 freq posts (4) - 45 freq poppets (4) - 1 freq puppets (4) - 2 freq pastes (4) - 1 freq priests (4) - 25 freq anapests (4) - 1 freq paist (4) - 1 freq gaists (4) - 1 freq baists (4) - 22 freq waists (4) - 3 freq papish (4) - 1 freq pairts (4) - 230 freq paints (4) - 2 freq racists (4) - 6 freq paisty (4) - 1 freq laists (4) - 1 freq |
SoundEx code - P123 poe-faced - 3 freq puppy-sit - 2 freq papist - 3 freq papists - 2 freq poppyscotland - 3 freq pipistrelle - 1 freq |
MetaPhone code - PPSTS papists - 2 freq |
PAPISTS |
| Time to execute Levenshtein function - 0.218248 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.368752 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.030461 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.038057 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.000937 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. |