| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noticin (0) - 20 freq noticing (1) - 3 freq notican (1) - 1 freq notin (2) - 6 freq nottin (2) - 2 freq anoticing (2) - 1 freq noticed (2) - 227 freq enticin (2) - 1 freq notice (2) - 175 freq voicin (2) - 1 freq notion (2) - 223 freq noisin (2) - 2 freq nothin (2) - 194 freq notict (2) - 1 freq noticd (2) - 1 freq notices (2) - 16 freq noticet (2) - 1 freq nottit (3) - 3 freq rottin (3) - 10 freq ootlin (3) - 12 freq origin (3) - 24 freq icin (3) - 10 freq bouncin (3) - 12 freq notnixon (3) - 2 freq booncin (3) - 10 freq |
noticin (0) - 20 freq notican (1) - 1 freq enticin (2) - 1 freq noticing (2) - 3 freq notict (3) - 1 freq nothin (3) - 194 freq noticet (3) - 1 freq notion (3) - 223 freq notices (3) - 16 freq noticd (3) - 1 freq nottin (3) - 2 freq notin (3) - 6 freq noticed (3) - 227 freq anoticing (3) - 1 freq notice (3) - 175 freq nuthin (4) - 66 freq nation (4) - 144 freq nettin (4) - 6 freq notten (4) - 1 freq ticino (4) - 1 freq notch (4) - 6 freq emoticon (4) - 3 freq botcoin (4) - 1 freq vatican (4) - 1 freq optician (4) - 4 freq |
SoundEx code - N325 noticin - 20 freq nidgin - 3 freq nudgin - 4 freq nudge-nudge - 1 freq nutkin - 1 freq notican - 1 freq needsna - 2 freq noticing - 3 freq naedugnoo - 1 freq nedknwmy - 1 freq ndwkinmriy - 1 freq nowthisnews - 2 freq noitisnae - 1 freq |
MetaPhone code - NTSN noticin - 20 freq needsna - 2 freq noitisnae - 1 freq |
NOTICIN |
| Time to execute Levenshtein function - 0.178812 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.365711 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.027105 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.037202 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.000877 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. |