Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm

Xiao Zhang, Baojun Qiu, Prasenjit Mitra, Sen Xu, Alexander Klippel, Alan M. MacEachren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Automatic extraction and understanding of human-generated route descriptions have been critical to research aiming at understanding human cognition of geospatial information. Among all research issues involved, road name disambiguation is the most important, because one road name can refer to more than one road. Compared with traditional toponym (place name) disambiguation, the challenges of disambiguating road names in human-generated route description are three-fold: (1) the authors may use a wrong or obsolete road name and the gazetteer may have incomplete or out-of-date information; (2) geographic ontologies often used to disambiguate cities or counties do not exist for roads, due to their linear nature and large spatial extent; (3) knowledge of the co-occurrence of road names and other toponyms are difficult to learn due to the difficulty in automatic processing of natural language and lack of external information source of road entities. In this paper, we solve the problem of road name disambiguation in human-generated route descriptions with noise, i.e. in the presence of wrong names and incomplete gazetteer. We model the problem as an Exact-All-Hop Shortest Path problem on a semi-complete directed k-partite graph, and design an efficient algorithm to solve it. Our disambiguation algorithm successfully handles the noisy data and does not require any extra information sources other than the gazetteer. We compared our algorithm with an existing map-based method. Experiment results show that our algorithm significantly outperforms the existing method.

Original languageEnglish
Title of host publicationFrontiers in Artificial Intelligence and Applications
Pages876-881
Number of pages6
Volume242
DOIs
Publication statusPublished - 2012
Externally publishedYes

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume242
ISSN (Print)09226389

Fingerprint

Ontology
Processing
Experiments

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Zhang, X., Qiu, B., Mitra, P., Xu, S., Klippel, A., & MacEachren, A. M. (2012). Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm. In Frontiers in Artificial Intelligence and Applications (Vol. 242, pp. 876-881). (Frontiers in Artificial Intelligence and Applications; Vol. 242). https://doi.org/10.3233/978-1-61499-098-7-876

Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm. / Zhang, Xiao; Qiu, Baojun; Mitra, Prasenjit; Xu, Sen; Klippel, Alexander; MacEachren, Alan M.

Frontiers in Artificial Intelligence and Applications. Vol. 242 2012. p. 876-881 (Frontiers in Artificial Intelligence and Applications; Vol. 242).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, X, Qiu, B, Mitra, P, Xu, S, Klippel, A & MacEachren, AM 2012, Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm. in Frontiers in Artificial Intelligence and Applications. vol. 242, Frontiers in Artificial Intelligence and Applications, vol. 242, pp. 876-881. https://doi.org/10.3233/978-1-61499-098-7-876
Zhang X, Qiu B, Mitra P, Xu S, Klippel A, MacEachren AM. Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm. In Frontiers in Artificial Intelligence and Applications. Vol. 242. 2012. p. 876-881. (Frontiers in Artificial Intelligence and Applications). https://doi.org/10.3233/978-1-61499-098-7-876
Zhang, Xiao ; Qiu, Baojun ; Mitra, Prasenjit ; Xu, Sen ; Klippel, Alexander ; MacEachren, Alan M. / Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm. Frontiers in Artificial Intelligence and Applications. Vol. 242 2012. pp. 876-881 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{5464895860bb470989c798bb3e36a6cc,
title = "Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm",
abstract = "Automatic extraction and understanding of human-generated route descriptions have been critical to research aiming at understanding human cognition of geospatial information. Among all research issues involved, road name disambiguation is the most important, because one road name can refer to more than one road. Compared with traditional toponym (place name) disambiguation, the challenges of disambiguating road names in human-generated route description are three-fold: (1) the authors may use a wrong or obsolete road name and the gazetteer may have incomplete or out-of-date information; (2) geographic ontologies often used to disambiguate cities or counties do not exist for roads, due to their linear nature and large spatial extent; (3) knowledge of the co-occurrence of road names and other toponyms are difficult to learn due to the difficulty in automatic processing of natural language and lack of external information source of road entities. In this paper, we solve the problem of road name disambiguation in human-generated route descriptions with noise, i.e. in the presence of wrong names and incomplete gazetteer. We model the problem as an Exact-All-Hop Shortest Path problem on a semi-complete directed k-partite graph, and design an efficient algorithm to solve it. Our disambiguation algorithm successfully handles the noisy data and does not require any extra information sources other than the gazetteer. We compared our algorithm with an existing map-based method. Experiment results show that our algorithm significantly outperforms the existing method.",
author = "Xiao Zhang and Baojun Qiu and Prasenjit Mitra and Sen Xu and Alexander Klippel and MacEachren, {Alan M.}",
year = "2012",
doi = "10.3233/978-1-61499-098-7-876",
language = "English",
isbn = "9781614990970",
volume = "242",
series = "Frontiers in Artificial Intelligence and Applications",
pages = "876--881",
booktitle = "Frontiers in Artificial Intelligence and Applications",

}

