{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:04:54Z","timestamp":1729659894010,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/iccse.2016.7581668","type":"proceedings-article","created":{"date-parts":[[2016,10,6]],"date-time":"2016-10-06T18:03:48Z","timestamp":1475777028000},"page":"718-723","source":"Crossref","is-referenced-by-count":0,"title":["Light-weight top-k string similarity search with a two-level inverted index"],"prefix":"10.1109","author":[{"given":"Yuhui","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Tianzhi","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Xiaoli","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"ref11","article-title":"Fast Algorithms for Top-k Approximate String Matching[C]","author":"yang","year":"2010","journal-title":"AAAI"},{"key":"ref12","first-page":"303","article-title":"VGRAM: Improving performance of approximate queries on string collections using variable-length grams[C]","author":"li","year":"2007","journal-title":"Proceedings of the 33rd International Conference on Very Large Data Bases"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732220"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113311"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544886"},{"key":"ref4","article-title":"Intrinsic plagiarism detection using character n-gram profiles[J]","volume":"2","author":"stamatatos","year":"2009","journal-title":"Threshold"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu518"},{"key":"ref6","first-page":"8","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones[J]","volume":"1","author":"levenstein","year":"1965","journal-title":"Problems of Information Transmission"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-5900-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2307\/1932409"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"ref2","first-page":"6","article-title":"Cleaning uncertain data with a noisy crowd[C]\/\/Data Engineering (ICDE)","author":"zhang","year":"2015","journal-title":"2015 IEEE 31st International Conference on"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/363282.363326"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"}],"event":{"name":"2016 11th International Conference on Computer Science & Education (ICCSE)","start":{"date-parts":[[2016,8,23]]},"location":"Nagoya, Japan","end":{"date-parts":[[2016,8,25]]}},"container-title":["2016 11th International Conference on Computer Science & Education (ICCSE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7579273\/7581525\/07581668.pdf?arnumber=7581668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,10,20]],"date-time":"2016-10-20T19:53:44Z","timestamp":1476993224000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7581668\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/iccse.2016.7581668","relation":{},"subject":[],"published":{"date-parts":[[2016,8]]}}}