@article{oai:bunkyo.repo.nii.ac.jp:00003413,
 author = {松原, 康夫},
 journal = {情報研究, Information and Communication Studies},
 month = {1993-01-01, 2012-01-17},
 note = {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.},
 pages = {151--169},
 title = {単一化文法に基づく自然言語解析用オブジェクトクラス群「言の葉」},
 volume = {14},
 year = {}
}