| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inlaik (0) - 1 freq inlaid (1) - 3 freq inlack (1) - 1 freq inlaiks (1) - 1 freq inlat (2) - 32 freq i'lark (2) - 1 freq slaik (2) - 1 freq unlaek (2) - 3 freq inlats (2) - 21 freq sklaik (2) - 2 freq laik (2) - 62 freq ingait (2) - 8 freq inla (2) - 1 freq entaik (2) - 1 freq inlaikit (2) - 1 freq glaik (2) - 3 freq inlan (2) - 1 freq intak (2) - 2 freq inleid (2) - 1 freq blaik (2) - 80 freq intack (2) - 1 freq unlik (2) - 1 freq inland (2) - 5 freq claik (2) - 24 freq snaik (2) - 2 freq |
inlaik (0) - 1 freq unlik (2) - 1 freq inlaiks (2) - 1 freq inlack (2) - 1 freq inlaid (2) - 3 freq unlaek (2) - 3 freq glaik (3) - 3 freq blaik (3) - 80 freq inlan (3) - 1 freq inleid (3) - 1 freq claik (3) - 24 freq onalik (3) - 1 freq unlike (3) - 43 freq inlaikit (3) - 1 freq intak (3) - 2 freq entaik (3) - 1 freq unalik (3) - 3 freq laik (3) - 62 freq inlat (3) - 32 freq slaik (3) - 1 freq inla (3) - 1 freq nail (4) - 46 freq onli (4) - 40 freq blaak (4) - 4 freq laek (4) - 383 freq |
SoundEx code - I542 in-laaw's - 1 freq in-laws - 2 freq inlaikit - 1 freq inlack - 1 freq inlaik - 1 freq inlaiks - 1 freq inlklin - 1 freq inhales - 1 freq imleyqddnp - 1 freq iainmalzer - 1 freq |
MetaPhone code - INLK inlack - 1 freq inlaik - 1 freq |
INLAIK |
| Time to execute Levenshtein function - 0.322089 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.519440 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.063932 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.039702 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.000871 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. |