{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:48Z","timestamp":1725487068423},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540335207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-33521-8_9","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T03:10:01Z","timestamp":1183432201000},"page":"87-95","source":"Crossref","is-referenced-by-count":5,"title":["Gazetteer Compression Technique Based on Substructure Recognition"],"prefix":"10.1007","author":[{"given":"Jan","family":"Daciuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Piskorski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"1. Daciuk J. 2000. Experiments with Automata Compression. Proceedings of CIAA - Implementation and Application of Automata, London, Ontario, Canada, 105\u2013112","DOI":"10.1007\/3-540-44674-5_8"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"2. Daciuk J., Mihov S., Watson B., Watson R. 2000. Incremental Construction of Minimal Acyclic Finite State Automata. Computational Linguistics, 26(1), pages 3\u201316","journal-title":"Computational Linguistics"},{"key":"9_CR3","unstructured":"3. Drozdzy\u0144ski, W., Krieger H-U., Piskorski, J., Sch\u00e4fer, U., Xu, F. Shallow Processing with Uni.cation and Typed Feature Structures \u2014 Foundations and Applications. In K\u00fcnstliche Intelligenz, 2004(1), pages 17\u201323"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"4. Dan Gus.eld 1997). Algorithms on Strings, Trees, and Sequences. Cambridge University Press.","DOI":"10.1017\/CBO9780511574931"},{"key":"9_CR5","unstructured":"5. Hopcroft J. 1971. An nlogn Algorithm for Minimizing the states in a Finite Automaton. The Theory of Machines and Computations, Academic Press, 189\u2013196."},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1162\/089120100561610","volume":"26","author":"M.-J. Nederhof","year":"2000","unstructured":"6. Nederhof, M.-J. 2000. Practical experiments with regular approximation of context-free languages. Journal of Computational Linguistics, 26(1), pages 17\u201344","journal-title":"Journal of Computational Linguistics"},{"key":"9_CR7","unstructured":"7. Kowaltowski T, Lucchesi C. and Stol. J. 1993. Minimization of Binary Automata. Proceedings of the First South American String Processing Workshop, Belo Horizonte, Brasil."},{"key":"9_CR8","volume-title":"Finite Automata and E.cient Lexicon Implementation","author":"T. Kowaltowski","year":"1998","unstructured":"8. Kowaltowski T., Lucchesi C., Stol. J. 1998. Finite Automata and E.cient Lexicon Implementation. Technical Report IC-98\u201302, University of Campinas, Brazil."},{"key":"9_CR9","volume-title":"On Compact Storage Models for Gazetteers. Proceedings of the 5th InternationalWorkshop on Finite-State Methods and Natural Language Processing","author":"J. Piskorski","year":"2005","unstructured":"9. Piskorski J. 2005). On Compact Storage Models for Gazetteers. Proceedings of the 5th InternationalWorkshop on Finite-State Methods and Natural Language Processing, Helsinki, Finland, Springer LNAI."},{"key":"9_CR10","unstructured":"10. Revuz D. 1991. Dictionnaires et Lexiques, M\u00e9thodes et Algorithmes. PhD Thesis, Universit\u00e9 Paris 7."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"11. Tarjan R, and Andrew Chi-Chih Yao. (1979) Storing a sparse table. Commun. ACM. 22(11), ACM Press","DOI":"10.1145\/359168.359175"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-33521-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:19Z","timestamp":1605646579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-33521-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540335207"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-33521-8_9","relation":{},"subject":[]}}