| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gilmanscleuch (0) - 5 freq shairnscleuch (5) - 1 freq wolfcleuch (6) - 7 freq langeneuch (6) - 1 freq insolence (7) - 4 freq aneuch (7) - 31 freq dismantle (7) - 1 freq glenluce (7) - 1 freq kilmarnockfc (7) - 3 freq glances (7) - 13 freq villanelle (7) - 6 freq glanced (7) - 27 freq manacled (7) - 1 freq glansed (7) - 1 freq buccleuch (7) - 9 freq gillianritch (7) - 1 freq romansch (7) - 4 freq gilliansproule (7) - 1 freq kilmarnockwfc (7) - 1 freq cranreuch (7) - 14 freq howcleuch (7) - 4 freq gilmilnscroft (7) - 3 freq glance (7) - 47 freq camsheuch (7) - 2 freq gilravitch (7) - 1 freq |
gilmanscleuch (0) - 5 freq shairnscleuch (8) - 1 freq wolfcleuch (10) - 7 freq glaschu (11) - 2 freq gillianritch (11) - 1 freq gilmilnscroft (11) - 3 freq glenluce (11) - 1 freq gollnisch (11) - 1 freq romansch (11) - 4 freq langeneuch (11) - 1 freq glendarroch (12) - 1 freq gulsoch (12) - 2 freq glenwelsh (12) - 2 freq maniech (12) - 1 freq ballindalloch (12) - 1 freq gollach (12) - 4 freq muntloch (12) - 1 freq half-scotch (12) - 1 freq glunch (12) - 4 freq galshach (12) - 1 freq glenshee (12) - 11 freq loincloth (12) - 1 freq glengarioch (12) - 2 freq galiniche (12) - 1 freq glammach (12) - 3 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 - JLMNSKLX gilmanscleuch - 5 freq |
GILMANSCLEUCH |
| Time to execute Levenshtein function - 0.497843 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 - 1.180405 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.088660 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.113690 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.001272 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. |