{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:48:39Z","timestamp":1725900519317},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540250565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32392-9_18","type":"book-chapter","created":{"date-parts":[[2006,5,27]],"date-time":"2006-05-27T07:09:20Z","timestamp":1148713760000},"page":"169-178","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Perfect Hashing with Finite-State Automata"],"prefix":"10.1007","author":[{"given":"Jan","family":"Daciuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Maurel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agata","family":"Savary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"Jan Daciuk, Stoyan Mihov, Bruce Watson, and Richard Watson. Incremental construction of minimal acyclic finite state automata. Computational Linguistics, 26(1):3\u201316, April 2000.","journal-title":"Computational Linguistics"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Lauri Karttunen. Constructing lexical transducers. In In Proc. of the 15th International Conference on Computational Linguistics, COLING\u201994, Kyoto, Japan, 1994.","DOI":"10.3115\/991886.991957"},{"issue":"1","key":"18_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/spe.4380230103","volume":"23","author":"C. Lucchiesi","year":"1993","unstructured":"Claudio Lucchiesi and Tomasz Kowaltowski. Applications of finite automata representing large vocabularies. Software Practice and Experience, 23(1):15\u201330, Jan. 1993.","journal-title":"Software Practice and Experience"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(99)00022-5","volume":"231","author":"D. Maurel","year":"2000","unstructured":"Denis Maurel. Pseudo-minimal transducer. Theoretical Computer Science, (231):129\u2013139, 2000.","journal-title":"Theoretical Computer Science"},{"key":"18_CR5","volume-title":"Dictionnaires et lexiques: m\u00e9thodes et algorithmes","author":"D. Revuz","year":"1991","unstructured":"Dominique Revuz. Dictionnaires et lexiques: m\u00e9thodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France, 1991. LITP 91.44."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Strahil Ristov and Eric Laporte. Ziv Lempel compression of huge natural language data tries using suffix arrays. Journal of Discrete Algorithms, pages 241\u2013256, 1999.","DOI":"10.1007\/3-540-48452-3_15"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bruce Watson. A fast new (semi-incremental) algorithm for the construction of minimal acyclic DFAs. In Third Workshop on Implementing Automata, pages 91\u201398, Rouen, France, September 1998. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-48057-9_11"}],"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-32392-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:53:39Z","timestamp":1619571219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32392-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540250565"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-32392-9_18","relation":{},"subject":[]}}