• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Applied Mathematics & Statistics >An Algorithm for Parsing the Simple Semantic Units Based on Semantic Relevancies
【24h】

An Algorithm for Parsing the Simple Semantic Units Based on Semantic Relevancies

机译：基于语义相关性的简单语义单元解析算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In order to using semantics more effectively in natural language processing, an algorithm for parsing the simple semantic units based on semantic relevancies was proposed. Firstly, the definition of the simple semantic units was given and a grammar was adopted to describe the simple semantic units; then the most appropriate boundaries of simple semantic units could be got for a sentence according to the grammar and several simple semantic units could be tumed from the sentence; the semantic modification graph of the simple semantic units could be created, and the best parsing method would be corresponded with the maximum spanning tree for the semantic modification graph; so the best parsing method could be achieved by the Prim algorithm. Finally some experiments were finished to verify the effeteness for the algorithm.
机译：为了在自然语言处理中更有效地利用语义，提出了一种基于语义相关性的简单语义单元解析算法。首先给出了简单语义单元的定义，并采用语法描述了简单语义单元。然后可以根据语法为句子获取最合适的简单语义单元边界，并从句子中找出几个简单的语义单元。可以创建简单语义单元的语义修改图，并将最佳解析方法与语义修改图的最大生成树相对应。因此，最好的解析方法可以通过Prim算法实现。最后，完成了一些实验以验证算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号