Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
972
Bottom-Up Relational Learning of Pattern Matching Rules for Information Extraction
, 2003
"... Information extraction is a form of shallow text processing that locates a specified set of relevant items in a natural-language document. Systems for this task require significant domain-specific knowledge and are time-consuming and difficult to build by hand, making them a good application for ..."
Abstract
-
Cited by 406 (20 self)
- Add to MetaCart
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
A pattern-matching compiler
- Proceedings of the 1st International Workshop on Language Descriptions, Tools and Applications, volume 44
, 2001
"... 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
-
Cited by 5 (3 self)
- Add to MetaCart
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
Efficient Exact Pattern-matching in Proteomic Sequences
, 2009
"... This paper proposes a novel algorithm for complete exact pattern-matching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficient considering larger alphabets. The searching strategy uses large search windows allowing multiple alignments per iteration. A ..."
Abstract
- Add to MetaCart
This paper proposes a novel algorithm for complete exact pattern-matching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficient considering larger alphabets. The searching strategy uses large search windows allowing multiple alignments per iteration
Pattern-Matching Algorithms based on Term Rewrite Systems?
"... Abstract Automatic code generators often contain pattern matchers that are based on tree grammars. In this work we generalise this approach by developing pattern matchers that are based on more powerful term rewrite systems. A pattern matcher based on a term rewrite system computes all the sequences ..."
Abstract
- Add to MetaCart
are permutations of each other. A theory and a series of algorithms are systematically developed that identify and remove two types of redundant rewrite sequences. These algorithms terminate if rewrite sequences do not diverge. Key words: Term rewrite systems, code generation, pattern matching, formal techniques
Pattern-matching and rewriting rules for group indexed data structures
- ACM SIGPLAN NOTICES
, 2002
"... In this report, we present a new framework for the definition of various data-structures (including trees and arrays) together with a generic language of filters enabling a rule-based programming style of functions. This framework is implemented in an experimental language called MGS. The underlying ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
In this report, we present a new framework for the definition of various data-structures (including trees and arrays) together with a generic language of filters enabling a rule-based programming style of functions. This framework is implemented in an experimental language called MGS
A Proposed Collaborative Approach for Pattern Matching and Replacement Policies for the design of Peephole Optimizer
"... Abstract — In the perspective of peephole optimization, this paper describes a framework that approaches a collaborative fashion for the pattern matching and replacement strategies on the basis of formal exploration of the pattern matching strategies that have been implemented. In the first section, ..."
Abstract
- Add to MetaCart
Abstract — In the perspective of peephole optimization, this paper describes a framework that approaches a collaborative fashion for the pattern matching and replacement strategies on the basis of formal exploration of the pattern matching strategies that have been implemented. In the first section
Abstract Pattern-matching and Rewriting Rules for Group Indexed Data Structures
"... In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-based programming style of functions. This framework is implemented in an experimental language called MGS. The underlying ..."
Abstract
- Add to MetaCart
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-based programming style of functions. This framework is implemented in an experimental language called MGS. The underlying
First-class Rules and Generic Traversal
, 2001
"... In this paper we present a functional language supporting first-class rules and generic traversal. This is achieved by generalizing the pattern matching constructs of standard functional languages. The case construct that ties rules together and prevents their reuse, is replaced by separate, firs ..."
Abstract
-
Cited by 12 (2 self)
- Add to MetaCart
In this paper we present a functional language supporting first-class rules and generic traversal. This is achieved by generalizing the pattern matching constructs of standard functional languages. The case construct that ties rules together and prevents their reuse, is replaced by separate
First-class Rules and Generic Traversal
"... Abstract In this paper we present a functional language supporting first-class rules and generic traversal. This is achieved by generalizing the pattern matching constructs of standard functional languages. The case construct that ties rules together and prevents their reuse, is replaced by separate ..."
Abstract
- Add to MetaCart
Abstract In this paper we present a functional language supporting first-class rules and generic traversal. This is achieved by generalizing the pattern matching constructs of standard functional languages. The case construct that ties rules together and prevents their reuse, is replaced
The Systematic Development of a Pattern-Matching Algorithm using Term Rewrite Systems
, 1997
"... A term rewrite system is used to specify a pattern matcher in a code generator. The pattern matcher derived from the term rewrite system computes all the sequences of rewrite rules that will reduce a given expression tree to a given goal. While the number of sequences of rewrite rules that are gener ..."
Abstract
- Add to MetaCart
A term rewrite system is used to specify a pattern matcher in a code generator. The pattern matcher derived from the term rewrite system computes all the sequences of rewrite rules that will reduce a given expression tree to a given goal. While the number of sequences of rewrite rules
Results 1 - 10
of
972
