{"updated":"2025-01-22T07:59:55.203035+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00049572","sets":["1164:4179:4306:4307"]},"path":["4307"],"owner":"1","recid":"49572","title":["並列時間差準破壊型単一化アルゴリズム実現の手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1990-11-22"},"_buckets":{"deposit":"93403dbd-e634-4b2f-83be-a8de06e1fc3c"},"_deposit":{"id":"49572","pid":{"type":"depid","value":"49572","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"並列時間差準破壊型単一化アルゴリズム実現の手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"並列時間差準破壊型単一化アルゴリズム実現の手法"},{"subitem_title":"Parallelization Technique for Quasi - Destructive Graph Unification Algorithm","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1990-11-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"ATR自動翻訳電話研究／早稲田大学大学院理工学研究科電気工学分野修士課程"},{"subitem_text_value":"ATR自動翻訳電話研究所"},{"subitem_text_value":"ATR自動翻訳電話研究所"},{"subitem_text_value":"ATR自動翻訳電話研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Electrical Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"ATR Interpreting Telephony Research Laboratories","subitem_text_language":"en"},{"subitem_text_value":"ATR Interpreting Telephony Research Laboratories","subitem_text_language":"en"},{"subitem_text_value":"ATR Interpreting Telephony Research Laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/49572/files/IPSJ-NL90080007.pdf"},"date":[{"dateType":"Available","dateValue":"1992-11-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-NL90080007.pdf","filesize":[{"value":"856.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"23"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"40e9c2a4-57a8-4a86-826b-6b6e834cf917","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1990 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"藤岡, 孝子"},{"creatorName":"苫米地, 英人"},{"creatorName":"古瀬, 蔵"},{"creatorName":"飯田, 仁"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takako, Fujioka","creatorNameLang":"en"},{"creatorName":"Hideto, Tomabechi","creatorNameLang":"en"},{"creatorName":"Osamu, Furuse","creatorNameLang":"en"},{"creatorName":"Hitoshi, Iida","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10115061","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"単一化に基づく自然言語処理において、単一化手続きは最も処理時間の割合が大きく、これを高速化することが重要な課題となっている。これに対し、並列処理をすることによる高速化の手法を考える。まず、効率の良い並列化が可能なTomabechiの時間差準破壊型単一化アルゴリズムについて考察し、これを並列に処理する手法を提案する。また、日本語文解析における単一化手続きにおいてこの並列アルゴリズムを用いて実験を行ない、並列化の効果と課題について述べる。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A typical unification-based natural language processing system spends most of its processing times for graph unification. We have found existing graph unification algorithms to be hard to parallelize. It is essentially because synchronizations for each recurseve call into shared-arcs are required in the most existing algorithms and also due to the difIiculty of efficient management of lock/unlock scheduling of simultaneous accesses to global shared data structures. We adopted the quasi-destructive graph unification algorithm as appropriate for effective parallization and propose the parallel quasi-destructive graph unification algorithm that avoids these two problems.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告自然言語処理（NL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1990-11-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"93(1990-NL-080)","bibliographicVolumeNumber":"1990"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:14:33.308465+00:00","id":49572,"links":{}}