Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
netflix (0) - 16 freq €˜netflix (2) - 1 freq nettlin (2) - 1 freq ethlie (3) - 1 freq newlie (3) - 1 freq reflex (3) - 2 freq betwix (3) - 2 freq nellie (3) - 42 freq nettles (3) - 23 freq eflir (3) - 1 freq detdlie (3) - 1 freq nettle (3) - 8 freq kettlie (3) - 3 freq nestlin (3) - 2 freq nflx (3) - 1 freq helix (3) - 7 freq setlin (3) - 1 freq rettlin (3) - 2 freq nettin (3) - 6 freq felix (3) - 1 freq fettlin (3) - 6 freq natalie (3) - 7 freq kettlin (3) - 3 freq nettled (3) - 1 freq ettlit (3) - 3 freq |
netflix (0) - 16 freq nettlin (4) - 1 freq nflx (4) - 1 freq €˜netflix (4) - 1 freq natalie (5) - 7 freq influx (5) - 1 freq nettles (5) - 23 freq nettled (5) - 1 freq reflex (5) - 2 freq nettle (5) - 8 freq felix (5) - 1 freq stiflin (6) - 4 freq nate-lik (6) - 1 freq naetril (6) - 1 freq neteral (6) - 1 freq nattled (6) - 1 freq teflon (6) - 2 freq natale (6) - 1 freq nately (6) - 2 freq nfl (6) - 2 freq flax (6) - 3 freq natal (6) - 2 freq flex (6) - 1 freq ntx (6) - 1 freq neatly (6) - 26 freq |
SoundEx code - N314 netflix - 16 freq notably - 6 freq 'notable - 1 freq notable - 5 freq needful - 4 freq €˜netflix - 1 freq notability - 1 freq notplanning - 1 freq |
MetaPhone code - NTFLKS netflix - 16 freq €˜netflix - 1 freq |
NETFLIX |
Time to execute Levenshtein function - 0.226554 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.432707 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.033118 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.040581 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.001160 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. |