| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| izt (0) - 1 freq itt (1) - 2 freq it (1) - 32760 freq ist (1) - 11 freq izi (1) - 2 freq int (1) - 31 freq izx (1) - 1 freq ize (1) - 1 freq nzt (1) - 1 freq iz' (1) - 2 freq izat (1) - 1 freq iz (1) - 403 freq qzt (1) - 1 freq iht (1) - 1 freq irt (1) - 3 freq zt (1) - 2 freq ict (1) - 1 freq igs (2) - 1 freq net (2) - 87 freq yt (2) - 12 freq biit (2) - 1 freq tut (2) - 67 freq qz (2) - 1 freq 'z' (2) - 1 freq 'at (2) - 357 freq |
izt (0) - 1 freq zt (1) - 2 freq izat (1) - 1 freq iht (2) - 1 freq irt (2) - 3 freq iz (2) - 403 freq ict (2) - 1 freq zto (2) - 1 freq zit (2) - 2 freq zat (2) - 11 freq qzt (2) - 1 freq iz' (2) - 2 freq it (2) - 32760 freq itt (2) - 2 freq izi (2) - 2 freq ist (2) - 11 freq ize (2) - 1 freq int (2) - 31 freq izx (2) - 1 freq nzt (2) - 1 freq dat (3) - 1391 freq not (3) - 712 freq ozg (3) - 1 freq ft (3) - 19 freq riyt (3) - 3 freq |
SoundEx code - I230 iced - 14 freq izzat - 2 freq is-'the - 1 freq ight - 1 freq is't - 48 freq 'is't - 1 freq iste - 1 freq i-ight - 1 freq ist - 11 freq iiokket - 1 freq iikit - 1 freq izat - 1 freq issued - 6 freq is-the - 1 freq ict - 1 freq i'stew - 1 freq i'cat - 1 freq i'settee - 1 freq i'shade - 5 freq iside - 1 freq izatt - 2 freq ischewed - 1 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq ixd - 1 freq izt - 1 freq isd - 1 freq iogjkota - 1 freq iscot - 1 freq isaidaye - 2 freq ikcd - 1 freq |
MetaPhone code - IST iced - 14 freq izzat - 2 freq is't - 48 freq 'is't - 1 freq iste - 1 freq ist - 11 freq izat - 1 freq issued - 6 freq i'stew - 1 freq i'settee - 1 freq iside - 1 freq izatt - 2 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq izt - 1 freq isd - 1 freq |
IZT |
| Time to execute Levenshtein function - 0.204055 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.326249 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.027611 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.036658 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. |