Building a Scalable Database-Driven Reverse Dictionary
In this paper, we describe the design and implementation of a reverse dictionary. Unlike a traditional forward dictionary, which maps from words to their definitions, a reverse dictionary takes a user input phrase describing the desired concept, and returns a set of candidate words that satisfy the...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on knowledge and data engineering 2013-03, Vol.25 (3), p.528-540 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 540 |
|---|---|
| container_issue | 3 |
| container_start_page | 528 |
| container_title | IEEE transactions on knowledge and data engineering |
| container_volume | 25 |
| creator | Shaw, R. Datta, A. VanderMeer, D. Dutta, K. |
| description | In this paper, we describe the design and implementation of a reverse dictionary. Unlike a traditional forward dictionary, which maps from words to their definitions, a reverse dictionary takes a user input phrase describing the desired concept, and returns a set of candidate words that satisfy the input phrase. This work has significant application not only for the general public, particularly those who work closely with words, but also in the general field of conceptual search. We present a set of algorithms and the results of a set of experiments showing the retrieval accuracy of our methods and the runtime response time performance of our implementation. Our experimental results show that our approach can provide significant improvements in performance scale without sacrificing the quality of the result. Our experiments comparing the quality of our approach to that of currently available reverse dictionaries show that of our approach can provide significantly higher quality over either of the other currently available implementations. |
| doi_str_mv | 10.1109/TKDE.2011.225 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_1315683938</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6060823</ieee_id><sourcerecordid>1315683938</sourcerecordid><originalsourceid>FETCH-LOGICAL-c318t-b1c24eb60e432e5c8d8fd05da76908a03b39d0aa858e4f0216cafcd1b694b6643</originalsourceid><addsrcrecordid>eNpd0E1Lw0AQBuAgCtbq0ZOXgBcvqTO72e3mqG39wIKg9bxsNhPZkiZ1Nyn4791S8eBphuFhmHmT5BJhggjF7eplvpgwQJwwJo6SEQqhMoYFHscecsxynk9Pk7MQ1gCgpgpHibwfXFO59jM16bs1jSkbSuemN6UJlM2921GbvtGOfIhzZ3vXtcZ_nycntWkCXfzWcfLxsFjNnrLl6-Pz7G6ZWY6qz0q0LKdSAuWckbCqUnUFojJTWYAywEteVGCMEoryGhhKa2pbYSmLvJQy5-Pk5rB367uvgUKvNy5YahrTUjcEjRyFVLzgKtLrf3TdDb6N12lkigmQXEBU2UFZ34XgqdZb7zbxI42g9ynqfYp6n6KOKUZ_dfCOiP6sBAmKcf4DTx9riw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1282506350</pqid></control><display><type>article</type><title>Building a Scalable Database-Driven Reverse Dictionary</title><source>IEEE Electronic Library (IEL)</source><creator>Shaw, R. ; Datta, A. ; VanderMeer, D. ; Dutta, K.</creator><creatorcontrib>Shaw, R. ; Datta, A. ; VanderMeer, D. ; Dutta, K.</creatorcontrib><description>In this paper, we describe the design and implementation of a reverse dictionary. Unlike a traditional forward dictionary, which maps from words to their definitions, a reverse dictionary takes a user input phrase describing the desired concept, and returns a set of candidate words that satisfy the input phrase. This work has significant application not only for the general public, particularly those who work closely with words, but also in the general field of conceptual search. We present a set of algorithms and the results of a set of experiments showing the retrieval accuracy of our methods and the runtime response time performance of our implementation. Our experimental results show that our approach can provide significant improvements in performance scale without sacrificing the quality of the result. Our experiments comparing the quality of our approach to that of currently available reverse dictionaries show that of our approach can provide significantly higher quality over either of the other currently available implementations.</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2011.225</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Dictionaries ; Information processing ; Information retrieval ; Performance enhancement ; Response time ; Retrieval ; Search methods ; search process ; Searching ; Semantics ; Studies ; thesauruses ; Web and internet services ; web-based services</subject><ispartof>IEEE transactions on knowledge and data engineering, 2013-03, Vol.25 (3), p.528-540</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c318t-b1c24eb60e432e5c8d8fd05da76908a03b39d0aa858e4f0216cafcd1b694b6643</citedby><cites>FETCH-LOGICAL-c318t-b1c24eb60e432e5c8d8fd05da76908a03b39d0aa858e4f0216cafcd1b694b6643</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6060823$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6060823$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Shaw, R.</creatorcontrib><creatorcontrib>Datta, A.</creatorcontrib><creatorcontrib>VanderMeer, D.</creatorcontrib><creatorcontrib>Dutta, K.</creatorcontrib><title>Building a Scalable Database-Driven Reverse Dictionary</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>In this paper, we describe the design and implementation of a reverse dictionary. Unlike a traditional forward dictionary, which maps from words to their definitions, a reverse dictionary takes a user input phrase describing the desired concept, and returns a set of candidate words that satisfy the input phrase. This work has significant application not only for the general public, particularly those who work closely with words, but also in the general field of conceptual search. We present a set of algorithms and the results of a set of experiments showing the retrieval accuracy of our methods and the runtime response time performance of our implementation. Our experimental results show that our approach can provide significant improvements in performance scale without sacrificing the quality of the result. Our experiments comparing the quality of our approach to that of currently available reverse dictionaries show that of our approach can provide significantly higher quality over either of the other currently available implementations.</description><subject>Algorithms</subject><subject>Dictionaries</subject><subject>Information processing</subject><subject>Information retrieval</subject><subject>Performance enhancement</subject><subject>Response time</subject><subject>Retrieval</subject><subject>Search methods</subject><subject>search process</subject><subject>Searching</subject><subject>Semantics</subject><subject>Studies</subject><subject>thesauruses</subject><subject>Web and internet services</subject><subject>web-based services</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpd0E1Lw0AQBuAgCtbq0ZOXgBcvqTO72e3mqG39wIKg9bxsNhPZkiZ1Nyn4791S8eBphuFhmHmT5BJhggjF7eplvpgwQJwwJo6SEQqhMoYFHscecsxynk9Pk7MQ1gCgpgpHibwfXFO59jM16bs1jSkbSuemN6UJlM2921GbvtGOfIhzZ3vXtcZ_nycntWkCXfzWcfLxsFjNnrLl6-Pz7G6ZWY6qz0q0LKdSAuWckbCqUnUFojJTWYAywEteVGCMEoryGhhKa2pbYSmLvJQy5-Pk5rB367uvgUKvNy5YahrTUjcEjRyFVLzgKtLrf3TdDb6N12lkigmQXEBU2UFZ34XgqdZb7zbxI42g9ynqfYp6n6KOKUZ_dfCOiP6sBAmKcf4DTx9riw</recordid><startdate>20130301</startdate><enddate>20130301</enddate><creator>Shaw, R.</creator><creator>Datta, A.</creator><creator>VanderMeer, D.</creator><creator>Dutta, K.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20130301</creationdate><title>Building a Scalable Database-Driven Reverse Dictionary</title><author>Shaw, R. ; Datta, A. ; VanderMeer, D. ; Dutta, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c318t-b1c24eb60e432e5c8d8fd05da76908a03b39d0aa858e4f0216cafcd1b694b6643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Dictionaries</topic><topic>Information processing</topic><topic>Information retrieval</topic><topic>Performance enhancement</topic><topic>Response time</topic><topic>Retrieval</topic><topic>Search methods</topic><topic>search process</topic><topic>Searching</topic><topic>Semantics</topic><topic>Studies</topic><topic>thesauruses</topic><topic>Web and internet services</topic><topic>web-based services</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shaw, R.</creatorcontrib><creatorcontrib>Datta, A.</creatorcontrib><creatorcontrib>VanderMeer, D.</creatorcontrib><creatorcontrib>Dutta, K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shaw, R.</au><au>Datta, A.</au><au>VanderMeer, D.</au><au>Dutta, K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Building a Scalable Database-Driven Reverse Dictionary</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>2013-03-01</date><risdate>2013</risdate><volume>25</volume><issue>3</issue><spage>528</spage><epage>540</epage><pages>528-540</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>In this paper, we describe the design and implementation of a reverse dictionary. Unlike a traditional forward dictionary, which maps from words to their definitions, a reverse dictionary takes a user input phrase describing the desired concept, and returns a set of candidate words that satisfy the input phrase. This work has significant application not only for the general public, particularly those who work closely with words, but also in the general field of conceptual search. We present a set of algorithms and the results of a set of experiments showing the retrieval accuracy of our methods and the runtime response time performance of our implementation. Our experimental results show that our approach can provide significant improvements in performance scale without sacrificing the quality of the result. Our experiments comparing the quality of our approach to that of currently available reverse dictionaries show that of our approach can provide significantly higher quality over either of the other currently available implementations.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TKDE.2011.225</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1041-4347 |
| ispartof | IEEE transactions on knowledge and data engineering, 2013-03, Vol.25 (3), p.528-540 |
| issn | 1041-4347 1558-2191 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1315683938 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Dictionaries Information processing Information retrieval Performance enhancement Response time Retrieval Search methods search process Searching Semantics Studies thesauruses Web and internet services web-based services |
| title | Building a Scalable Database-Driven Reverse Dictionary |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T02%3A26%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Building%20a%20Scalable%20Database-Driven%20Reverse%20Dictionary&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Shaw,%20R.&rft.date=2013-03-01&rft.volume=25&rft.issue=3&rft.spage=528&rft.epage=540&rft.pages=528-540&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2011.225&rft_dat=%3Cproquest_RIE%3E1315683938%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1282506350&rft_id=info:pmid/&rft_ieee_id=6060823&rfr_iscdi=true |