| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ikdxffiaz (0) - 1 freq india (5) - 21 freq daffins (5) - 1 freq daffiks (5) - 1 freq iffa (5) - 1 freq daffie- (5) - 1 freq kaffir (5) - 2 freq kffi (5) - 1 freq india' (5) - 1 freq idaias (5) - 6 freq daffies (5) - 4 freq daffin (5) - 18 freq doffin (5) - 2 freq skiffies (5) - 2 freq skliffin (5) - 3 freq indian (5) - 34 freq skiffins (5) - 2 freq skiffin (5) - 5 freq skiffie (5) - 7 freq kdaz (5) - 1 freq kxiac (5) - 1 freq skaffie (5) - 1 freq koffie (5) - 1 freq skuffin (5) - 1 freq idaia (5) - 27 freq |
ikdxffiaz (0) - 1 freq doffin (8) - 2 freq daffin (8) - 18 freq daffik (8) - 2 freq ikokdlfaz (8) - 1 freq koffie (8) - 1 freq kdaz (8) - 1 freq daffies (8) - 4 freq kffi (8) - 1 freq daffie- (8) - 1 freq kaffir (8) - 2 freq kdz (9) - 1 freq duffs (9) - 2 freq uktwfz (9) - 1 freq doff (9) - 3 freq kxf (9) - 1 freq doffed (9) - 3 freq kidz (9) - 1 freq ujaxfaez (9) - 1 freq diffs (9) - 2 freq deff (9) - 1 freq daffs (9) - 3 freq duffy (9) - 52 freq daffed (9) - 3 freq daffys (9) - 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 - IKTKSFS ikdxffiaz - 1 freq |
IKDXFFIAZ |
| Time to execute Levenshtein function - 0.219175 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.369045 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.031268 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.039424 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.000856 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. |