| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itv (0) - 4 freq iti (1) - 1 freq vtv (1) - 1 freq ibv (1) - 2 freq itz (1) - 2 freq itn (1) - 2 freq utv (1) - 1 freq tv (1) - 212 freq stv (1) - 12 freq ite (1) - 3 freq itc (1) - 1 freq i'v (1) - 7 freq ivv (1) - 1 freq ith (1) - 2 freq btv (1) - 1 freq mtv (1) - 2 freq it' (1) - 32 freq it- (1) - 5 freq its (1) - 3337 freq itt (1) - 2 freq iv (1) - 149 freq ita (1) - 10 freq atv (1) - 1 freq it (1) - 33315 freq stc (2) - 1 freq |
itv (0) - 4 freq tv (1) - 212 freq atv (1) - 1 freq utv (1) - 1 freq it' (2) - 32 freq mtv (2) - 2 freq btv (2) - 1 freq it- (2) - 5 freq its (2) - 3337 freq itt (2) - 2 freq ith (2) - 2 freq it (2) - 33315 freq iv (2) - 149 freq ita (2) - 10 freq itz (2) - 2 freq ibv (2) - 2 freq iti (2) - 1 freq ivv (2) - 1 freq itn (2) - 2 freq vtv (2) - 1 freq i'v (2) - 7 freq stv (2) - 12 freq itc (2) - 1 freq ite (2) - 3 freq eita (3) - 1 freq |
SoundEx code - I310 itif - 1 freq itup - 1 freq itv - 4 freq itfy - 1 freq |
MetaPhone code - ITF itif - 1 freq itv - 4 freq itfy - 1 freq |
ITV |
| Time to execute Levenshtein function - 0.216646 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.374438 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.029916 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.041625 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.001061 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. |