| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gaslight (0) - 1 freq gaslicht (1) - 1 freq alight (2) - 3 freq daylight (2) - 22 freq slight (2) - 11 freq sublight (3) - 1 freq 'awright (3) - 4 freq sunlight (3) - 10 freq aright (3) - 7 freq starlight (3) - 1 freq tealight (3) - 1 freq light (3) - 300 freq sleight (3) - 2 freq 'slighty (3) - 1 freq danight (3) - 9 freq gaspit (3) - 5 freq 'alright (3) - 2 freq sawright (3) - 3 freq halliget (3) - 1 freq aaright (3) - 3 freq plight (3) - 11 freq awlwight (3) - 1 freq ash-light (3) - 1 freq twilight (3) - 9 freq allwight (3) - 2 freq |
gaslight (0) - 1 freq gaslicht (2) - 1 freq slight (3) - 11 freq daylight (4) - 22 freq 'slighty (4) - 1 freq sleight (4) - 2 freq alight (4) - 3 freq plight (5) - 11 freq skylight (5) - 1 freq graylicht (5) - 1 freq enlight (5) - 1 freq insight (5) - 5 freq sight (5) - 134 freq flight (5) - 45 freq delight (5) - 33 freq twilight (5) - 9 freq onslaught (5) - 1 freq sunlight (5) - 10 freq slicht (5) - 23 freq sublight (5) - 1 freq gight (5) - 3 freq tealight (5) - 1 freq blight (5) - 5 freq light (5) - 300 freq sleigh (6) - 9 freq |
SoundEx code - G242 giggles - 6 freq googlies - 1 freq goggles - 10 freq ghazals - 1 freq gazelles - 3 freq gaslight - 1 freq gochle-green - 2 freq gisliss - 1 freq gissliss - 1 freq gesellschaft' - 1 freq gisless - 1 freq gaslicht - 1 freq gaclochken - 1 freq |
MetaPhone code - KSLFT gaslight - 1 freq |
GASLIGHT |
| Time to execute Levenshtein function - 0.208644 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.401740 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.036801 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.038377 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.000917 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. |