| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gillon (0) - 1 freq gillan (1) - 5 freq dillon (1) - 2 freq gallon (1) - 13 freq villon (1) - 1 freq willox (2) - 1 freq gills (2) - 8 freq zillion (2) - 1 freq gilpin (2) - 1 freq will'n (2) - 3 freq killin (2) - 61 freq gibbon (2) - 10 freq billo (2) - 1 freq gallons (2) - 14 freq willan (2) - 5 freq fillin (2) - 63 freq gilli (2) - 3 freq sillos (2) - 1 freq wilton (2) - 1 freq gillis (2) - 1 freq killan (2) - 2 freq pilton (2) - 1 freq million (2) - 156 freq ellon (2) - 19 freq gillian (2) - 7 freq |
gillon (0) - 1 freq gallon (1) - 13 freq gillan (1) - 5 freq gellan (2) - 7 freq gillian (2) - 7 freq dillon (2) - 2 freq villon (2) - 1 freq billion (3) - 34 freq willin (3) - 59 freq giltin (3) - 2 freq killen (3) - 4 freq pillion (3) - 1 freq hallon (3) - 1 freq tillin (3) - 3 freq millan (3) - 1 freq willen (3) - 4 freq -gellon (3) - 1 freq millin (3) - 6 freq grillin (3) - 2 freq gullane (3) - 2 freq gollop (3) - 9 freq gillie (3) - 2 freq rollon (3) - 1 freq fillan (3) - 8 freq gill (3) - 3 freq |
SoundEx code - G450 glen - 166 freq glum - 10 freq gowlin - 15 freq glowin - 33 freq gloam - 5 freq gloom - 32 freq gloomy - 6 freq glean - 5 freq glaum - 4 freq glim - 8 freq gallon - 13 freq gillian - 7 freq glam - 3 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 glame - 1 freq gillon - 1 freq glenn - 1 freq gollum - 1 freq glenoe - 1 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 gillian - 7 freq 'jolene' - 1 freq gellan - 7 freq 'julian - 1 freq gillon - 1 freq jylin - 1 freq gealin - 1 freq -gellon - 1 freq gillan - 5 freq jolene - 1 freq |
GILLON |
| Time to execute Levenshtein function - 0.216267 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.403734 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.028647 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.053430 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.000901 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. |