摘要
文献[1]以公式一为依据,采用文献犤2犦描述的新型递归算法来实现一棵成长型树的全遍历,以找出标准文本和录入文本这两条字符串间的最佳匹配,从理论上解决了考生有稿录入的计算机自动判卷难题。论文则通过加入先验知识来简化一棵成长型树的规模,使得树的全遍历成为可能,并最终获得中英文录入实时判卷算法。
Depending on the new-type recurrence algorithm in thesisto realize a complete search of a non-fixed tree in thesisso as to find the optimal matches between the two text strings,it solves the complex typewriting problem of manuscript by computer automatic marking system in theory.It is possible to obtain the real-time algorithm of marking Chinese or English typewriting in the thesis by reducing the size of a non-fixed tree with prior knowledge.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第22期224-225,232,共3页
Computer Engineering and Applications
关键词
最佳匹配路径
有稿录入
树
best matching path,typewriting with manuscript ,tree