| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noo-hatit (0) - 1 freq nominatit (3) - 1 freq fooshtit (3) - 1 freq ootdatit (3) - 1 freq noo-bit (3) - 1 freq bloatit (4) - 3 freq dominatit (4) - 1 freq annotatit (4) - 1 freq now-at (4) - 1 freq noo-but (4) - 2 freq tootit (4) - 1 freq nor-wast (4) - 2 freq rooshtie (4) - 1 freq neo-nazis (4) - 1 freq loohit (4) - 1 freq narratit (4) - 1 freq isolatit (4) - 8 freq nooat (4) - 1 freq fooshtie (4) - 5 freq nor-aist (4) - 3 freq hatit (4) - 15 freq northart (4) - 3 freq doonhertit (4) - 1 freq floatit (4) - 7 freq notit (4) - 13 freq |
noo-hatit (0) - 1 freq noo-bit (5) - 1 freq nominatit (5) - 1 freq fooshtit (5) - 1 freq nottit (6) - 3 freq -ratit (6) - 2 freq hatit (6) - 15 freq notit (6) - 13 freq hootit (6) - 2 freq nochtie (6) - 3 freq narratit (6) - 1 freq noo-but (6) - 2 freq negatit (6) - 1 freq ootdatit (6) - 1 freq doon-hertit (6) - 3 freq annotatit (6) - 1 freq negotiatit (6) - 2 freq nae-airtit (6) - 1 freq hichtit (7) - 1 freq dightit (7) - 1 freq tichtit (7) - 1 freq hautit (7) - 2 freq eontentit (7) - 1 freq ainimatit (7) - 1 freq hatt (7) - 1 freq |
SoundEx code - N330 noddit - 122 freq needit - 167 freq nodded - 71 freq noted - 23 freq needed - 150 freq notit - 13 freq nit-wit - 1 freq neidit - 1 freq noadded - 2 freq needet - 2 freq noddet - 1 freq notted - 1 freq nottit - 3 freq neded - 3 freq €™nittit - 1 freq nedeit - 1 freq nittet - 1 freq noo-hatit - 1 freq notid - 1 freq needid - 1 freq |
MetaPhone code - NHTT noo-hatit - 1 freq |
NOO-HATIT |
| Time to execute Levenshtein function - 0.248381 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.407478 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.027436 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.038655 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.000933 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. |