Abstract:
The paper introduces the algorithm, which converts rules to DFA and analyzes the input words that match the DFA's transitions continuously, and then computes the similarity between the input text and the rule. The algorithm solves the problem of partial matching.
摘要: 介绍了基于词法规则的语义对象匹配算法,通过有限状态自动机将文本与描述语义对象的规则匹配,分析连续匹配成功的片段,以计算文本与语义对象的综合相似度,确定二者的匹配程度。该算法的特点是通过引入相似度计算,有效地解决了规则的不完全匹配问题。
关键词:
确定有限自动机,
匹配,
相似度
CLC Number:
LI Yi, HE Weiguo, LI Juanzi. Rule-based Semantic Object Matching Algorithm[J]. , 2005, 31(04): 174-176.
李毅,何伟国,李涓子. 基于词法规则的语义对象匹配算法[J]. , 2005, 31(04): 174-176.