Open AccessHierarchical Matching Beats The Non-Wildcard and Interpretation Tree Model Matching Algorithms
Author(s) -
Robert B. Fisher
Publication year - 1993
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5244/c.7.59
Subject(s) - matching (statistics) , computer science , algorithm , tree (set theory) , blossom algorithm , interpretation (philosophy) , mathematics , statistics , programming language , mathematical analysis
In Fisher[l] we introduced a non-wildcard model matching algorithm that has speed advantages over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom