The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
A System for Approximate Tree Matching
IEEE Transactions on Knowledge and Data Engineering
Best-Match Retrieval for Structured Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Error-Tolerant Database for Structured Images
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Developing an object-oriented framework for content-based image retrieval
Software—Practice & Experience
Error-Tolerant Sign Retrieval Using Visual Features and Maximum A Posteriori Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast structural query with application to chinese treebank sentence retrieval
Proceedings of the 2004 ACM symposium on Document engineering
Clustering object moving patterns for prediction-based object tracking sensor networks
Proceedings of the 18th ACM conference on Information and knowledge management
Clustered trie structures for approximate search in hierarchical objects collections
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
| Hi-index | 0.14 |
We present an efficient algorithm for retrieving from a database of trees, all trees that differ from a given query tree by a small number additional or missing leaves, or leaf label changes. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. For large randomly generated synthetic tree databases (some having tens of thousands of trees), and on databases constructed from Wall Street Journal treebank, it can retrieve for trees with a small error, in a matter of tenths of a second to about a second.