| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glenarf (0) - 1 freq glenarm (1) - 3 freq glenure (2) - 7 freq glenfarg (2) - 4 freq glenore (2) - 6 freq plenary (2) - 2 freq glert (3) - 1 freq gleans (3) - 1 freq gleer (3) - 1 freq leaf (3) - 40 freq glar (3) - 7 freq lena (3) - 2 freq glentit (3) - 8 freq glendale (3) - 3 freq glency (3) - 1 freq glengarry (3) - 2 freq gleams (3) - 2 freq plena (3) - 2 freq glenoe (3) - 1 freq leonard (3) - 63 freq glenty (3) - 1 freq grenade (3) - 8 freq gear (3) - 237 freq leary (3) - 1 freq gleam (3) - 7 freq |
glenarf (0) - 1 freq glenarm (2) - 3 freq glenore (3) - 6 freq glenure (3) - 7 freq glenfarg (4) - 4 freq plenary (4) - 2 freq glean (5) - 5 freq granary (5) - 1 freq glare (5) - 15 freq gnar (5) - 1 freq glenelg (5) - 1 freq clontarf (5) - 8 freq glentin (5) - 34 freq glent (5) - 30 freq glence (5) - 4 freq genert (5) - 1 freq glenesk (5) - 1 freq alienar (5) - 3 freq glen's (5) - 4 freq genre (5) - 9 freq glencoe (5) - 6 freq gener (5) - 1 freq lunar (5) - 1 freq gleann (5) - 1 freq garnard (5) - 1 freq |
SoundEx code - G456 glamourie - 20 freq glamourie-nae - 1 freq glamorie - 1 freq glamour - 29 freq glenmorangie - 2 freq glimmered - 5 freq glimmer - 17 freq glamourised - 1 freq glamorous - 8 freq glimmers - 1 freq glenarm - 3 freq glimmerin - 4 freq glimer - 1 freq glaumourie - 1 freq glenrothes - 2 freq glamourous - 1 freq glenarf - 1 freq glammery - 1 freq glenwhargen's - 1 freq glenore - 6 freq glimro - 1 freq glenorchy - 3 freq glamour's - 1 freq gilmour - 4 freq glamrock - 1 freq glaumer - 1 freq gilmorehill - 1 freq glamourit - 1 freq glenwhargen - 1 freq glaumrie - 5 freq glenure - 7 freq glimmrin - 3 freq glimniriri - 1 freq glimmert - 2 freq glamorchan - 1 freq glimmeran - 1 freq gilmerton - 1 freq glamur - 1 freq glamurpoos - 1 freq gulmore - 1 freq gillianritch - 1 freq |
MetaPhone code - KLNRF glenarf - 1 freq |
GLENARF |
| Time to execute Levenshtein function - 0.521734 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.707974 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.062934 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.040323 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.000921 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. |