[PDF] Top 20 Linear Context Free Rewriting Systems and Deterministic Tree Walking Transducers
Has 10000 "Linear Context Free Rewriting Systems and Deterministic Tree Walking Transducers" found on our website. Below are the top 20 most common "Linear Context Free Rewriting Systems and Deterministic Tree Walking Transducers".
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] ... See full document
8
Optimal Reduction of Rule Length in Linear Context Free Rewriting Systems
... 5.1 The tradeoff between rank and fan-out The algorithm introduced in this paper can be used to transform an LCFRS into an equivalent form with rank 2. This will result into a more effi- ciently parsable LCFRS, since ... See full document
9
Optimal Parsing Strategies for Linear Context Free Rewriting Systems
... the Linear Context-Free Rewriting System (LCFRS) formalism (Vijay-Shankar et ...spanning tree algorithms (McDon- ald et ...the context of Synchronous Context-Free ... See full document
8
Parsing Linear Context Free Rewriting Systems with Fast Matrix Multiplication
... parse tree, where the spine extends from the root of the tree to the terminal in position n / ...derivation tree may both correspond to multiple spans in the string, each containing material on both ... See full document
35
Data Driven Parsing with Probabilistic Linear Context Free Rewriting Systems
... We bring together these developments by pre- senting a parser for probabilistic LCFRS. While parsers for subclasses of PLCFRS have been pre- sented before (Kato et al., 2006), to our knowl- edge, our parser is the first ... See full document
9
Efficient Parsing of Well Nested Linear Context Free Rewriting Systems
... these systems lack Chomsky-like normal forms for fixed fan-out (Rambow and Satta, 1999) that are es- pecially convenient in tabular ...mildly context-sensitive formalisms, and TAG in particular: TAGs can be ... See full document
9
Optimal Head Driven Parsing Complexity for Linear Context Free Rewriting Systems
... Linear Context-Free Rewriting Systems (LCFRSs) (Vijay-Shankar et ...subsumes context- free grammars (CFGs) and tree adjoining grammars (TAGs), as well as the ... See full document
10
Data Driven Parsing using Probabilistic Linear Context Free Rewriting Systems
... developments. Linear Context-Free Rewriting Systems (LCFRSs) (Vijay-Shanker, Weir, and Joshi 1987) have been estab- lished as a candidate for modeling both discontinuous constituents ... See full document
34
Discontinuity and Non Projectivity: Using Mildly Context Sensitive Formalisms for Data Driven Parsing
... that Context-Free Grammar (CFG) does not provide enough expressivity to de- scribe natural ...chose Linear Context-Free Rewriting Systems ... See full document
8
LR Parsing for LCFRS
... of Context-Free Grammar ...mildly context-sensitive formalisms, such as Tree-Adjoining Gram- ...for Linear Context- Free Rewriting Systems (LCFRS), a mildly ... See full document
6
Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two
... a tree, in which each node N corresponds to a bundle (the root node corresponds to the input bundle) and the daughters of N represent the bundles in which N is immediately ...decomposition tree is as small ... See full document
9
Combinatory Categorial Grammars: Generative Power and Relationship to Linear Context Free Rewriting Systems
... Abstract Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Ad[r] ... See full document
8
Non self embedding linear context free tree grammars generate regular tree languages
... mildly context-sensitive formalisms were introduced [14], which can capture more linguistic phenomena than REGs and ...mildly context-sensitive formalisms are linear context-free ... See full document
41
On the Parameterized Complexity of Linear Context Free Rewriting Systems
... ates less than k nonterminals (since the maximum rank is at most k), each of which will generate at most k markers in the derivation in H 0 (since the fanout is at most k). The rule may in addi- tion generate (k + 1)k ... See full document
9
Efficient parsing with Linear Context Free Rewriting Systems
... using Linear Context-Free Rewriting systems ( LCFRS ) has been limited to sentences of up to 30 words, for reasons of computational com- ... See full document
11
Prefix probabilities for linear context free rewriting systems
... The rest of this paper is organized as follows. In Section 2 we introduce PLCFRS and finite-state transducers. In Section 3 we discuss a general al- gorithm for composing a PLCFRS with a finite- state transducer. ... See full document
12
Synchronous Linear Context Free Rewriting Systems for Machine Translation
... Our experiments show that by moving from syn- chronous grammars with only continuous con- stituents to grammars that allow two blocks per constituent, (almost) all manual alignments can be generated, depending on whether ... See full document
10
Discontinuous Data Oriented Parsing: A mildly context sensitive all fragments grammar
... In the present paper we do not deal with evaluation methods, but we take up another, related point. A precondition for a cognitively viable model of exemplar-based syntactic processing, is a cognitively viable definition ... See full document
11
A Generic Parser for Strings and Trees
... extension is based on embedded semantic actions to create instances of the RBA states and transitions. Hence, it constitutes an additional overhead during parsing. However, this overhead is reduced due to the ... See full document
30
Well Nested Tree Languages and Attributed Tree Transducers
... the tree languages generated by context-free hyperedge-replacement graph gram- mars and the latter family is identical with the output languages of logical tree-to-tree transductions ... See full document
10
Related subjects