| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isd (0) - 1 freq iud (1) - 1 freq isa (1) - 26 freq iid (1) - 1 freq asd (1) - 1 freq ise (1) - 2 freq isg (1) - 1 freq lsd (1) - 2 freq vsd (1) - 1 freq esd (1) - 1 freq ish (1) - 10 freq is- (1) - 6 freq iss (1) - 480 freq ird (1) - 1 freq is' (1) - 2 freq i'd (1) - 422 freq ixd (1) - 1 freq sd (1) - 7 freq id (1) - 597 freq usd (1) - 1 freq isp (1) - 3 freq isn (1) - 20 freq is (1) - 18321 freq ssd (1) - 12 freq ist (1) - 11 freq |
isd (0) - 1 freq sd (1) - 7 freq esd (1) - 1 freq asd (1) - 1 freq usd (1) - 1 freq uised (2) - 281 freq sod (2) - 22 freq ist (2) - 11 freq aised (2) - 6 freq syd (2) - 1 freq csd (2) - 11 freq asda (2) - 32 freq yised (2) - 4 freq used (2) - 682 freq sed (2) - 175 freq sad (2) - 205 freq asyd (2) - 1 freq siad (2) - 1 freq sud (2) - 92 freq is (2) - 18321 freq iside (2) - 1 freq sid (2) - 19 freq ssd (2) - 12 freq lsd (2) - 2 freq vsd (2) - 1 freq |
SoundEx code - I230 iced - 14 freq izzat - 2 freq is-'the - 1 freq ight - 1 freq is't - 47 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 - 47 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 |
ISD |
| Time to execute Levenshtein function - 0.397714 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.782869 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.085724 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.098358 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.000898 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. |