| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ninety (0) - 33 freq nicety (1) - 1 freq finery (2) - 5 freq piety (2) - 3 freq jinery (2) - 1 freq inemy (2) - 8 freq ginty (2) - 4 freq nighty (2) - 1 freq jinty (2) - 6 freq nicely (2) - 16 freq nint (2) - 4 freq nitty (2) - 1 freq kinely (2) - 4 freq finely (2) - 3 freq minty (2) - 15 freq nine (2) - 229 freq inty (2) - 21 freq nicey (2) - 3 freq sinewy (2) - 1 freq fifety (2) - 1 freq ninth (2) - 10 freq nichty (2) - 3 freq linty (2) - 2 freq nines (2) - 12 freq nickety (2) - 1 freq |
ninety (0) - 33 freq ninetie (2) - 2 freq nint (2) - 4 freq nicety (2) - 1 freq nifty (3) - 3 freq minet (3) - 2 freq minty (3) - 15 freq nine (3) - 229 freq inty (3) - 21 freq nitty (3) - 1 freq linty (3) - 2 freq ginty (3) - 4 freq nines (3) - 12 freq ninth (3) - 10 freq jinty (3) - 6 freq nanto (3) - 2 freq naisty (4) - 9 freq minite (4) - 1 freq net (4) - 87 freq anxiety (4) - 25 freq sinnt (4) - 1 freq tint (4) - 218 freq nesty (4) - 38 freq int (4) - 31 freq vainity (4) - 2 freq |
SoundEx code - N530 ninth - 10 freq ninety - 33 freq named - 50 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 - 33 freq ninetie - 2 freq knawnot - 1 freq nint - 4 freq nanto - 2 freq |
NINETY |
| Time to execute Levenshtein function - 0.172139 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.360419 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.062738 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.045410 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.000868 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. |