计算机科学 ›› 2009, Vol. 36 ›› Issue (10): 244-246.

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

基于遗传算法的隐马尔可夫模型在名词短语识别中的应用研究

李荣,郑家恒,郭梅英   

  1. (忻州师范学院计算机系 忻州 034000);(山西大学计算机与信息技术学院 太原 030006)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金(60776041),山西省忻州师范学院科研基金(200623)资助。

Application Study of Hidden Markov Model Based on Genetic Algorithm in Noun Phrase Identification

LI Rong, ZHENG Jia-heng, GUO Mei-ying   

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

摘要: 为了进一步提高名词短语的识别精度,针对遗传算法和隐马尔可夫模型各自的特点,提出一种基于遗传算法的隐马尔可夫模型识别方法。该方法是在高准确率词性标注的基础上实现的。在训练阶段,用遗传算法获取HMM参数;识别阶段先用一种改进的Viterbi算法进行动态规划,识别同层名词短语,然后用逐层扫描算法和改进Viterbi算法相结合来识别嵌套名词短语。实验结果表明,此联合算法达到了94. 78%的准确率和94. 29%的召回率,充分融合了遗传算法和隐马尔可夫模型的优点,证明它较单一的隐马尔可夫模型识别法具有更好的识别效果。

关键词: 短语识别,遗传算法,隐马尔可夫模型,Viterbi算法,层次分析

Abstract: To increase further the accuracy of noun phrase(NP) identification and utilize features of the genetic algorithm(GA) and the hidden markov modcl(HMM),a novel HMM identification method based on GA was proposed. The method was based on a high-performance POS(parts of speech) tagging. During the training phase, model parameters were gained by the genetic algorithm. And during the identifying phase, an improved Viterbi algorithm for dynamic programming was first presented to identify the same hierarchy noun phrase, then the combination method of hierarchical syntax parsing and Viterbi algorithm was brought forward to identify those recursive noun phrases. Experimental resups show that this combined algorithm has achieved a high precision and recall rate of 94. 78 0 0 and 94. 29 0 0,rcspcctively,fully inosculating the strength of genetic algorithms and hidden markov model. This proves that the combination method has much better identification effect than the unitary hidden markov model identification approach.

Key words: Phrase recognition, Genetic algorithm, Hidden markov model, Viterbi algorithm, Hierarchical analysis

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!