简单语义单元的语义修饰关系图模型及其求解

Graph Model of the Descriptive Semantic Relationship for the Simple Semantic Units and Its Solution

为了有效地使用语义信息来进行自然语言处理,提出了一个简单语义单元的语义修饰关系图模型并对其求解方法进行了研究;首先提出了简单语义单元的概念,分析了简单语义单元的特点;在生成其语义修饰关系图的基础上,通过近似算法,求取语义修饰关系完全图的最大生成树;从而实现对简单语义单元的语法分析和语义消歧。实验表明,该方法具有一定的可行性。

In order to use semantics more effectively in natural language processing, a graph model of the descriptive semantic relationship for the simple semantic units was proposed and its solution was researched. Firstly the definition of the simple semantic unit was given and its characteristics were discussed. Then the graph of descriptive semantic relations could be created for a simple semantic unit, and the maximum spanning tree of the graph could be got by an approximate algorithm. And the simple semantic unit could be parsed and the word sense could be disambiguated. Finally experiments were finished and the results suggested that the method might be feasible.