{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:10:44Z","timestamp":1648869044333},"reference-count":31,"publisher":"Informa UK Limited","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1080\/00207160211286","type":"journal-article","created":{"date-parts":[[2003,9,18]],"date-time":"2003-09-18T18:37:50Z","timestamp":1063910270000},"page":"703-713","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Trie Construction for Natural Language Dictionaries"],"prefix":"10.1080","volume":"79","author":[{"given":"T.","family":"Sumitomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Morita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Fuketa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Tokunaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-I.","family":"Aoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"CIT0002","unstructured":"Aho, A. V, Hopcioft, J. E. and Ullman, J. D. 1983.Data Structures and Algorithms, 163\u2013169. Reading, Mass.: Addison-Wesley."},{"key":"CIT0003","volume-title":"Compilers Principles, Techniques, and Tools","author":"Aho A. V","year":"1986"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1145\/329.295"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010205"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1109\/69.506713"},{"key":"CIT0007","first-page":"1592","author":"Aoe J.","year":"1988","journal-title":"IEICE, J71"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1109\/32.31365"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1080\/00207168208803329"},{"key":"CIT0010","volume":"75","author":"Aoe J.","year":"1992","journal-title":"(in Japanese} Thins. IEICE"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380220902"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1145\/42411.42420"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28873"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230103"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211004"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1145\/46157.330532"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320092"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.233491"},{"key":"CIT0021","unstructured":"Knuth, D. E. 1973.The Art of Computer Programming, vol. 3, 481\u2013505. Sorting and Searching."},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1109\/32.83904"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360258"},{"key":"CIT0024","unstructured":"Matsukawa, T., Nakamura, J. and Nagao, M. 1989. \u201cAn algorithm of word clustering from co-occurrence data usingDM decomposition and statical estimation,\u201d. Research report; Information Processing Society ofJapan. (in Japanese}"},{"key":"CIT0025","volume-title":"\u201cA method for building morphological and co-occunence dictionaries by triestructures,\u201d","author":"Morimoto K."},{"key":"CIT0026","first-page":"514","volume":"19","author":"Nagao M.","year":"1978","journal-title":"Journal of Information Processing Society of Japan"},{"key":"CIT0027","unstructured":"Nakajima, A. and Sugimura, R. 1989. \"Japanese morphological analyzer with TRIE structure dictionary and graphstack for local ambiguity packing,\u201d. 39th Natl. Conf. on Information processing Society of Japan. 1989. Vol. 1F4, (in Japanese}"},{"key":"CIT0028","series-title":"Lecture Notes in Comput Sci.","volume-title":"Computer Programs for Spelling Correction","author":"Peterson J. L.","year":"1980"},{"key":"CIT0029","volume-title":"Longman Dictionary of Contemporary English","author":"Procter P.","year":"1984"},{"key":"CIT0030","volume-title":"Data Structure Techniques","author":"Standish T. A.","year":"1980"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359175"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160211286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T01:01:24Z","timestamp":1481677284000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160211286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1080\/00207160211286"],"URL":"https:\/\/doi.org\/10.1080\/00207160211286","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}