WEKO3
アイテム
{"_buckets": {"deposit": "e1dc9eb9-dc8f-4950-bc38-16f3de4f6146"}, "_deposit": {"id": "397", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "397"}, "status": "published"}, "_oai": {"id": "oai:repository.dl.itc.u-tokyo.ac.jp:00000397", "sets": ["13", "15"]}, "item_2_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2001-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "1", "bibliographicPageEnd": "48", "bibliographicPageStart": "21", "bibliographicVolumeNumber": "8", "bibliographic_titles": [{"bibliographic_title": "自然言語処理"}]}]}, "item_2_description_13": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_2_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We describe an agent-based parallel HPSG parser that operates on shared-memory parallel machines. It efficiently parses real-world corpora by using a wide-coverage HPSG grammar. The efficiency is due to the use of a parallel parsing algorithm and the efficient treatment of feature structures. The parsing algorithm is based on the CKY algorithm, in which resolving constraints between a mother and her daughters is regarded as an atomic operation. The CKY algorithm features data distribution and granularity of parallelism. The keys to the efficient treatment of feature structures are i) transferring them through shared-memory, ii) copying them on demand, and iii) writing/reading them simultaneously onto/from memory. Being parallel, our parser is more efficient than sequential parsers. The average parsing time per sentence for the EDR Japanese corpus was 78 msec and its speed-up reaches 13.2 when 50 processors were used.", "subitem_description_type": "Abstract"}]}, "item_2_publisher_20": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "言語処理学会"}]}, "item_2_source_id_10": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AN10472659", "subitem_source_identifier_type": "NCID"}]}, "item_2_source_id_8": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "13407619", "subitem_source_identifier_type": "ISSN"}]}, "item_2_subject_15": {"attribute_name": "日本十進分類法", "attribute_value_mlt": [{"subitem_subject": "007", "subitem_subject_scheme": "NDC"}]}, "item_2_text_21": {"attribute_name": "出版者別名", "attribute_value_mlt": [{"subitem_text_value": "The Association for Natural Language Processing"}]}, "item_2_text_34": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"subitem_text_value": "Journal Article"}]}, "item_2_text_4": {"attribute_name": "著者所属", "attribute_value_mlt": [{"subitem_text_value": "Department of Information Science, Graduate School of Science, University of Tokyo"}, {"subitem_text_value": "Information and Human Behavior, PRESTO, Japan Science and Technology Corporation"}, {"subitem_text_value": "CCL, UMIST"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Ninomiya, Takashi"}], "nameIdentifiers": [{"nameIdentifier": "106270", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Torisawa, Kentaro"}], "nameIdentifiers": [{"nameIdentifier": "106271", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Tsujii, Jun\u0027ichi"}], "nameIdentifiers": [{"nameIdentifier": "106272", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-06-26"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "v08n1_02.pdf", "filesize": [{"value": "356.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 356700.0, "url": {"label": "v08n1_02.pdf", "url": "https://repository.dl.itc.u-tokyo.ac.jp/record/397/files/v08n1_02.pdf"}, "version_id": "3d6a52e9-7c09-4f3b-a07d-890c00ee2fa1"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "parsing", "subitem_subject_scheme": "Other"}, {"subitem_subject": "parallel parsing", "subitem_subject_scheme": "Other"}, {"subitem_subject": "concurrent object", "subitem_subject_scheme": "Other"}, {"subitem_subject": "agent", "subitem_subject_scheme": "Other"}, {"subitem_subject": "HPSG", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "An Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "An Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines"}]}, "item_type_id": "2", "owner": "1", "path": ["13", "15"], "permalink_uri": "http://hdl.handle.net/2261/26623", "pubdate": {"attribute_name": "公開日", "attribute_value": "2009-09-09"}, "publish_date": "2009-09-09", "publish_status": "0", "recid": "397", "relation": {}, "relation_version_is_last": true, "title": ["An Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines"], "weko_shared_id": null}
An Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines
http://hdl.handle.net/2261/26623
http://hdl.handle.net/2261/26623dc98326b-de97-436d-b259-2cf7472dd371
名前 / ファイル | ライセンス | アクション |
---|---|---|
v08n1_02.pdf (356.7 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2009-09-09 | |||||
タイトル | ||||||
タイトル | An Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題 | parsing | |||||
主題Scheme | Other | |||||
キーワード | ||||||
主題 | parallel parsing | |||||
主題Scheme | Other | |||||
キーワード | ||||||
主題 | concurrent object | |||||
主題Scheme | Other | |||||
キーワード | ||||||
主題 | agent | |||||
主題Scheme | Other | |||||
キーワード | ||||||
主題 | HPSG | |||||
主題Scheme | Other | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Ninomiya, Takashi
× Ninomiya, Takashi× Torisawa, Kentaro× Tsujii, Jun'ichi |
|||||
著者所属 | ||||||
著者所属 | Department of Information Science, Graduate School of Science, University of Tokyo | |||||
著者所属 | ||||||
著者所属 | Information and Human Behavior, PRESTO, Japan Science and Technology Corporation | |||||
著者所属 | ||||||
著者所属 | CCL, UMIST | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We describe an agent-based parallel HPSG parser that operates on shared-memory parallel machines. It efficiently parses real-world corpora by using a wide-coverage HPSG grammar. The efficiency is due to the use of a parallel parsing algorithm and the efficient treatment of feature structures. The parsing algorithm is based on the CKY algorithm, in which resolving constraints between a mother and her daughters is regarded as an atomic operation. The CKY algorithm features data distribution and granularity of parallelism. The keys to the efficient treatment of feature structures are i) transferring them through shared-memory, ii) copying them on demand, and iii) writing/reading them simultaneously onto/from memory. Being parallel, our parser is more efficient than sequential parsers. The average parsing time per sentence for the EDR Japanese corpus was 78 msec and its speed-up reaches 13.2 when 50 processors were used. | |||||
書誌情報 |
自然言語処理 巻 8, 号 1, p. 21-48, 発行日 2001-01 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 13407619 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AN10472659 | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf | |||||
日本十進分類法 | ||||||
主題 | 007 | |||||
主題Scheme | NDC | |||||
出版者 | ||||||
出版者 | 言語処理学会 | |||||
出版者別名 | ||||||
The Association for Natural Language Processing |