| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| naitves (0) - 1 freq waives (2) - 1 freq naithen (2) - 1 freq naimes (2) - 5 freq naither (2) - 63 freq laithes (2) - 1 freq naiter (2) - 2 freq nairaes (2) - 1 freq nives (2) - 2 freq naive (2) - 11 freq naityer (2) - 1 freq neives (2) - 10 freq nieves (2) - 15 freq sairves (2) - 1 freq natives (2) - 13 freq naitrel (2) - 3 freq nasties (2) - 1 freq naitter (2) - 1 freq cairves (2) - 2 freq eaves (3) - 2 freq jaimes (3) - 4 freq naether (3) - 5 freq leives (3) - 3 freq waitress (3) - 8 freq navies (3) - 1 freq |
naitves (0) - 1 freq natives (2) - 13 freq nives (3) - 2 freq nieves (3) - 15 freq neives (3) - 10 freq naters (4) - 1 freq navies (4) - 1 freq notes (4) - 117 freq native (4) - 94 freq waives (4) - 1 freq nerves (4) - 44 freq naturs (4) - 1 freq taves (4) - 4 freq entities (4) - 15 freq nutties (4) - 1 freq nits (4) - 21 freq nat's (4) - 1 freq unites (4) - 4 freq noties (4) - 2 freq nats (4) - 2 freq nit's (4) - 1 freq nairaes (4) - 1 freq naive (4) - 11 freq naiter (4) - 2 freq laithes (4) - 1 freq |
SoundEx code - N312 notebook - 14 freq note-book - 6 freq notebooks - 1 freq notebuik - 1 freq natives - 13 freq nottbook - 1 freq nott-book - 1 freq notebeuk - 1 freq ndpbs - 3 freq notification - 1 freq notifications - 4 freq notebuiks - 1 freq naitves - 1 freq |
MetaPhone code - NTFS natives - 13 freq naitves - 1 freq |
NAITVES |
| Time to execute Levenshtein function - 0.225270 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.462813 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.062841 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.043024 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.001025 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. |