| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nint (0) - 4 freq nirt (1) - 1 freq wint (1) - 629 freq bint (1) - 10 freq nina (1) - 1 freq rint (1) - 4 freq fint (1) - 2 freq ning (1) - 1 freq lint (1) - 17 freq nit (1) - 10 freq kint (1) - 58 freq sint (1) - 24 freq pint (1) - 188 freq int (1) - 31 freq hint (1) - 78 freq jint (1) - 6 freq tint (1) - 218 freq nino (1) - 1 freq aint (1) - 13 freq nin (1) - 1 freq mint (1) - 64 freq nine (1) - 234 freq ninth (1) - 10 freq nixt (1) - 473 freq dint (1) - 10 freq |
nint (0) - 4 freq mint (2) - 64 freq ninth (2) - 10 freq nin (2) - 1 freq aint (2) - 13 freq tint (2) - 218 freq nino (2) - 1 freq nixt (2) - 473 freq dint (2) - 10 freq anoint (2) - 1 freq anent (2) - 529 freq ninety (2) - 35 freq nirt (2) - 1 freq nanto (2) - 2 freq jint (2) - 6 freq nine (2) - 234 freq fint (2) - 2 freq ning (2) - 1 freq hint (2) - 78 freq nina (2) - 1 freq wint (2) - 629 freq bint (2) - 10 freq lint (2) - 17 freq rint (2) - 4 freq sint (2) - 24 freq |
SoundEx code - N530 ninth - 10 freq ninety - 35 freq named - 53 freq naehandy - 1 freq newmade - 1 freq namit - 4 freq nimed - 1 freq nummet - 1 freq ninetie - 2 freq nemyt - 1 freq naemed - 1 freq nint - 4 freq nimmt - 1 freq nemmit - 1 freq new-made - 1 freq naemit - 1 freq nanto - 2 freq nemd - 1 freq |
MetaPhone code - NNT ninety - 35 freq ninetie - 2 freq knawnot - 1 freq nint - 4 freq nanto - 2 freq |
NINT |
| Time to execute Levenshtein function - 0.211322 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.342189 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.027580 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.037821 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.001014 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. |