| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gilliland (0) - 2 freq gillian (2) - 7 freq gilliland's (2) - 1 freq gillians (2) - 1 freq failliand (3) - 2 freq gillan (3) - 5 freq lillian (3) - 1 freq milligan (3) - 4 freq ellisland (3) - 4 freq gallivant (3) - 1 freq gippsland (3) - 1 freq billiard (3) - 1 freq millan (4) - 1 freq island (4) - 131 freq ireland (4) - 145 freq willans (4) - 1 freq gillies (4) - 7 freq brilliant (4) - 161 freq girlfiend (4) - 1 freq lawland (4) - 20 freq pilling (4) - 1 freq millitary (4) - 1 freq diallan (4) - 1 freq gallant (4) - 3 freq widland (4) - 10 freq |
gilliland (0) - 2 freq gillians (4) - 1 freq gilliland's (4) - 1 freq gillian (4) - 7 freq clelland (5) - 2 freq gallivant (5) - 1 freq ellisland (5) - 4 freq failliand (5) - 2 freq gillan (5) - 5 freq lillian (5) - 1 freq grilling (6) - 1 freq gullane (6) - 2 freq millpond (6) - 1 freq lamland (6) - 1 freq ferlieland (6) - 2 freq holland (6) - 17 freq gallivanted (6) - 2 freq galilean (6) - 2 freq gellan (6) - 7 freq lapland (6) - 3 freq galileans (6) - 3 freq gallopan (6) - 1 freq falkland (6) - 6 freq gairland (6) - 1 freq gillon (6) - 1 freq |
SoundEx code - G445 gilliland - 2 freq galileeans - 1 freq galileans - 3 freq galilean - 2 freq gilliland's - 1 freq |
MetaPhone code - JLLNT gilliland - 2 freq |
GILLILAND |
| Time to execute Levenshtein function - 0.220440 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.379324 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.027617 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.075908 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.001113 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. |