| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glenmanna (0) - 2 freq glentan (3) - 1 freq gleann (3) - 1 freq gleaman (3) - 1 freq glenjaun (3) - 2 freq glenfinnan (3) - 1 freq lemans (4) - 1 freq glenfarg (4) - 4 freq gloaman (4) - 2 freq glentin (4) - 34 freq lenna (4) - 1 freq glenlyon (4) - 6 freq gwenmairi (4) - 1 freq hermann (4) - 4 freq glesgan (4) - 1 freq german (4) - 160 freq gleans (4) - 1 freq manna (4) - 12 freq penann (4) - 1 freq alanna (4) - 2 freq glean (4) - 5 freq leman (4) - 3 freq glenda's (4) - 1 freq glendale (4) - 3 freq gehenna (4) - 1 freq |
glenmanna (0) - 2 freq glenfinnan (5) - 1 freq gleaman (5) - 1 freq glenjaun (5) - 2 freq glentan (5) - 1 freq gleann (5) - 1 freq glenkens (6) - 2 freq glendonnen (6) - 1 freq glentin- (6) - 1 freq glencin (6) - 1 freq gleamin (6) - 21 freq gleaming (6) - 2 freq glenburn (6) - 2 freq glencairn (6) - 4 freq klinsmann (6) - 3 freq glengoyne (6) - 1 freq gleanins (6) - 1 freq glentin (6) - 34 freq glenmcl (6) - 1 freq glenlyon (6) - 6 freq glenn (6) - 1 freq gloaman (6) - 2 freq glintan (6) - 1 freq greenmansean (7) - 1 freq glunchin (7) - 1 freq |
SoundEx code - G455 gloamin - 76 freq gleamin - 21 freq gloamin-time - 2 freq gloaming-faw - 1 freq gleaming - 2 freq gloaming - 5 freq gloamin's - 3 freq glammin - 3 freq gloaman-faw - 1 freq gleenin' - 1 freq glenmanna - 2 freq glomin - 3 freq gloaman - 2 freq glæmin - 1 freq 'gloamin' - 1 freq glaumin - 1 freq gullie-men - 1 freq glimmin - 1 freq gilmanscleuch - 5 freq glimin - 1 freq gleanins - 1 freq gleaman - 1 freq €œgloaming - 1 freq “gloamin” - 1 freq glamin' - 1 freq |
MetaPhone code - KLNMN glenmanna - 2 freq |
GLENMANNA |
| Time to execute Levenshtein function - 0.289994 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.505411 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.029023 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.039056 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.000885 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. |