| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newsnet (0) - 2 freq newsed (2) - 6 freq newse (2) - 3 freq newsmen (2) - 2 freq newbie (3) - 3 freq nestlt (3) - 1 freq newsan (3) - 2 freq nessie (3) - 11 freq nest (3) - 81 freq newer (3) - 7 freq nesbit (3) - 1 freq rewyne (3) - 3 freq newlie (3) - 1 freq newsins (3) - 4 freq nevet (3) - 1 freq newin (3) - 1 freq nekst (3) - 1 freq neisten (3) - 1 freq newsing (3) - 1 freq nestit (3) - 3 freq leisn't (3) - 1 freq twinet (3) - 2 freq newport (3) - 3 freq nested (3) - 1 freq beisnes (3) - 5 freq |
newsnet (0) - 2 freq newsing (4) - 1 freq newsins (4) - 4 freq newest (4) - 15 freq newsan (4) - 2 freq newsagent (4) - 2 freq newsed (4) - 6 freq newsin (4) - 29 freq newse (4) - 3 freq newsmen (4) - 2 freq news (5) - 473 freq nsne (5) - 1 freq nisbet (5) - 26 freq newance (5) - 4 freq newsnight (5) - 2 freq neast (5) - 1 freq newlot (5) - 5 freq fsnet (5) - 1 freq newt (5) - 1 freq lowsent (5) - 2 freq fawsont (5) - 1 freq lowsint (5) - 1 freq wasnt (5) - 6 freq newsy (5) - 1 freq plusnet (5) - 1 freq |
SoundEx code - N253 naecunt - 6 freq nascent - 3 freq nicomedia - 1 freq naysmith - 3 freq ngender - 1 freq nà iseanta - 1 freq newsnet - 2 freq €™naecunt - 1 freq naismith - 1 freq necntscoze - 1 freq newsandchron - 1 freq nocontextfm - 2 freq nzmtpbq - 1 freq |
MetaPhone code - NSNT nascent - 3 freq nà iseanta - 1 freq newsnet - 2 freq |
NEWSNET |
| Time to execute Levenshtein function - 0.213621 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.384634 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.027922 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.042399 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.000932 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. |