{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T09:12:43Z","timestamp":1651050763301},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Texts (books, novels, papers, short messages)\nare sequences of sentences, words or symbols. Each author\nhas an unique writing style. It can be characterized\nby some collection of attributes obtained from texts. The\ntext verification is the case of an authorship verification\nwhere we have some text and we analyze if all parts of this\ntextwere written by the same (unknown or known) author.\nIn this paper, there are analyzed and compared results of\ntwo developed methods for a text verification based on ngrams\nof symbols and on local histograms of words. The\nresults of a symbol n-gram method and a method of word\nhistograms for a dissimilarities searching in text parts of\neach text are analyzed and evaluated. The searched dissimilarities\ncall for an attention to the text (or not) if the\ntext parts were written by the same author or not. The attention\ndepends on selected parameters prepared in experiments.\nResults illustrate usability of the methods to\ndissimilarities searching in text parts.<\/jats:p>","DOI":"10.1515\/comp-2016-0014","type":"journal-article","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T10:01:29Z","timestamp":1478080889000},"page":"168-177","source":"Crossref","is-referenced-by-count":0,"title":["Dissimilarities Detections in Texts\nUsing Symbol n-grams and Word Histograms"],"prefix":"10.1515","volume":"6","author":[{"given":"Gabriela","family":"Andrejkov\u00e1","sequence":"first","affiliation":[{"name":"Institute of Computer Sciencel , P. J. \u0160af\u00e1rik University in Ko\u0161ice"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdulwahed","family":"Almarimi","sequence":"additional","affiliation":[{"name":"Institute of Computer Sciencel , P. J. \u0160af\u00e1rik University in Ko\u0161ice"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2016,11,2]]},"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/comp\/6\/1\/article-p168.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2016-0014\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2016-0014\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T08:57:27Z","timestamp":1651049847000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2016-0014\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,2,22]]},"published-print":{"date-parts":[[2016,1,1]]}},"alternative-id":["10.1515\/comp-2016-0014"],"URL":"https:\/\/doi.org\/10.1515\/comp-2016-0014","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,1]]}}}