Pattern Matching under Polynomial Transformation
نویسندگان
چکیده
منابع مشابه
Pattern Matching under Polynomial Transformation
We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing where application specific transformations are often applied to the input. By considering the class of polynomial transformations of the input, we provide fast a...
متن کاملTransformation of Attributed Trees Using Pattern Matching
This paper describes a tool for the transformation of attributed trees using pattern matching. The trees to be processed are defined by a formalism based on contextfree grammars. Operations for trees such as composition and decomposition are provided. The approach can be characterized as an amalgaraation of trees or terms including pattern matching, with recursion, attribute grammars, and imper...
متن کاملTransformation Rules for Knowledge-Based Pattern Matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. For example, rule-based classification requires matching rule antecedents with working memory; information retrieval requires matching queries with documents; and some knowledge-acquisition tasks require matching new information with already encoded knowledge to expand upon and debug both of them....
متن کاملOptimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming languages. The main originality is to support pattern matching against native data-structures like objects or records. While crucial to the efficient implementation of functional languages as well as rewrite rule bas...
متن کاملOptimizing Pattern Matching by Program Transformation
The compilation of pattern matching constructs is crucial to the efficient implementation of functional languages like ML, Caml, or Haskell as well as rewrite rule based languages such as ASF+SDF, ELAN, Maude, or Stratego for example. Until now, the classical approach was to compute an (optimized) automaton before generating, in a straight-forward way, the corresponding implementation code. Opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/110853327