{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:43:22Z","timestamp":1742935402654,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354673"},{"type":"electronic","value":"9783540354697"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780885_22","type":"book-chapter","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T12:13:38Z","timestamp":1165839218000},"page":"227-238","source":"Crossref","is-referenced-by-count":1,"title":["On Compact Storage Models for Gazetteers"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Piskorski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"22_CR1","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1002\/spe.402","volume":"31","author":"M.G. Ciura","year":"2001","unstructured":"Ciura, M.G., Deorowicz, S.: How to Squeeze a Lexicon. Software - Practice and Experience\u00a031(11), 1077\u20131090 (2001)","journal-title":"Software - Practice and Experience"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Daciuk, J.: Incremental Construction of Finite-State Automata and Transducers. PhD Thesis. Technical University Gda\u0144sk (1998)","DOI":"10.3115\/1611533.1611538"},{"key":"22_CR3","unstructured":"Kowaltowski, T., Lucchesi, C.L.: Applications of Finite Automata Representing Large Vocabularies. TR DCC-01\/92, University of Campinas, Brazil (1992)"},{"key":"22_CR4","unstructured":"Kowaltowski, T., Lucchesi, C.L., Stolfi, J.: Finite Automata and Efficient Lexicon Implementation. TR IC-98-02, University of Campinas, Brazil (1998)"},{"key":"22_CR5","unstructured":"Beijer, N.D., Watson, B.W., Kourie, D.G.: Stretching and Jamming of Automata. In: Proceedings of SAICSIT 2003, Rep. South Africa, pp. 198\u2013207 (2003)"},{"issue":"1","key":"22_CR6","first-page":"17","volume":"2004","author":"W. Dro\u017cd\u017cy\u0144ski","year":"2004","unstructured":"Dro\u017cd\u017cy\u0144ski, W., Krieger, H.U., Piskorski, J., Sch\u00e4fer, U., Xu, F.: Shallow Processing with Unification and Typed Feature Structures \u2014 Foundations and Applications. K\u00fcnstliche Intelligenz\u00a02004(1), 17\u201323 (2004)","journal-title":"K\u00fcnstliche Intelligenz"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"Daciuk, J., Mihov, S., Watson, B., Watson, R.: Incremental Construction of Minimal Acyclic Finite State Automata. Comp. Rep Linguistics\u00a026(1), 3\u201316 (2000)","journal-title":"Comp. Rep Linguistics"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Daciuk, J., van Noord, G.: Finite Automata for Compact Representation of Language Models in NLP. Theoretical Computer Science\u00a0313(1) (2004)","DOI":"10.1016\/j.tcs.2003.10.003"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-36390-4_12","volume-title":"Implementation and Application of Automata","author":"J. Gra\u00f1a","year":"2003","unstructured":"Gra\u00f1a, J., Barcala, F.M., Alonso, M.A.: Compilation Methods of Minimal Acyclic Automata for Large Dictionaries. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol.\u00a02494, pp. 135\u2013148. Springer, Heidelberg (2003)"},{"key":"22_CR10","first-page":"92","volume-title":"Proceedings of the 2004 IEEE Data Compression Conference","author":"B. Vo","year":"2004","unstructured":"Vo, B., Vo, K.P.: Using Column Dependency to Compress Tables. In: Proceedings of the 2004 IEEE Data Compression Conference, pp. 92\u2013101. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","first-page":"113","volume-title":"Implementation and Application of Automata","author":"J. Daciuk","year":"2000","unstructured":"Daciuk, J.: Experiments with Automata Compression. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 113\u2013119. Springer, Heidelberg (2000)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-44674-5_18","volume-title":"Implementation and Application of Automata","author":"S. Mihov","year":"2001","unstructured":"Mihov, S., Maurel, D.: Direct Construction of Minimal Acyclic Subsequential Transducers. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 217\u2013229. Springer, Heidelberg (2001)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Skut, W.: Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Lexical Data. In: Proceedings of COLING 2004, Geneva, Switzerland (2004)","DOI":"10.3115\/1220355.1220358"}],"container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780885_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:20:52Z","timestamp":1558272052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780885_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354673","9783540354697"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11780885_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}