| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| izzats (0) - 1 freq izzat (1) - 2 freq izzata (1) - 1 freq inlats (2) - 21 freq izat (2) - 1 freq izatt (2) - 2 freq zzat (2) - 1 freq pizzas (2) - 6 freq izzens (2) - 1 freq twats (3) - 2 freq in'ts (3) - 2 freq inlats' (3) - 1 freq iona's (3) - 10 freq irate (3) - 1 freq bizzare (3) - 1 freq ipads (3) - 1 freq boats (3) - 109 freq splats (3) - 3 freq dats (3) - 21 freq pizza (3) - 37 freq i'hans (3) - 1 freq kizzens (3) - 6 freq clats (3) - 1 freq i'pets (3) - 1 freq heats (3) - 3 freq |
izzats (0) - 1 freq izzata (2) - 1 freq izzat (2) - 2 freq zzat (3) - 1 freq izzens (3) - 1 freq izatt (4) - 2 freq zits (4) - 1 freq zzzs (4) - 1 freq inlats (4) - 21 freq zkots (4) - 4 freq izat (4) - 1 freq pizzas (4) - 6 freq izt (5) - 1 freq gizzes (5) - 2 freq brats (5) - 7 freq grats (5) - 1 freq queats (5) - 2 freq flats (5) - 23 freq gizzens (5) - 1 freq zzz's (5) - 1 freq stats (5) - 6 freq lats (5) - 26 freq idults (5) - 1 freq oats (5) - 37 freq fizzers (5) - 1 freq |
SoundEx code - I232 is-'tak - 1 freq is'tak - 1 freq i'geets - 2 freq i'scottish - 2 freq i'stage - 1 freq i'kitchen - 1 freq is-'take - 1 freq izatt's - 1 freq izzats - 1 freq ikdxffiaz - 1 freq isitok - 1 freq icutzgumvc - 1 freq igdgeftqeu - 1 freq isthisab - 7 freq iqodsufqw - 1 freq isthisjustice - 5 freq isdoighliom - 1 freq |
MetaPhone code - ISTS izatt's - 1 freq izzats - 1 freq |
IZZATS |
| Time to execute Levenshtein function - 0.201877 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.371639 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.027436 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.037984 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.000863 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. |