{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:28:56Z","timestamp":1742945336835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030602758"},{"type":"electronic","value":"9783030602765"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60276-5_25","type":"book-chapter","created":{"date-parts":[[2020,10,4]],"date-time":"2020-10-04T07:02:44Z","timestamp":1601794964000},"page":"244-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Legal Tech: Documents\u2019 Validation Method Based on the Associative-Ontological Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8454-5598","authenticated-orcid":false,"given":"Sergey","family":"Kuleshov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1345-8550","authenticated-orcid":false,"given":"Alexandra","family":"Zaytseva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4628-2096","authenticated-orcid":false,"given":"Konstantin","family":"Nenausnikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Kuleshov, S.V., Yusupov, R.M.: Is softwarization the way to import substitution? SPIIRAS Proc. 3(46), 5\u201313 (2016) (in Russian)","key":"25_CR1","DOI":"10.15622\/sp.46.1"},{"unstructured":"LegalTech News. \nhttps:\/\/www.law.com\/legaltechnews\n\n. Accessed 20 May 2020","key":"25_CR2"},{"unstructured":"Voitenko, V.: The Future with the IT startup Legal Tech. \nhttps:\/\/kod.ru\/legaltech-part01\/\n\n. Accessed 20 May 2020. (in Russian)","key":"25_CR3"},{"doi-asserted-by":"publisher","unstructured":"Qin, Z., Yu, T., Yang, Y., Khalil, I., Xiao, X., Ren, K.: Generating synthetic decentralized social graphs with local differential privacy. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (CCS 2017), pp. 425\u2013438. Association for Computing Machinery, New York (2017). \nhttps:\/\/doi.org\/10.1145\/3133956.3134086","key":"25_CR4","DOI":"10.1145\/3133956.3134086"},{"issue":"4","key":"25_CR5","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.31228\/osf.io\/qhezc","volume":"39","author":"D Carter","year":"2018","unstructured":"Carter, D., Brown, J., Rahmani, A.: Reading the high court at a distance: topic modelling the legal subject matter and judicial activity of the high court of Australia, 1903\u20132015. UNSW Law J. 39(4), 1300\u20131352 (2018). \nhttps:\/\/doi.org\/10.31228\/osf.io\/qhezc","journal-title":"UNSW Law J."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1186\/s12888-016-1073-5","volume":"16","author":"B Carron-Arthur","year":"2016","unstructured":"Carron-Arthur, B., Reynolds, J., Bennett, K., et al.: What\u2019s all the talk about? Topic modelling in a mental health Internet support group. BMC Psychiatry 16, 367 (2016). \nhttps:\/\/doi.org\/10.1186\/s12888-016-1073-5","journal-title":"BMC Psychiatry"},{"unstructured":"Huang, J., Zhou, M., Yang, D.: Extracting chatbot knowledge from online discussion forums. In: 20th International Joint Conference on Artificial intelligence, pp. 423\u2013428 (2007)","key":"25_CR7"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s10115-017-1100-y","volume":"55","author":"D Diefenbach","year":"2017","unstructured":"Diefenbach, D., Lopez, V., Singh, K., Maret, P.: Core techniques of question answering systems over knowledge bases: a survey. Knowl. Inf. Syst. 55(3), 529\u2013569 (2017). \nhttps:\/\/doi.org\/10.1007\/s10115-017-1100-y","journal-title":"Knowl. Inf. Syst."},{"doi-asserted-by":"publisher","unstructured":"Bast, H., Bjorn, B., Haussmann, E.: Semantic search on text and knowledge bases. Found. Trends\u00ae Inf. Retrieval 10(2\u20133), 119\u2013271 (2016). \nhttps:\/\/doi.org\/10.1561\/1500000032","key":"25_CR9","DOI":"10.1561\/1500000032"},{"issue":"192","key":"25_CR10","first-page":"79","volume":"7","author":"VV Bova","year":"2017","unstructured":"Bova, V.V., Leshchanov, D.V.: The semantic search of knowledge in the environment of operation of interdisciplinary information systems based on ontological approach. Izvestiya SFedU. Engineering Sciences 7(192), 79\u201390 (2017). (In Russ)","journal-title":"Izvestiya SFedU. Engineering Sciences"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1061\/(ASCE)CP.1943-5487.0000346","volume":"30","author":"J Zhang","year":"2016","unstructured":"Zhang, J., El-Gohary, N.M.: Semantic NLP-based information extraction from construction regulatory documents for automated compliance checking. J. Comput. Civ. Eng. 30(2), 1\u201314 (2016). \nhttps:\/\/doi.org\/10.1061\/(ASCE)CP.1943-5487.0000346","journal-title":"J. Comput. Civ. Eng."},{"key":"25_CR12","series-title":"Management for Professionals","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-45868-7_7","volume-title":"Liquid Legal","author":"M-M Bues","year":"2017","unstructured":"Bues, M.-M., Matthaei, E.: LegalTech on the rise: technology changes legal work behaviours, but does not replace its profession. In: Jacob, K., Schindler, D., Strathausen, R. (eds.) Liquid Legal. MP, pp. 89\u2013109. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45868-7_7"},{"unstructured":"Kharlamov, A.A., Yermolenko, T.V., Zhonin, A.A.: Process dynamics modeling on the base of text corpus sequence analysis. Eng. J. Don 4(27) (2013) \nhttp:\/\/www.ivdon.ru\/en\/magazine\/archive\/n4y2013\/2047\n\n. Accessed 25 May 2020. (in Russian)","key":"25_CR13"},{"unstructured":"Federal Law of July 27, 2006\u00a0N 152-FZ (as amended on December 31, 2017) \u201cOn Personal Data\u201d. \nhttps:\/\/base.garant.ru\/12148567\/\n\n. Accessed 20 May 2020. (in Russian)","key":"25_CR14"},{"unstructured":"RusBase homepage. \nhttps:\/\/rb.ru\/longread\/legal-russia\/\n\n. Accessed 20 May 2020. (in Russian)","key":"25_CR15"},{"unstructured":"Lim, K.W., et al.: Twitter-network topic model: a full bayesian treatment for social network and text modeling. ArXiv abs\/1609.06791 (2016)","key":"25_CR16"},{"unstructured":"Skolkovo LegalTech. Black Edition (2019). \nhttps:\/\/sklegaltech.com\/\n\n. Accessed 20 May 2020. (in Russian)","key":"25_CR17"},{"unstructured":"Platforma Media. \nhttps:\/\/platforma-online.ru\/media\/detail\/maksim-shchikolodkov-produkt-dolzhen-reshat-konkretnuyu-problemu-ili-zakryvat-potrebnost-\/?lang=ru\n\n. Accessed 20 May 2020. (in Russian)","key":"25_CR18"},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"187","DOI":"10.21469\/22233792.2.2.05","volume":"2","author":"KV Vorontsov","year":"2016","unstructured":"Vorontsov, K.V.: Additive regularization for hierarchical multimodal topic modeling. J. Mach. Learn. Data Anal. 2(2), 187\u2013200 (2016). \nhttps:\/\/doi.org\/10.21469\/22233792.2.2.05","journal-title":"J. Mach. Learn. Data Anal."},{"key":"25_CR20","first-page":"241","volume":"19","author":"C Chemudugunta","year":"2007","unstructured":"Chemudugunta, C., Padhraic, S., Steyvers, M.: Modeling general and specific aspects of documents with a probabilistic topic model. Adv. Neural. Inf. Process. Syst. 19, 241\u2013248 (2007)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"unstructured":"Lim, K.W., Chen, C., Buntine, W.: Twitter-network topic model: a full bayesian treatment for social network and text modeling. ArXiv abs\/1609.06791 (2016). \nhttps:\/\/arxiv.org\/pdf\/1609.06791.pdf\n\n. Accessed 25 May 2020","key":"25_CR21"},{"doi-asserted-by":"publisher","unstructured":"Yan, X., Guo, J., Lan, Y., Cheng, X.: A biterm topic model for short texts. In: Proceedings of the 22nd International Conference on World Wide Web (WWW 2013), pp. 1445\u20131456. Association for Computing Machinery, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2488388.2488514","key":"25_CR22","DOI":"10.1145\/2488388.2488514"},{"issue":"2","key":"25_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10115-015-0882-z","volume":"48","author":"Y Zuo","year":"2015","unstructured":"Zuo, Y., Zhao, J., Xu, K.: Word network topic model: a simple but general solution for short and imbalanced texts. Knowl. Inf. Syst. 48(2), 379\u2013398 (2015). \nhttps:\/\/doi.org\/10.1007\/s10115-015-0882-z","journal-title":"Knowl. Inf. Syst."},{"key":"25_CR24","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-030-30329-7_26","volume-title":"Intelligent Systems Applications in Software Engineering","author":"S Kuleshov","year":"2019","unstructured":"Kuleshov, S., Zaytseva, A., Aksenov, A.: Natural language search and associative-ontology matching algorithms based on graph representation of texts. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds.) CoMeSySo 2019 2019. AISC, vol. 1046, pp. 285\u2013294. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-30329-7_26"},{"key":"25_CR25","first-page":"40","volume":"4","author":"SV Kuleshov","year":"2015","unstructured":"Kuleshov, S.V., Zaytseva, A.A., Markov, S.V.: Associative-ontological approach to natural language texts processing. Intellect. Technol. Transp. 4, 40\u201345 (2015). (In Russ)","journal-title":"Intellect. Technol. Transp."},{"unstructured":"Moscow Legal Tech 2018. \nhttp:\/\/moscowlegal.tech\/\n\n. Accessed 20 May 2020. (in Russian)","key":"25_CR26"},{"key":"25_CR27","first-page":"35","volume":"5","author":"AA Ivanov","year":"2018","unstructured":"Ivanov, A.A.: Penetration of mechanisation in law. Zakon 5, 35\u201341 (2018). (In Russ)","journal-title":"Zakon"}],"container-title":["Lecture Notes in Computer Science","Speech and Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60276-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,4]],"date-time":"2020-10-04T07:07:09Z","timestamp":1601795229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60276-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602758","9783030602765"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60276-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPECOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Speech and Computer","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"specom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/specom.nw.ru\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"160","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic SPECOM 2020 was held as a virtual event","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}