WEKO3
インデックスリンク
アイテム
単一化文法に基づく自然言語解析用オブジェクトクラス群「言の葉」
https://bunkyo.repo.nii.ac.jp/records/3413
https://bunkyo.repo.nii.ac.jp/records/3413add496b2-5384-4bc4-a566-972a014769a0
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
BKSJ140013.pdf (1.3 MB)
|
|
| Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2012-01-17 | |||||||
| タイトル | ||||||||
| タイトル | 単一化文法に基づく自然言語解析用オブジェクトクラス群「言の葉」 | |||||||
| タイトル | ||||||||
| タイトル | Kotonoha a set of object classes for natural language analysis based on unification grammar | |||||||
| 言語 | ||||||||
| 言語 | jpn | |||||||
| 資源タイプ | ||||||||
| 資源タイプ | departmental bulletin paper | |||||||
| タイトル カナ | ||||||||
| その他のタイトル | タンイツカ ブンポウ ニ モトズク シゼン ゲンゴ カイセキヨウ オブジェクト クラスグン コトノハ | |||||||
| 著者 |
松原, 康夫
× 松原, 康夫
|
|||||||
| 著者 | ||||||||
| 値 | Matsubara, Yasuo | |||||||
| 所属機関 | ||||||||
| 値 | 文教大学情報学部 | |||||||
| 内容記述 | ||||||||
| 内容記述タイプ | Abstract | |||||||
| 内容記述 | Natural language understanding is one of the most important problems in artificial intelligence. Until now, the research has been done mainly for English statements. Research for Japanese statements also has been done, but it has not become to the level of one for English. Moreover, it seems that grammatical theory of Japanese has not been proposed in a form easy to analyze by computer. In these days the main interest of research is about meanings of statements. However, it does not mean that the part of analyzing the statement syntactically and taking out the meaning has less importance. A number of grammars called unification grammar which incorporates a mechanism of unification, have been proposed and indicated to be useful for analysis of syntactical phenomena. It is suggested that unification grammars are easy to analyze by computer and are useful to take out the meaning. In many applications of the area of artificial intelligence, the man-machine interface has great importance. If one can interact with an application through a language similar to the natural one, it can be used by unskilled people. In this paper, we propose a set of C+ + classes which can be used to incorporate a language analyzing function into any application program. When a dictionary and a grammar are given in a fixed manner, these can analyze an statement and output a list similar to F-structure of LFG. |
|||||||
| 書誌情報 |
情報研究 en : Information and Communication Studies 巻 14, p. 151-169, 発行日 1993-01-01 |
|||||||
| 出版者 | ||||||||
| 出版者 | 文教大学 | |||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 03893367 | |||||||
| 著者版フラグ | ||||||||
| 出版タイプ | VoR | |||||||
| 本文言語 | ||||||||
| 値 | 日本語 | |||||||
| ID | ||||||||
| 値 | BKSJ140013 | |||||||
