rewriting rules
Parser Which Learns the Application Order of Rewriting Rules
... Parser Which Learns the Application Order of Rewriting Rules COLING 82, J Horeck) (?d,) North Holland Publishing Company ? Academia, 1982 A Parser Which Learns the Application Order of Rewriting Rules[.] ...
6
Efficient Transformation Based Parsing
... In transformation-based parsing, an ordered sequence of tree-rewriting rules tree transformations are applied to an initial parse structure for an input sentence, to derive the final par[r] ...
8
Relaxing and Restraining Queries for OBDA
... In this paper, we advocate a novel use of ontologies comple- mentary to OBDA query answering. Namely, we use ontolo- gies to modify queries, relaxing or restraining them, so that they can retrieve either more or less ...
8
Array P Systems and t−Communication
... We have examined in this paper the relationship between the two array generating models, namely ar- ray grammar systems and array P systems by extending the t−derivation mode of cooperating array grammar systems [5] to ...
15
Volume 2: Petri Nets and Graph Transformations
... We have developed a tool to analyze, simulate, and verify systems that are modeled with MCRN. On the basis of the equivalence between Petri nets and MCRN, we have initially opted to develop a tool that exploits the ...
14
Volume 4: Graph and Model Transformation 2006
... Rewriting rules can be made more relevant to software engineering models if the metamodel- based specification of the transformations allows assigning OCL constraints to the individual transformation ...the ...
13
Volume 18: Graph Transformation and Visual Modeling Techniques 2009
... multiset rewriting rules with activity nodes, according to an execution model where activities are defined by the (multi)sets of resources they produce or ...control rules can be formally composed, ...
13
Data driven Morphology and Sociolinguistics for Early Modern Dutch
... manual rules combined with automatic translation pair extraction as well as the method using the Moses toolkit show a substantial improvement over the baseline perfor- ...of rewriting rules. ...
7
Mining Rules for Rewriting States in a Transition based Dependency Parser for English
... mining rewriting rules, and section 22 for ...dozen rewriting rules mined using the proposed method under a minimum support threshold of ...
16
Dependency Parsing with Graph Rewriting
... graph rewriting rules for dependency pars- ...of rules and we do not use any statistical ...Graph Rewriting in the gen- eral setting, we will necessarily have to deal with exponential number ...
10
The Acquisition and Use of Context Dependent Grammars for English
... • Parsing with context-sensitive rules generalizes from phrase structure rewriting rules to the transformational rules required b y case analysis.. Since the case analysis rules retain a[r] ...
28
On the expressiveness and monitoring of metric temporal logic
... We now have a way to detect the informative good/bad prefixes for an arbitrary MTL[U, S] formula ϕ: use the rewriting rules to obtain ϕ, ˆ and apply the monitoring procedure we described[r] ...
53
Modular Graph Rewriting to Compute Semantics
... graph rewriting system presented in the paper was merely here to illustrate the method, which can be used for other input and output ...of rules and enrich it with new rules to get a finer semantic ...
10
Splicing Operation on Graphs
... The application of rules is in parallelism mode, since it contains at most one nonterminal string in any sentential form. All the values in a linear string graph grammar can be kept in a single membrane with empty ...
5
Rewriting Schemes for Flash Memory
... Rank-modulation rewriting codes were proposed in [45, Section IV], with respect to a rewriting method called ...this rewriting method, the charge level of a single cell is pushed up to be higher than ...
159
Tree Adjoining Grammars Are Not Closed Under Strong Lexicalization
... CFG rules can be viewed as elementary trees of depth one, and because context-free rewriting can be simulated by the substitution operation defined for TAGs, we can view any CFG as a special ...
14
On the Parameterized Complexity of Linear Context Free Rewriting Systems
... The rewriting head non-deterministically picks an instance number for a round of rewriting (single rule application) from a pool sufficiently large to differentiate between the maximal number of non- ...
9
JIT costing adaptive skeletons for performance portability
... Contributions. The paper describes the design of the Adaptive Skeletons (AS) framework (Section 3). Figure 1 shows a block diagram of the components of the framework and their interactions. The execution engine and trace ...
9
Rewriting the Scottish Canon: the Contribution of Women’s and Gender History to a Redefinition of Social Classes
... Rewriting the Scottish Canon the Contribution of Women’s and Gender History to a Redefinition of Social Classes Études écossaises 16 | 2013 Ré écrire l’Écosse histoire Rewriting the Scottish Canon the[.] ...
19
Sentence Rewriting for Semantic Parsing
... We conduct experiments on the benchmark WEBQUESTIONS dataset (Berant et al., 2013). Experimental results show that our method can ef- fectively resolve the vocabulary mismatch prob- lem and achieve accurate and robust ...
12