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

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

作　　者：刘运通 陈世佳 

机构地区：[1]南阳理工学院计算机与信息工程学院,河南 南阳

出　　处：《计算机科学与应用》2020年第3期408-417,共10页Computer Science and Application

基　　金：河南省教育厅科学技术研究重点项目(18A520002).

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

关 键 词：语义相关度 简单语义单元 语义修饰关系图 最大生成树变量 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]