Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
arlinklater (0) - 1 freq linklater (2) - 2 freq translater (4) - 1 freq articulated (4) - 1 freq rainwater (4) - 1 freq findlater (4) - 3 freq articulates (4) - 1 freq articulate (4) - 9 freq rain-watter (5) - 1 freq blinter (5) - 2 freq articulatin (5) - 1 freq rainwatter (5) - 4 freq rinkles (5) - 1 freq sklater (5) - 1 freq administer (5) - 1 freq translate (5) - 37 freq trinkled (5) - 3 freq printer (5) - 2 freq translated (5) - 13 freq drinker (5) - 7 freq alligator (5) - 3 freq linkages (5) - 1 freq wrinkle (5) - 5 freq trickster (5) - 2 freq ordinateir (5) - 5 freq |
arlinklater (0) - 1 freq linklater (3) - 2 freq rainwater (7) - 1 freq arlenefoster (7) - 1 freq findlater (7) - 3 freq translater (7) - 1 freq translator (8) - 12 freq ordinateir (8) - 5 freq ballater (8) - 10 freq tinkler (8) - 2 freq runklit (8) - 1 freq winkler (8) - 1 freq runklet (8) - 1 freq rankamateur (8) - 1 freq rinkle (8) - 2 freq crinklet (8) - 1 freq inkster (8) - 1 freq clinker (8) - 3 freq crinklit (8) - 1 freq blinter (8) - 2 freq linker (8) - 1 freq articulate (8) - 9 freq articulates (8) - 1 freq articulated (8) - 1 freq rinkles (8) - 1 freq |
SoundEx code - A645 airlann's - 1 freq airlan - 174 freq arlene - 13 freq airlan's - 10 freq airland - 2 freq airlann - 20 freq airlannn - 2 freq airline - 1 freq arlenefoster - 1 freq arlinklater - 1 freq airlines - 1 freq |
MetaPhone code - ARLNKLTR arlinklater - 1 freq |
ARLINKLATER |
Time to execute Levenshtein function - 0.502447 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.806296 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.070636 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.078999 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.000911 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. |