Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pnfw (0) - 1 freq pmfw (1) - 1 freq rpfw (2) - 1 freq paff (2) - 1 freq pfi (2) - 2 freq pdf (2) - 37 freq pdfs (2) - 1 freq nsfw (2) - 4 freq plew (2) - 1 freq enew (2) - 2 freq piff (2) - 1 freq pnd (2) - 1 freq pf (2) - 4 freq nnpw (2) - 1 freq drfw (2) - 1 freq pew (2) - 15 freq bufw (2) - 1 freq info (2) - 36 freq xnw (2) - 1 freq pfft (2) - 3 freq ufw (2) - 1 freq qfw (2) - 1 freq snaw (2) - 185 freq phew (2) - 12 freq gnaw (2) - 6 freq |
pnfw (0) - 1 freq pmfw (2) - 1 freq onfaw (3) - 4 freq nmw (4) - 1 freq jnfr (4) - 1 freq puff (4) - 43 freq pn (4) - 4 freq nvw (4) - 1 freq nw (4) - 3 freq 'naw (4) - 169 freq now (4) - 734 freq 'now (4) - 5 freq pnii (4) - 1 freq pw (4) - 4 freq know (4) - 1205 freq plww (4) - 1 freq inaw (4) - 7 freq enow (4) - 5 freq nfu (4) - 1 freq pnq (4) - 1 freq new (4) - 2325 freq pfl (4) - 1 freq knaw (4) - 16 freq paw (4) - 47 freq infy (4) - 1 freq |
SoundEx code - P510 pawnwife - 1 freq pump - 31 freq pamby - 1 freq pompay - 1 freq painfu - 5 freq pomp - 2 freq pumpie - 2 freq pompeii - 1 freq pompei - 1 freq pmfw - 1 freq pnfw - 1 freq |
MetaPhone code - NF knife - 104 freq nieve - 29 freq neive - 21 freq knave - 48 freq navy - 45 freq 'nuff - 1 freq nephew - 28 freq nfu - 1 freq nigh - 18 freq gnef - 1 freq nov - 4 freq naive - 11 freq nova - 7 freq nevahhh - 1 freq 'knife - 1 freq nove - 1 freq naïve - 5 freq gnough - 1 freq neave - 3 freq no've - 2 freq neigh - 4 freq knif - 1 freq naff - 2 freq nev - 6 freq nav - 3 freq naïf - 1 freq niff - 1 freq niv - 5 freq nevoy - 7 freq €˜knifey - 1 freq hyne-aff - 1 freq nava - 30 freq €™nyf - 1 freq nouveau - 3 freq nave - 1 freq naffu - 1 freq navvy - 1 freq new-faa - 1 freq nv - 5 freq nf - 2 freq nvw - 1 freq nva - 2 freq nuf - 1 freq gnev - 1 freq wnvh - 1 freq noyfea - 1 freq nhv - 1 freq ngho - 1 freq pnfw - 1 freq naafi - 1 freq |
PNFW |
Time to execute Levenshtein function - 0.179546 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.335407 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.027431 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.037059 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.000915 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. |