| 摘要 |
This invention provides a novel means for identifying the original tree, whi ch is a member of a dictionary of labeled ordered trees, by processing a potentially Noisy Subsequence-Tree (NSuT). The original tree relates to the NSuT through a Subsequence-Tree (SuT). An S uT is a arbitrary subsequence-tree of the original tree, which is further subjected to substitution, insertion and deletion errors yielding the NSuT. This invention has application to the general area of comparing tree structures which is commonly used in computer science, and in particular to the areas of statistical, syntactic and structural pattern recognition.
|
