{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T09:58:09Z","timestamp":1769507889155,"version":"3.49.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/codit.2019.8820497","type":"proceedings-article","created":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T21:09:32Z","timestamp":1567458572000},"page":"36-41","source":"Crossref","is-referenced-by-count":3,"title":["String similarity algorithms for a ticket classification system"],"prefix":"10.1109","author":[{"given":"Malgorzata","family":"Pikies","sequence":"first","affiliation":[]},{"given":"Junade","family":"Ali","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"613","volume":"18","author":"salton","year":"1975","journal-title":"A vector space model for automatic indexing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1078"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/34.232078"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(91)90066-U"},{"key":"ref14","author":"fielding","year":"2014"},{"key":"ref15","author":"freier","year":"0"},{"key":"ref16","author":"mockapetris","year":"1987"},{"key":"ref4","first-page":"277","author":"d'angelo","year":"1997","journal-title":"Mathematical Thinking Problem-Solving and Proofs"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272026"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"ref8","article-title":"Length of Maximal Common Subsequences","author":"larsen","year":"1998","journal-title":"DAIMI Report Series"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11575832_13"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTER.2016.7829895"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DSMP.2018.8478511"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"}],"event":{"name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","location":"Paris, France","start":{"date-parts":[[2019,4,23]]},"end":{"date-parts":[[2019,4,26]]}},"container-title":["2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8806019\/8820291\/08820497.pdf?arnumber=8820497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:17:51Z","timestamp":1658247471000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8820497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/codit.2019.8820497","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}