Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 30 June 2010

Toponym Disambiguation by Arborescent Relationships

Imene Bensalem & Mohamed-Khireddine Kholladi

Journal of Computer Science, Volume 6, Issue 6, pp. 653–659 · doi.org/10.3844/jcssp.2010.653.659

7,667 accesses5,781 downloads15 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem statement: The way of referring to a place in the geographical space can be formal, based on the spatial coordinates, or informal, which we use in natural language by using toponyms (place names). A toponym can represent several geographical places. This ambiguity made problematic its conversion towards a unique formal representation. Toponym disambiguation in text is the task of assigning a unique location to an ambiguous place name in a given textual context. Approach: Several toponym disambiguation heuristics assumed a geographical proximity between the toponyms of the same context. This proximity can be in terms of spatial distance or in terms of arborsecent relationships, i.e., proximity in the hierarchical tree of the world places. This study presented a new toponym disambiguation heuristic in text based on the quantification of the arborescent proximity between toponyms. This quantification was done by a new measure of geographical correlation that we call the Geographical Density. Results: Our method was compared to the state of the art methods using GeoSemCor corpus and it has outperformed them in term of recall (87.4%) and coverage (99.0%). The results showed that the toponyms of the same context are much closer in terms of arborescent relationships than in terms of spatial relationships. Conclusion: We believe that the quantification of arborescent relationships between toponyms of the same textual context is a good way to improve the recall of TD task. However, all the arborescent relationships’ types must be considered and not only the meronymy, which is the relation the most exploited in the existing TD methods.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2010 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Bensalem, I. & Kholladi, M. (2010). Toponym Disambiguation by Arborescent Relationships. Journal of Computer Science, 6(6), 653–659. https://doi.org/10.3844/jcssp.2010.653.659

Licence
© Science Publications
Issue
Volume 6, Issue 6
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Toponym Disambiguation by Arborescent RelationshipsJournal of Computer Science · Volume 6, Issue 6 · pp. 653–659 · © Science PublicationsDownload