An accurate toponym-matching measure based on approximate string matching

Approximate string matching (ASM) is a challenging problem, which aims to match different string expressions representing the same object. In this paper, detailed experimental studies were conducted on the subject of toponym matching, which is a new domain where ASM can be performed, and the creatio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of information science 2016-04, Vol.42 (2), p.138-149
1. Verfasser: Kilinc, Deniz
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 149
container_issue 2
container_start_page 138
container_title Journal of information science
container_volume 42
creator Kilinc, Deniz
description Approximate string matching (ASM) is a challenging problem, which aims to match different string expressions representing the same object. In this paper, detailed experimental studies were conducted on the subject of toponym matching, which is a new domain where ASM can be performed, and the creation of a single string-matching measure that can perform toponym matching process regardless of the language was attempted. For this purpose, an ASM measure called DAS, which comprises name similarity, word similarity and sentence similarity phases, was created. Considering the experimental results, the retrieval performance and system accuracy of DAS were much better than those of other well-known five measures that were compared on toponym test datasets. In addition, DAS had the best metric values of mean average precision in six languages, and precision/recall graphs confirm this result.
doi_str_mv 10.1177/0165551515590097
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1793275850</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sage_id>10.1177_0165551515590097</sage_id><sourcerecordid>1793275850</sourcerecordid><originalsourceid>FETCH-LOGICAL-c396t-ebbe3f3da9a7f58262525787964526d517735d53f6ef0a1a512dad7f21d5c0b73</originalsourceid><addsrcrecordid>eNp10D1PwzAQBmALgUQp7IyRWFgMdpyz47Gq-KhUiQXmyPFHadXEwU4k-u9xSAdUCXnwcM-d7l6Ebil5oFSIR0I5AND0QBIixRmaUVFQzIsSztFsLOOxfomuYtwRQkCyYoZWizZTWg9B9TbrfefbQ4Mb1evPbbvJGqviEGxWq2hN5hPtuuC_t82oYx9-zRFfowun9tHeHP85-nh-el--4vXby2q5WGPNJO-xrWvLHDNKKuGgzHkOOYhSSF5Azg2kWxgYYI5bRxRVQHOjjHA5NaBJLdgc3U9z0yZfg4191Wyjtvu9aq0fYkWFZLmAEkiidyd054fQpu2SErRIeVBIikxKBx9jsK7qQrowHCpKqjHb6jTb1IKnlqg29s_Q__wPOUB35A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1771455115</pqid></control><display><type>article</type><title>An accurate toponym-matching measure based on approximate string matching</title><source>SAGE Publications</source><creator>Kilinc, Deniz</creator><creatorcontrib>Kilinc, Deniz</creatorcontrib><description>Approximate string matching (ASM) is a challenging problem, which aims to match different string expressions representing the same object. In this paper, detailed experimental studies were conducted on the subject of toponym matching, which is a new domain where ASM can be performed, and the creation of a single string-matching measure that can perform toponym matching process regardless of the language was attempted. For this purpose, an ASM measure called DAS, which comprises name similarity, word similarity and sentence similarity phases, was created. Considering the experimental results, the retrieval performance and system accuracy of DAS were much better than those of other well-known five measures that were compared on toponym test datasets. In addition, DAS had the best metric values of mean average precision in six languages, and precision/recall graphs confirm this result.</description><identifier>ISSN: 0165-5515</identifier><identifier>EISSN: 1741-6485</identifier><identifier>DOI: 10.1177/0165551515590097</identifier><identifier>CODEN: JISCDI</identifier><language>eng</language><publisher>London, England: SAGE Publications</publisher><subject>Approximate string matching ; Computer science ; Datasets ; Information retrieval ; Matching ; Names ; Phases ; Recall ; Sentences ; Similarity ; String matching ; Strings ; Studies</subject><ispartof>Journal of information science, 2016-04, Vol.42 (2), p.138-149</ispartof><rights>The Author(s) 2015</rights><rights>Copyright Bowker-Saur Ltd. Apr 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c396t-ebbe3f3da9a7f58262525787964526d517735d53f6ef0a1a512dad7f21d5c0b73</citedby><cites>FETCH-LOGICAL-c396t-ebbe3f3da9a7f58262525787964526d517735d53f6ef0a1a512dad7f21d5c0b73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://journals.sagepub.com/doi/pdf/10.1177/0165551515590097$$EPDF$$P50$$Gsage$$H</linktopdf><linktohtml>$$Uhttps://journals.sagepub.com/doi/10.1177/0165551515590097$$EHTML$$P50$$Gsage$$H</linktohtml><link.rule.ids>314,776,780,21798,27901,27902,43597,43598</link.rule.ids></links><search><creatorcontrib>Kilinc, Deniz</creatorcontrib><title>An accurate toponym-matching measure based on approximate string matching</title><title>Journal of information science</title><description>Approximate string matching (ASM) is a challenging problem, which aims to match different string expressions representing the same object. In this paper, detailed experimental studies were conducted on the subject of toponym matching, which is a new domain where ASM can be performed, and the creation of a single string-matching measure that can perform toponym matching process regardless of the language was attempted. For this purpose, an ASM measure called DAS, which comprises name similarity, word similarity and sentence similarity phases, was created. Considering the experimental results, the retrieval performance and system accuracy of DAS were much better than those of other well-known five measures that were compared on toponym test datasets. In addition, DAS had the best metric values of mean average precision in six languages, and precision/recall graphs confirm this result.</description><subject>Approximate string matching</subject><subject>Computer science</subject><subject>Datasets</subject><subject>Information retrieval</subject><subject>Matching</subject><subject>Names</subject><subject>Phases</subject><subject>Recall</subject><subject>Sentences</subject><subject>Similarity</subject><subject>String matching</subject><subject>Strings</subject><subject>Studies</subject><issn>0165-5515</issn><issn>1741-6485</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNp10D1PwzAQBmALgUQp7IyRWFgMdpyz47Gq-KhUiQXmyPFHadXEwU4k-u9xSAdUCXnwcM-d7l6Ebil5oFSIR0I5AND0QBIixRmaUVFQzIsSztFsLOOxfomuYtwRQkCyYoZWizZTWg9B9TbrfefbQ4Mb1evPbbvJGqviEGxWq2hN5hPtuuC_t82oYx9-zRFfowun9tHeHP85-nh-el--4vXby2q5WGPNJO-xrWvLHDNKKuGgzHkOOYhSSF5Azg2kWxgYYI5bRxRVQHOjjHA5NaBJLdgc3U9z0yZfg4191Wyjtvu9aq0fYkWFZLmAEkiidyd054fQpu2SErRIeVBIikxKBx9jsK7qQrowHCpKqjHb6jTb1IKnlqg29s_Q__wPOUB35A</recordid><startdate>20160401</startdate><enddate>20160401</enddate><creator>Kilinc, Deniz</creator><general>SAGE Publications</general><general>Bowker-Saur Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20160401</creationdate><title>An accurate toponym-matching measure based on approximate string matching</title><author>Kilinc, Deniz</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c396t-ebbe3f3da9a7f58262525787964526d517735d53f6ef0a1a512dad7f21d5c0b73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Approximate string matching</topic><topic>Computer science</topic><topic>Datasets</topic><topic>Information retrieval</topic><topic>Matching</topic><topic>Names</topic><topic>Phases</topic><topic>Recall</topic><topic>Sentences</topic><topic>Similarity</topic><topic>String matching</topic><topic>Strings</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kilinc, Deniz</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of information science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kilinc, Deniz</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An accurate toponym-matching measure based on approximate string matching</atitle><jtitle>Journal of information science</jtitle><date>2016-04-01</date><risdate>2016</risdate><volume>42</volume><issue>2</issue><spage>138</spage><epage>149</epage><pages>138-149</pages><issn>0165-5515</issn><eissn>1741-6485</eissn><coden>JISCDI</coden><abstract>Approximate string matching (ASM) is a challenging problem, which aims to match different string expressions representing the same object. In this paper, detailed experimental studies were conducted on the subject of toponym matching, which is a new domain where ASM can be performed, and the creation of a single string-matching measure that can perform toponym matching process regardless of the language was attempted. For this purpose, an ASM measure called DAS, which comprises name similarity, word similarity and sentence similarity phases, was created. Considering the experimental results, the retrieval performance and system accuracy of DAS were much better than those of other well-known five measures that were compared on toponym test datasets. In addition, DAS had the best metric values of mean average precision in six languages, and precision/recall graphs confirm this result.</abstract><cop>London, England</cop><pub>SAGE Publications</pub><doi>10.1177/0165551515590097</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0165-5515
ispartof Journal of information science, 2016-04, Vol.42 (2), p.138-149
issn 0165-5515
1741-6485
language eng
recordid cdi_proquest_miscellaneous_1793275850
source SAGE Publications
subjects Approximate string matching
Computer science
Datasets
Information retrieval
Matching
Names
Phases
Recall
Sentences
Similarity
String matching
Strings
Studies
title An accurate toponym-matching measure based on approximate string matching
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T19%3A11%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20accurate%20toponym-matching%20measure%20based%20on%20approximate%20string%20matching&rft.jtitle=Journal%20of%20information%20science&rft.au=Kilinc,%20Deniz&rft.date=2016-04-01&rft.volume=42&rft.issue=2&rft.spage=138&rft.epage=149&rft.pages=138-149&rft.issn=0165-5515&rft.eissn=1741-6485&rft.coden=JISCDI&rft_id=info:doi/10.1177/0165551515590097&rft_dat=%3Cproquest_cross%3E1793275850%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1771455115&rft_id=info:pmid/&rft_sage_id=10.1177_0165551515590097&rfr_iscdi=true