TY - GEN

T1 - Disambiguating road names in text route descriptions using Exact-All-Hop Shortest Path algorithm

AU - Zhang, Xiao

AU - Qiu, Baojun

AU - Mitra, Prasenjit

AU - Xu, Sen

AU - Klippel, Alexander

AU - MacEachren, Alan M.

PY - 2012

Y1 - 2012

N2 - Automatic extraction and understanding of human-generated route descriptions have been critical to research aiming at understanding human cognition of geospatial information. Among all research issues involved, road name disambiguation is the most important, because one road name can refer to more than one road. Compared with traditional toponym (place name) disambiguation, the challenges of disambiguating road names in human-generated route description are three-fold: (1) the authors may use a wrong or obsolete road name and the gazetteer may have incomplete or out-of-date information; (2) geographic ontologies often used to disambiguate cities or counties do not exist for roads, due to their linear nature and large spatial extent; (3) knowledge of the co-occurrence of road names and other toponyms are difficult to learn due to the difficulty in automatic processing of natural language and lack of external information source of road entities. In this paper, we solve the problem of road name disambiguation in human-generated route descriptions with noise, i.e. in the presence of wrong names and incomplete gazetteer. We model the problem as an Exact-All-Hop Shortest Path problem on a semi-complete directed k-partite graph, and design an efficient algorithm to solve it. Our disambiguation algorithm successfully handles the noisy data and does not require any extra information sources other than the gazetteer. We compared our algorithm with an existing map-based method. Experiment results show that our algorithm significantly outperforms the existing method.

AB - Automatic extraction and understanding of human-generated route descriptions have been critical to research aiming at understanding human cognition of geospatial information. Among all research issues involved, road name disambiguation is the most important, because one road name can refer to more than one road. Compared with traditional toponym (place name) disambiguation, the challenges of disambiguating road names in human-generated route description are three-fold: (1) the authors may use a wrong or obsolete road name and the gazetteer may have incomplete or out-of-date information; (2) geographic ontologies often used to disambiguate cities or counties do not exist for roads, due to their linear nature and large spatial extent; (3) knowledge of the co-occurrence of road names and other toponyms are difficult to learn due to the difficulty in automatic processing of natural language and lack of external information source of road entities. In this paper, we solve the problem of road name disambiguation in human-generated route descriptions with noise, i.e. in the presence of wrong names and incomplete gazetteer. We model the problem as an Exact-All-Hop Shortest Path problem on a semi-complete directed k-partite graph, and design an efficient algorithm to solve it. Our disambiguation algorithm successfully handles the noisy data and does not require any extra information sources other than the gazetteer. We compared our algorithm with an existing map-based method. Experiment results show that our algorithm significantly outperforms the existing method.

UR - http://www.scopus.com/inward/record.url?scp=84878805443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878805443&partnerID=8YFLogxK

U2 - 10.3233/978-1-61499-098-7-876

DO - 10.3233/978-1-61499-098-7-876

M3 - Conference contribution

SN - 9781614990970

VL - 242

T3 - Frontiers in Artificial Intelligence and Applications

SP - 876

EP - 881

BT - Frontiers in Artificial Intelligence and Applications

ER -