Sciweavers

1000 search results - page 8 / 200
» Nominal rewriting systems
Sort
View
ACL
2007
13 years 9 months ago
A System for Large-Scale Acquisition of Verbal, Nominal and Adjectival Subcategorization Frames from Corpora
This paper describes the first system for large-scale acquisition of subcategorization frames (SCFs) from English corpus data which can be used to acquire comprehensive lexicons ...
Judita Preiss, Ted Briscoe, Anna Korhonen
DSL
2009
13 years 5 months ago
A Haskell Hosted DSL for Writing Transformation Systems
KURE is a Haskell hosted Domain Specific Language (DSL) for writing transformation systems based on rewrite strategies. When writing transformation systems, a significant amount of...
Andy Gill
ENTCS
2007
111views more  ENTCS 2007»
13 years 7 months ago
Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...
Rocco De Nicola, Michele Loreti
PLILP
1998
Springer
13 years 11 months ago
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
Takahito Aoto
JSC
2007
152views more  JSC 2007»
13 years 7 months ago
Complete involutive rewriting systems
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
Gareth A. Evans, Christopher D. Wensley