A couple of minutes ago I found the search in the CKM does an exact string matching search. I would suggest to make a search based on match weight using something like Levenshtein distance that is more “typo proof”.
Thanks for the suggestion.
We actually used Levensthein in CKM’s predessor tool (the Archeype Finder).
It required some finetuning to find good matches, but then worked quite nicely.
Completely different technology now, but it may indeed be worth enabling something like this again.
It may be possible to get some suggestions on possible matches (Did you mean “Glasgow”?)
I need to check out the technical constraints a bit, but thank you again for your suggestion