for machine learning. We present an algorithm, RAPIER, that uses pairs of sample documents and filled templates to induce pattern-match rules that directly extract fillers for the slots in the template. RAPIER is a bottom-up learning algorithm that incorporates techniques from several inductive logic

learning. We present a system, Rapier, that uses pairs of sample documents and lled templates to induce pattern-match rules that directly extract llers for the slots in the template. Rapier employs a bottom-up learning algorithm which incorporates techniques from several inductive logic programming systems

generalizes to higher-dimensional pattern-matching problems.

In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear

their expectations accordingly. Because the policymaker has the power to create inflation shocks ex post, the equilibrium growth rates of money and prices turn out to be higher than otherwise. Therefore, enforced commitments (rules) for monetary behavior can improve matters. Given the repeated interaction between

Abstract. Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on types for authenticity did not allow for such nested cryptography. In this work, we present the pattern-matching

Implementation of a rule-based transformation engine consists of several tasks with various abstraction levels. We present a new tool called mtom for the efficient implementation of rule-based transformations. This engine should help to bridge the gap between rewriting implementations and practical

Abstract--A pattern-matching feature for the Prolog language is described. Through the use of patterns, introduced as Prolog predicates, the feature favors the specification f string handling algorithms in a declarative style. A number of convenient pre-defined patterns, adapted from SNOBOL 4

Pattern-matching can be used to develop query languages for information retrieval/extraction tasks. The operational basis is simple, since documents and queries can be represented using the same kind of structure, documents or fragments that satisfy the query and which would be those

Parallel pattern-matching (PPM) provides true commutative implementation of functions defined by cases in functional languages, because no argument is given precedence over any other. However, the requirement for concurrency (in general) to support these semantics means that current implementations