{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:19:22Z","timestamp":1726035562810},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236786"},{"type":"electronic","value":"9783030236793"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-23679-3_3","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"33-44","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumerated Automata Implementation of String Dictionaries"],"prefix":"10.1007","author":[{"given":"Robert","family":"Bakari\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damir","family":"Koren\u010di\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Strahil","family":"Ristov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/1.9781611972900.9","volume-title":"2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Diego Arroyuelo","year":"2010","unstructured":"Arroyuelo, D., C\u00e1novas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Blelloch, G.E., Halperin, D. (eds.) ALENEX 2010, pp. 84\u201397. SIAM, Philadelphia (2010). \n                      https:\/\/doi.org\/10.1137\/1.9781611972900.9"},{"doi-asserted-by":"publisher","unstructured":"Arz, J., Fischer, J.: LZ-compressed string dictionaries. In: DCC 2014, pp. 322\u2013331. IEEE (2014). \n                      https:\/\/doi.org\/10.1109\/DCC.2014.36","key":"3_CR2","DOI":"10.1109\/DCC.2014.36"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-20662-7_12","volume-title":"Experimental Algorithms","author":"NR Brisaboa","year":"2011","unstructured":"Brisaboa, N.R., C\u00e1novas, R., Claude, F., Mart\u00ednez-Prieto, M.A., Navarro, G.: Compressed string dictionaries. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 136\u2013147. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-20662-7_12"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-36390-4_6","volume-title":"Implementation and Application of Automata","author":"J Daciuk","year":"2002","unstructured":"Daciuk, J., van Noord, G.: Finite automata for compact representation of language models in NLP. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol. 2494, pp. 65\u201373. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-36390-4_6"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2003.10.003","volume":"313","author":"J Daciuk","year":"2004","unstructured":"Daciuk, J., van Noord, G.: Finite automata for compact representation of tuple dictionaries. Theor. Comput. Sci. 313(1), 45\u201356 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-44674-5_8","volume-title":"Implementation and Application of Automata","author":"J Daciuk","year":"2001","unstructured":"Daciuk, J.: Experiments with automata compression. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 105\u2013112. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44674-5_8"},{"key":"3_CR8","series-title":"Advances in Soft Computing","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-33521-8_9","volume-title":"Intelligent Information Processing and Web Mining","author":"J Daciuk","year":"2006","unstructured":"Daciuk, J., Piskorski, J.: Gazetteer compression technique based on substructure recognition. In: K\u0142opotek, M.A., Wierzcho\u0144, S.T., Trojanowski, K. (eds.) IIPWM 2006. AINSC, vol. 35, pp. 87\u201395. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/3-540-33521-8_9"},{"key":"3_CR9","first-page":"133","volume-title":"Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory","author":"J Daciuk","year":"2010","unstructured":"Daciuk, J., Piskorski, J., Ristov, S.: Natural language dictionaries implemented as finite automata. In: Mart\u00edn-Vide, C. (ed.) Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory, vol. 2, pp. 133\u2013204. World Scientific & Imperial College Press, London (2010)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-22256-6_12","volume-title":"Implementation and Application of Automata","author":"J Daciuk","year":"2011","unstructured":"Daciuk, J., Weiss, D.: Smaller representation of finite\u00a0state\u00a0automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 118\u2013129. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22256-6_12"},{"doi-asserted-by":"publisher","unstructured":"Ferragina, P., Grossi, R., Gupta, A., Shah, R., Vitter, J.S.: On searching compressed string collections cache-obliviously. In: PODS 2008, pp. 181\u2013190. ACM, New York (2008). \n                      https:\/\/doi.org\/10.1145\/1376916.1376943","key":"3_CR11","DOI":"10.1145\/1376916.1376943"},{"doi-asserted-by":"publisher","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: FOCS 2005, pp. 184\u2013196. IEEE Computer Society (2005). \n                      https:\/\/doi.org\/10.1109\/SFCS.2005.69","key":"3_CR12","DOI":"10.1109\/SFCS.2005.69"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/1868237.1868248","volume":"7","author":"P Ferragina","year":"2010","unstructured":"Ferragina, P., Venturini, R.: The compressed permuterm index. ACM Trans. Algorithms 7(1), 10:1\u201310:21 (2010). \n                      https:\/\/doi.org\/10.1145\/1868237.1868248","journal-title":"ACM Trans. Algorithms"},{"unstructured":"Georgiev, K.: Compression of minimal acyclic deterministic FSAs preserving the linear accepting complexity. In: Mihov, S., Schulz, K.U. (eds.) Proceedings Workshop on Finite-State Techniques and Approximate Search 2007, pp. 7\u201313 (2007)","key":"3_CR14"},{"issue":"1","key":"3_CR15","first-page":"3.4:1.1","volume":"19","author":"R Grossi","year":"2014","unstructured":"Grossi, R., Ottaviano, G.: Fast compressed tries through path decompositions. ACM J. Exp. Algorithmics 19(1), 3.4:1.1\u20133.4:1.20 (2014)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"11","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"NJ Larsson","year":"2000","unstructured":"Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. Proc. IEEE 88(11), 1722\u20131732 (2000). \n                      https:\/\/doi.org\/10.1109\/5.892708","journal-title":"Proc. IEEE"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1002\/spe.4380230103","volume":"23","author":"CL Lucchesi","year":"1993","unstructured":"Lucchesi, C.L., Kowaltowski, T.: Applications of finite automata representing large vocabularies. Softw. Pract. Exp. 23(1), 15\u201330 (1993)","journal-title":"Softw. Pract. Exp."},{"issue":"C","key":"3_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.is.2015.08.008","volume":"56","author":"MA Mart\u00ednez-Prieto","year":"2016","unstructured":"Mart\u00ednez-Prieto, M.A., Brisaboa, N., C\u00e1novas, R., Claude, F., Navarro, G.: Practical compressed string dictionaries. Inf. Syst. 56(C), 73\u2013108 (2016)","journal-title":"Inf. Syst."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S1570-8667(03)00066-2","volume":"2","author":"G Navarro","year":"2004","unstructured":"Navarro, G.: Indexing text using the Ziv-Lempel trie. J. Discret. Algorithms 2(1), 87\u2013114 (2004). \n                      https:\/\/doi.org\/10.1016\/S1570-8667(03)00066-2","journal-title":"J. Discret. Algorithms"},{"unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding \n                      \n                        \n                      \n                      $$k$$\n                    -ary trees and multisets. In: Eppstein, D. (ed.) Proceedings of SODA 2002, pp. 233\u2013242. ACM\/SIAM, Philadelphia (2002)","key":"3_CR20"},{"unstructured":"Revuz, D.: Dictionnaires et lexiques: m\u00e9thodes et algorithmes. Ph.D. thesis, Institut Blaise Pascal, Paris, France (1991)","key":"3_CR21"},{"issue":"5","key":"3_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1002\/spe.643","volume":"35","author":"S Ristov","year":"2005","unstructured":"Ristov, S.: LZ trie and dictionary compression. Softw. Pract. Exp. 35(5), 445\u2013465 (2005). \n                      https:\/\/doi.org\/10.1002\/spe.643","journal-title":"Softw. Pract. Exp."},{"issue":"6","key":"3_CR23","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1002\/spe.2261","volume":"45","author":"S Ristov","year":"2014","unstructured":"Ristov, S., Koren\u010di\u0107, D.: Fast construction of space-optimized recursive automaton. Softw. Pract. Exp. 45(6), 783\u2013799 (2014). \n                      https:\/\/doi.org\/10.1002\/spe.2261","journal-title":"Softw. Pract. Exp."},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-48452-3_15","volume-title":"Combinatorial Pattern Matching","author":"Strahil Ristov","year":"1999","unstructured":"Ristov, Strahil, Laporte, Eric: Ziv Lempel compression of huge natural language data tries using suffix arrays. In: Crochemore, Maxime, Paterson, Mike (eds.) CPM 1999. LNCS, vol. 1645, pp. 196\u2013211. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48452-3_15"},{"issue":"15","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1002\/spe.678","volume":"35","author":"P Skibi\u0144ski","year":"2005","unstructured":"Skibi\u0144ski, P., Grabowski, S., Deorowicz, S.: Revisiting dictionary-based compression. Softw. Pract. Exp. 35(15), 1455\u20131476 (2005). \n                      https:\/\/doi.org\/10.1002\/spe.678","journal-title":"Softw. Pract. Exp."},{"unstructured":"Tounsi, L., Bouchou, B., Maurel, D.: A compression method for natural language automata. In: FSMNLP 2008, pp. 146\u2013157. IOS Press, Amsterdam (2009)","key":"3_CR26"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23679-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:11:06Z","timestamp":1562541066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23679-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236786","9783030236793"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23679-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/ciaa2019\/","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":"28","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":"17","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":"2","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":"61% - 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":"2.89","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":"2.625","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)"}}]}}