| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| password (0) - 5 freq passport (2) - 16 freq passioun (3) - 1 freq crossword (3) - 4 freq eastward (3) - 2 freq passower (3) - 9 freq passion (3) - 75 freq pastor (3) - 1 freq passend (3) - 1 freq passions (3) - 3 freq ae-word (3) - 1 freq sword (3) - 107 freq hameword (3) - 1 freq pasport (3) - 5 freq rashford (3) - 2 freq passports (3) - 8 freq passowre (3) - 7 freq dadswork (3) - 1 freq passed (3) - 304 freq pawned (4) - 2 freq dashboard (4) - 3 freq €˜word (4) - 1 freq atward (4) - 1 freq backward (4) - 11 freq fassont (4) - 1 freq |
password (0) - 5 freq passower (4) - 9 freq passowre (4) - 7 freq passport (4) - 16 freq crossword (5) - 4 freq passed (5) - 304 freq passend (5) - 1 freq sword (5) - 107 freq eastward (5) - 2 freq sawrd (6) - 1 freq answered (6) - 114 freq passover (6) - 3 freq postcerd (6) - 1 freq pissd (6) - 1 freq possters (6) - 1 freq pissheid (6) - 1 freq asseired (6) - 1 freq postcard (6) - 8 freq seward (6) - 2 freq perswayd (6) - 1 freq swurd (6) - 5 freq pass-ower (6) - 1 freq assuired (6) - 1 freq potsherd (6) - 1 freq pissed (6) - 31 freq |
SoundEx code - P263 pokert - 1 freq puckert-up - 1 freq puckert - 2 freq pichert - 1 freq pooskered - 3 freq puckered - 3 freq password - 5 freq pyochered - 3 freq pouskered - 1 freq pokered - 1 freq |
MetaPhone code - PSWRT password - 5 freq |
PASSWORD |
| Time to execute Levenshtein function - 0.277651 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.531558 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.086220 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.072073 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.000830 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. |