ALGORITHMS FOR THE CONSTRAINED EDITING DISTANCE BETWEEN ORDERED LABELED TREES AND RELATED PROBLEMS

被引：64
|
作者：
ZHANG, KZ
机构：
[1] Department of Computer Science, The University of Western Ontario, London
来源：
PATTERN RECOGNITION | 1995年 / 28卷 / 03期
关键词：
ORDERED LABELED TREES; CONSTRAINED EDITING DISTANCE; APPROXIMATE TREE MATCHING;
D O I：
10.1016/0031-3203(94)00109-Y
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper considers the problem of computing a constrained editing distance between ordered labeled trees. This distance metric can be applied to pattern recognition, syntactic tree comparison, classification tree comparison and other applications. The problem of approximate ordered tree matching is also considered. We present optimal algorithms for solving these problems in sequential time O(\T-1\ x \T-2\).
引用
收藏
页码：463 / 474
页数：12
相关论文
共 41 条
12345