计算机科学 ›› 2012, Vol. 39 ›› Issue (7): 190-194.

• 人工智能 • 上一篇    下一篇

基于规则的连用关系标记的自动标识研究

胡金柱,陈江曼,杨进才,舒江波,雷利利   

  1. (华中师范大学计算机科学系 武汉 430079) (华中师范大学国家数字化学习工程技术研究中心 武汉 430079)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Research on Auto-identi行ing of Adjoining Relation Markers Based on Rule

  • Online:2018-11-16 Published:2018-11-16

摘要: 复句中的关系词对研究复句中各分句的语义关系有着重要意义,但在基于规则的关系词自动识别的研究中发现,并非复句中出现的关系标记都是关系词,从中识别出真正的关系词是研究的重点和难点。提出对一种典型的关系标记—位置相邻的关系标记进行自动标记的算法,该算法结合关系词库和关系词提取技术,分析其连用特征。实验表明,该算法对连用关系标记的标识准确率达到72.9%

关键词: 有标复句,连用特征,自动标识,规则

Abstract: Relation words arc of great significance for analyzing the semantic relations between clauses in multiple compound sentences. But in the process of automatic identification of relation words based on rule,we found that not all the relation marks in multiple compound sentence arc relation words, and identifying the relation marks serving as relation words is the key point. An algorithm was proposed to identify typical relation words which are adjacent. I3y combining the relationship marked corpus and the extraction of relation markers, this algorithm uses the feature to identify these markers. Experiments prove that this approach achieves the accuracy of 72. 9 0 0 in the identification of these relation marks.

Key words: Marked compound sentence, Adjoining feature, Auto-markup, Rule

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!