| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glowin (0) - 33 freq glowrin (1) - 6 freq growin (1) - 240 freq glowan (1) - 5 freq glowing (1) - 1 freq blowin (1) - 14 freq glomin (1) - 3 freq glawin (1) - 2 freq 'lowin (1) - 1 freq lowin (1) - 31 freq slowin (1) - 14 freq flowin (1) - 22 freq mowin (2) - 2 freq gloir (2) - 1 freq slowing (2) - 2 freq govin (2) - 9 freq louin (2) - 1 freq lowdin (2) - 1 freq grouwin (2) - 1 freq plewin (2) - 1 freq gopin (2) - 1 freq lovin (2) - 52 freq knowin (2) - 56 freq slowan (2) - 1 freq plouin (2) - 13 freq |
glowin (0) - 33 freq glowan (1) - 5 freq glawin (1) - 2 freq lowin (2) - 31 freq flowin (2) - 22 freq slowin (2) - 14 freq 'lowin (2) - 1 freq glomin (2) - 3 freq growin (2) - 240 freq glowing (2) - 1 freq glowrin (2) - 6 freq blowin (2) - 14 freq goodwin (3) - 7 freq gloamin (3) - 76 freq glowerin (3) - 61 freq glow (3) - 51 freq blown (3) - 14 freq gloatin (3) - 5 freq flowen (3) - 2 freq glowed (3) - 5 freq gnawin (3) - 2 freq glarin (3) - 7 freq lowan (3) - 6 freq lown (3) - 59 freq gawin (3) - 26 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 - KLWN glowin - 33 freq clawin - 10 freq glawin - 2 freq glowan - 5 freq |
GLOWIN |
| Time to execute Levenshtein function - 0.213432 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.384966 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.028661 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.040598 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.000933 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. |