| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nthf (0) - 1 freq gthx (2) - 1 freq 'thy (2) - 3 freq nyhn (2) - 1 freq ngho (2) - 1 freq tho (2) - 1083 freq nehm (2) - 1 freq 'th' (2) - 1 freq tf (2) - 9 freq othe (2) - 4 freq ptyf (2) - 1 freq 'the (2) - 355 freq wth (2) - 1 freq niff (2) - 1 freq nih (2) - 1 freq nahz (2) - 1 freq nknf (2) - 1 freq btf (2) - 8 freq wtf (2) - 14 freq atho (2) - 3 freq th (2) - 2479 freq taf (2) - 1 freq utha (2) - 1 freq 'th- (2) - 1 freq fth (2) - 2 freq |
nthf (0) - 1 freq nith (3) - 12 freq noth (3) - 5 freq neth (3) - 5 freq thof (3) - 4 freq inthe (3) - 2 freq nuh (4) - 4 freq etf (4) - 1 freq hthy (4) - 1 freq rtnf (4) - 1 freq gtf (4) - 2 freq lnth (4) - 1 freq ths (4) - 5 freq tif (4) - 1 freq thn (4) - 1 freq nh (4) - 4 freq thu (4) - 23 freq tthe (4) - 1 freq ith (4) - 2 freq ithe (4) - 14 freq thi (4) - 2576 freq thy (4) - 97 freq naff (4) - 2 freq pfhf (4) - 1 freq 'tha (4) - 16 freq |
SoundEx code - N310 native - 94 freq needfu - 12 freq netbaw - 1 freq nyatf - 1 freq needfu' - 43 freq nitb - 1 freq ntbppp - 1 freq nthf - 1 freq |
MetaPhone code - N0F nthf - 1 freq |
NTHF |
| Time to execute Levenshtein function - 0.219887 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.372167 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.029348 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.038536 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.000963 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. |