Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

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

Publication

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

Blank, Daniel; Henrich, Andreas (2016): A depth-first branch-and-bound algorithm for geocoding historic itinerary tables, in: Chris Jones und Ross Purves (Hrsg.), GIR ’16 : Proceedings of the 10th Workshop on Geographic Information Retrieval, New York, NY: ACM, S. 1–10, doi: 10.1145/3003464.3003467.

Details

Faculty/Chair
Author
Blank, Daniel
Title of the compilation
GIR '16 : Proceedings of the 10th Workshop on Geographic Information Retrieval
Editors
Jones, Chris
Purves, Ross
Conference
10th Workshop on Geographic Information Retrieval, October 31 - November 03, 2016, Burlingame, California
Publisher Information
ACM : New York, NY
Year of publication
2016
Issue
3
ISBN
978-1-4503-4588-0
Language
English
DOI
URL
Abstract

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.

Keywords
itinerary resolution
historic place name disambiguation
geocoding
depth-first branch-and-bound
gazetteer enrichment
Peer Reviewed
yes
International Distribution
yes
Type
Conferenceobject
URI
Activation date
2017-01-24, 2017-01-24

Permalink: https://fis.uni-bamberg.de/handle/uniba/41653 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-15

Restricted read-only access: login, editing and submission are temporarily disabled.