Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ninth (0) - 10 freq nint (1) - 4 freq nith (1) - 12 freq linth (1) - 42 freq inty (2) - 21 freq bint (2) - 10 freq sith (2) - 6 freq tint (2) - 218 freq nifty (2) - 3 freq singh (2) - 6 freq filth (2) - 8 freq neath (2) - 4 freq mith (2) - 63 freq into (2) - 193 freq pinsh (2) - 1 freq nirts (2) - 2 freq nih (2) - 1 freq wirth (2) - 89 freq jenth (2) - 1 freq ninety (2) - 33 freq hints (2) - 9 freq tenth (2) - 14 freq dints (2) - 2 freq binch (2) - 6 freq intl (2) - 1 freq |
ninth (0) - 10 freq nint (2) - 4 freq linth (2) - 42 freq nith (2) - 12 freq lenth (3) - 83 freq munth (3) - 8 freq lanth (3) - 3 freq jenth (3) - 1 freq neth (3) - 5 freq nairth (3) - 1 freq tenth (3) - 14 freq inthe (3) - 2 freq ninety (3) - 33 freq neath (3) - 4 freq muinth (3) - 1 freq noth (3) - 5 freq lnth (3) - 1 freq nanto (3) - 2 freq north (3) - 391 freq month (3) - 330 freq girth (4) - 5 freq width (4) - 6 freq nite (4) - 87 freq lint (4) - 17 freq birth (4) - 92 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 - NN0 ninth - 10 freq |
NINTH |
Time to execute Levenshtein function - 0.235453 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.367141 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.027055 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.037861 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.000827 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. |