rewriting systems
Optimal Reduction of Rule Length in Linear Context Free Rewriting Systems
... Linear Context-free Rewriting Systems (LCFRS) is an expressive grammar formalism with applications in syntax-based machine translation. The parsing complexity of an LCFRS is exponential in both the rank of ...
9
Prefix Probabilities for Linear Context Free Rewriting Systems
... In this paper we focus on a much more general formalism than those mentioned above, namely that of probabilistic linear context-free rewriting systems (PLCFRS). This formalism is equivalent to the ...
12
Efficient parsing with Linear Context Free Rewriting Systems
... Previous work on treebank parsing with discontinuous constituents using Linear Context-Free Rewriting systems ( LCFRS ) has been limited to sentences of up to 30 words, for reasons of computational com- ...
11
Parallelization of Termination Checker of Term Rewriting Systems
... In order to automate and accelerate the MRIt, we propose parallelizing the lexicographic path order method, which is a traditional termination check method, by using multi- core CPU. In this paper we discuss the problem ...
6
Synchronous Linear Context Free Rewriting Systems for Machine Translation
... context-free rewriting systems as an extension to syn- chronous context-free grammars in which syn- chronized non-terminals span k ≥ 1 continu- ous blocks on each side of the ...
10
MoL 2011 16: Completing partial algebra models of term rewriting systems
... Term rewriting systems play a fairly large role in theoretical computer science, as an abstraction of the process of ...term rewriting system con- sists of a set of terms and a set of rules for ...
51
Optimal Head Driven Parsing Complexity for Linear Context Free Rewriting Systems
... Linear Context-Free Rewriting Systems (LCFRSs) (Vijay-Shankar et al., 1987) constitute a very general grammatical formalism which subsumes context- free grammars (CFGs) and tree adjoining grammars (TAGs), ...
10
Data Driven Parsing using Probabilistic Linear Context Free Rewriting Systems
... Context-Free Rewriting Systems (LCFRSs) (Vijay-Shanker, Weir, and Joshi 1987) have been estab- lished as a candidate for modeling both discontinuous constituents and non-projective dependency trees as they ...
34
Parsing Linear Context Free Rewriting Systems with Fast Matrix Multiplication
... Our starting point for this discussion is head grammars. Head grammars are a specific case of linear context-free rewriting systems, not just in the formal languages they define—but also in the way these ...
35
Data Driven Parsing with Probabilistic Linear Context Free Rewriting Systems
... This paper presents a first efficient imple- mentation of a weighted deductive CYK parser for Probabilistic Linear Context- Free Rewriting Systems (PLCFRS), to- gether with context-summary estimates for ...
9
Linear Context Free Rewriting Systems and Deterministic Tree Walking Transducers
... The class of output languages of deterministic tree-walking transducers is known to be equal to the class of yields of images of the regular tree languages under finite-copying top-down [r] ...
8
Optimal Parsing Strategies for Linear Context Free Rewriting Systems
... Gómez-Rodríguez et al. (2009a) recently examined the problem of transforming arbitrary grammars in the Linear Context-Free Rewriting System (LCFRS) formalism (Vijay-Shankar et al., 1987) in order to reduce the ...
8
Efficient Parsing of Well Nested Linear Context Free Rewriting Systems
... The freedom in the rearrangement of components has specific consequences in terms of the computa- tional and descriptional complexity of LCFRS. Even for grammars with bounded fan-out, the universal recognition problem is ...
9
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
Recognition of Linear Context Free Rewriting Systems
... CONFIGURATIONS As seen in Section 2, LCFRS2 is the class of all L C F R S of fan-out bounded by two, and the membership problem for the corresponding class of languages is NP-complete.. [r] ...
7
Volume 72: Proceedings of the 15th International Workshop on Automated Verification of Critical Systems (AVoCS 2015)
... of systems and ...hedge rewriting systems and explore the applicability of the very general method based on disproving the first-order formulae by finding a ...
15
Generalized Multitext Grammars
... Generalized Multitext Grammar (GMTG) is a syn- chronous grammar formalism that is weakly equiv- alent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notational and in- tuitive ...
8
Automated Proof and Discovery of Inductive Theorems with Rewriting Induction over Multi-Context Reasoning Systems: State-of-the-Art Technologies and Perspectives
... In 2012, the implementation scheme of termination checkers used in multi-completion was improved [9]. Before this study, the termination checker had involved a performance bottleneck that prevented multi-context ...
6
First-order finite satisfiability vs tree automata in safety verification
... Abstract. In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a ...
16
A 2 Categorical Approach to Bisimulation Congruences (talk)
... Well-known Reactive Systems ➤ Term rewriting systems ➤ Graph rewriting systems ➤ via cospans ➤ Simple process calculi ➤ with terms up to structural congruence... ➤ a relative pushout RPO[r] ...
48