A depth-first branch-and-bound algorithm for geocoding historic itinerary tables

Professorship/Faculty: Media Informatics  
Authors: Blank, Daniel; Henrich, Andreas  
Title of the compilation: Proceedings of the 10th Workshop on Geographic Information Retrieval
Corporate Body: 10th Workshop on Geographic Information Retrieval. Burlingame, California — October 31 - November 03, 2016
Publisher Information: New York, NY : ACM
Year of publication: 2016
Pages / Size: Online-Ressource (10 Seiten)
ISBN: 978-1-4503-4588-0
Language(s): English
DOI: 10.1145/3003464.3003467
URL: https://dl.acm.org/citation.cfm?id=3003467
Document Type: Conferenceobject
The work in this paper is motivated from two different perspectives: First, gazetteers as an important data source for Geographic Information Retrieval (GIR) applications often lack historic place name information. More focused historic gazetteers are a far cry from being complete and often specialize only on certain geographic regions or time periods. Second, research on historic route descriptions - so called itineraries - is an important task in many research disciplines such as geography, linguistics, history, religion, or even medicine. This research on historic itineraries is characterized by manual, time-consuming work with only minimalistic IT support through gazetteers and map services.

We address both perspectives and present a depth-first branch-and-bound (DFBnB) algorithm for deducing historic place names and thus the stops of ancient travel routes from itinerary tables. Multiple phonetic and character-based string distances are evaluated when resolving parts of an itinerary first published in 1563.
Peer Reviewed: Ja
International Distribution: Ja
URI: https://fis.uni-bamberg.de/handle/uniba/41653
Release Date: 23. January 2017