| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| passowre (0) - 7 freq passower (2) - 9 freq ashore (3) - 35 freq assure (3) - 21 freq pastor (3) - 1 freq passport (3) - 16 freq pass-ower (3) - 1 freq associe (3) - 32 freq powre (3) - 2 freq massacre (3) - 7 freq pasport (3) - 5 freq dissowle (3) - 1 freq password (3) - 5 freq passero (3) - 1 freq pasture (3) - 11 freq passover (3) - 3 freq wast-owre (3) - 1 freq passive (3) - 9 freq passage (3) - 60 freq pussie (4) - 6 freq pals've (4) - 1 freq aspire (4) - 4 freq pae-wae (4) - 1 freq watslure (4) - 2 freq absolve (4) - 3 freq |
passowre (0) - 7 freq passower (2) - 9 freq passero (4) - 1 freq password (4) - 5 freq pass-ower (4) - 1 freq passover (4) - 3 freq posster (5) - 1 freq passage (5) - 60 freq pasture (5) - 11 freq dissowle (5) - 1 freq passive (5) - 9 freq assure (5) - 21 freq passport (5) - 16 freq pastor (5) - 1 freq massacre (5) - 7 freq powre (5) - 2 freq missure (6) - 1 freq sasser (6) - 11 freq passanger (6) - 1 freq passin' (6) - 7 freq swore (6) - 25 freq asseir (6) - 1 freq masseur (6) - 2 freq powr (6) - 1 freq posture (6) - 9 freq |
SoundEx code - P260 poker - 22 freq picher - 4 freq pawkerie - 2 freq powker - 5 freq pyker - 1 freq pyocher - 3 freq passower - 9 freq pecr - 1 freq passero - 1 freq pucker - 1 freq pusher - 3 freq pawkery - 2 freq poacher - 10 freq pakora - 3 freq poser - 2 freq passowre - 7 freq pecker - 1 freq packer - 1 freq pawcher - 1 freq piggar - 1 freq pikyure - 1 freq piggery - 3 freq poocher - 2 freq pass-ower - 1 freq poukerie - 1 freq pager - 1 freq posher - 1 freq pyochery - 1 freq pisher - 1 freq picshur - 1 freq pjr - 1 freq pikxsr - 1 freq pcr - 1 freq |
MetaPhone code - PSR passero - 1 freq poser - 2 freq passowre - 7 freq |
PASSOWRE |
| Time to execute Levenshtein function - 0.198722 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.344230 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.029632 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.037469 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.000956 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. |