102 search results - page 5 / 21 » Tile Rewriting Grammars |
COLING
2000
13 years 8 months ago
2000
We present a noun chunker for German which is based on a head-lexicalised probabilistic contextfl'ee grammar. A manually developed grammar was semi-automatically extended wit...
TCS
2010
13 years 5 months ago
2010
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
LATA
2009
Springer
14 years 1 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
CALCO
2009
Springer
14 years 1 months ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
FOSSACS
2004
Springer
14 years 3 days ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...