{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:46Z","timestamp":1725492406639},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_9","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"95-105","source":"Crossref","is-referenced-by-count":1,"title":["Implementation of Dictionaries via Automata and Decision Trees"],"prefix":"10.1007","author":[{"given":"Abolfazl","family":"Fatholahzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/69.506713","volume":"8","author":"J.-I. Aoe","year":"1996","unstructured":"Aoe, J-I., Morimoto, K., Shishibori, M., and Park, K. A trie compaction algorithm for a large set of keys. IEEE Transaction on Knowledge and Data Engineering8, 3 (1996), 476\u2013491.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"9_CR2","unstructured":"Bentley, J., and Sedgewick B. Fast algorithms for sorting and searching strings. In Annual ACM-SIAM Symposium on Discrete Algorithms (1996), pp. 1\u201310."},{"key":"9_CR3","volume-title":"L\u2019art de Conjuguer","author":"Bescherelle","year":"1966","unstructured":"Bescherelle. L\u2019art de Conjuguer. Hatier, Paris, 1966."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0020-0190(92)90220-P","volume":"43","author":"Z. J. Czech","year":"1992","unstructured":"Czech, Z. J., and Majewski, B. S. An optimal algorithm for generating minimal perfect hash function. Information Processing Letters 43 (1992), 257\u2013264.","journal-title":"Information Processing Letters"},{"issue":"1","key":"9_CR5","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. W., and Watson, R. E. Incremental construction of finite-state automata. Association for Computational Linguistics 26, 1 (2000), 3\u201316.","journal-title":"Association for Computational Linguistics"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/69.277768","volume":"6","author":"M. D. Brain","year":"1994","unstructured":"Brain, M. D., and Tharp, A. L. Using trie to eliminate pattern collision in perfect hashing. IEEE Transaction on Knowledge and Data Engineering 6 (1994), 476\u2013491.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"9_CR7","unstructured":"Fatholahzadeh, A. DAWG-ID3: Retrieving key-information using graph and classification algorithms. In International Symposium on Database Technology & Software Engineering, WEB and Cooperative Systems (2000), Lasker G. E. and Gerhard W. (eds.), 117\u2013124."},{"key":"9_CR8","unstructured":"Fatholahzadeh, A. Experiments with automata and information gain. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian E., and Yu S. (eds.), 252."},{"key":"9_CR9","unstructured":"Fatholahzadeh, A. Nationality word graph for fast information retrieval. In Collaborative Electronic Commerce Technology and Research (2000), Williams M. A. and P. Swatman P. (eds.), International Conference on Knowledge Representation, 1\u201312. Available via \n                    http:\/\/www.collecter.org\/collUSA\n                    \n                  ."},{"key":"9_CR10","unstructured":"Fatholahzadeh, A. Tagging nationality words using automata. In ROMMAND: RObust Methods in Analysis of Natural Language Data (Swiss 2000), Ballim A., Pallotta V., and Ghorbel H. (eds.), 69\u201376."},{"key":"9_CR11","unstructured":"Fatholahzadeh, A. Online treatment of official names. In International Conference on Artificial Intelligence (2001), Arabnia H. R.(ed.), 203\u2013209."},{"key":"9_CR12","unstructured":"Kempe, A. Factorizations of ambiguous finite-state transducers. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian M., and Yu S. (eds.), 157\u2013164."},{"key":"9_CR13","unstructured":"Mihov, S., and Murel, D. Direct construction of minimal acyclic sub-sequential transducers. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian E., and S. Yu (eds.), 150\u2013156."},{"key":"9_CR14","unstructured":"Mitchell, T. M. Machine Learning. McGraw-Hill, 1997."},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S135132499600126X","volume":"2","author":"M. Mohri","year":"1996","unstructured":"Mohri, M. On some application of finite-state automata theory to natural language. Natural Language Engineering 2, 1 (1996), 1\u201320.","journal-title":"Natural Language Engineering"},{"issue":"2","key":"9_CR16","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M. Finite-state transducers in language and speech processing. Computational Linguistics 23, 2 (1997), 269\u2013311.","journal-title":"Computational Linguistics"},{"key":"9_CR17","unstructured":"Mohri, M. Generic \u2208-removal algorithm for weighted automata. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian E., and Yu S. (eds.) 26\u201335."},{"key":"9_CR18","unstructured":"Quinlan, R. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993."},{"volume-title":"Handbook of Formal Language","year":"1997","key":"9_CR19","unstructured":"Rozenberg G. and Salomaa A. (eds.) Handbook of Formal Language. Springer-Verlag, Berlin Heidelberg, 1997."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T02:51:48Z","timestamp":1550976708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}