| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gillian (0) - 5 freq gillan (1) - 5 freq lillian (1) - 1 freq gillians (1) - 1 freq killin (2) - 61 freq killan (2) - 2 freq gilpin (2) - 1 freq willin (2) - 58 freq millin (2) - 6 freq gellan (2) - 7 freq willan (2) - 5 freq million (2) - 155 freq pillion (2) - 1 freq dillan (2) - 1 freq fillin (2) - 59 freq dillion (2) - 3 freq billion (2) - 34 freq gillon (2) - 1 freq lilian (2) - 2 freq gilli (2) - 3 freq lillias (2) - 1 freq gillie (2) - 2 freq gilzean (2) - 1 freq william (2) - 238 freq tillin (2) - 3 freq |
gillian (0) - 5 freq gillan (1) - 5 freq gillon (2) - 1 freq gellan (2) - 7 freq gillians (2) - 1 freq lillian (2) - 1 freq tillin (3) - 3 freq gillis (3) - 1 freq gallon (3) - 12 freq gilzean (3) - 1 freq millan (3) - 1 freq gillie (3) - 2 freq gillies (3) - 7 freq galilean (3) - 2 freq giltin (3) - 2 freq grillin (3) - 1 freq gullane (3) - 2 freq fillan (3) - 8 freq zillion (3) - 1 freq gilli (3) - 3 freq millin (3) - 6 freq million (3) - 155 freq willin (3) - 58 freq gilpin (3) - 1 freq killin (3) - 61 freq |
SoundEx code - G450 glen - 162 freq glum - 10 freq gowlin - 15 freq glowin - 28 freq gloam - 5 freq gloom - 31 freq gloomy - 6 freq glean - 4 freq glaum - 4 freq glim - 8 freq gallon - 12 freq galeen - 1 freq gowlhin - 1 freq glawin - 2 freq gale-eyn - 1 freq gleam - 7 freq glowan - 5 freq gowlan - 1 freq gullane - 2 freq gloum - 1 freq glen' - 1 freq glaim - 4 freq golem - 1 freq gaulum - 1 freq gaulum' - 2 freq gellan - 7 freq gillian - 5 freq glame - 1 freq gillon - 1 freq glenn - 1 freq gollum - 1 freq glenoe - 1 freq glam - 2 freq gealin - 1 freq -gellon - 1 freq gleann - 1 freq gillan - 5 freq gloom - 1 freq |
MetaPhone code - JLN julian - 6 freq jeelin - 5 freq jawline - 2 freq 'jolene' - 1 freq gellan - 7 freq gillian - 5 freq 'julian - 1 freq gillon - 1 freq jylin - 1 freq gealin - 1 freq -gellon - 1 freq gillan - 5 freq jolene - 1 freq |
GILLIAN |
| Time to execute Levenshtein function - 0.191926 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.332234 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.027067 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.037480 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.000864 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. |