• No results found

[PDF] Top 20 Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two

Has 10000 "Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two" found on our website. Below are the top 20 most common "Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two".

Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two

Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two

... an optimal hierarchical decomposition of an input bundle with fan-out 1 or ...is optimal in so far as the maximum arity of the decomposition tree is as small as ...in optimal ... See full document

9

An Optimal Time Binarization Algorithm for Linear Context Free Rewriting Systems with Fan Out Two

An Optimal Time Binarization Algorithm for Linear Context Free Rewriting Systems with Fan Out Two

... with fan-out 2 that does not in- crease the fan-out, and have discussed how this can be applied to improve parsing efficiency in several practical ...with fan-out ≤ 2 does not ... See full document

9

Recognition of Linear Context Free Rewriting Systems

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] ... See full document

7

Efficient Parsing of Well Nested Linear Context Free Rewriting Systems

Efficient Parsing of Well Nested Linear Context Free Rewriting Systems

... coupled context-free grammars (CCFG), introduced by Hotz and Pitsch ...than two nonterminals to appear in the right-hand side of a production, even though no nonterminal may contribute more than ... See full document

9

Prefix Probabilities for Linear Context Free Rewriting Systems

Prefix Probabilities for Linear Context Free Rewriting Systems

... synchronous context-free grammars (Nederhof and Satta, ...chronous context-free grammar can be expressed in terms of a restricted type of ...have fan-out 2, and all generated ... See full document

12

On the Parameterized Complexity of Linear Context Free Rewriting Systems

On the Parameterized Complexity of Linear Context Free Rewriting Systems

... the rank of the grammar to one, the mem- bership problem, parameterized by the fan-out, is ...the fan-out to two and tak- ing the rank as the parameter, the problem is ... See full document

9

Optimal Head Driven Parsing Complexity for Linear Context Free Rewriting Systems

Optimal Head Driven Parsing Complexity for Linear Context Free Rewriting Systems

... translation systems (Zhang et ...translation systems improve, lexicalized rules may become important in this setting as ...the fan-out of these models is bounded by two, while in our ... See full document

10

Data Driven Parsing using Probabilistic Linear Context Free Rewriting Systems

Data Driven Parsing using Probabilistic Linear Context Free Rewriting Systems

... of fan-out ...between two components always means that there is actually a non-empty gap in between ...Consequently, two different components in a right-hand side can never be adjacent in the ... See full document

34

Optimal Parsing Strategies for Linear Context Free Rewriting Systems

Optimal Parsing Strategies for Linear Context Free Rewriting Systems

... of rank two and increasing fan-out provide an infinite hierarchy of increasing generative capacity, we see that parsing complexity also provides such an infinite ...arbitrary rank and ... See full document

8

Optimal Reduction of Rule Length in Linear Context Free Rewriting Systems

Optimal Reduction of Rule Length in Linear Context Free Rewriting Systems

... Synchronous Context-Free Gram- mar (SCFG) (Uno and Yagiura, 2000; Zhang et ...a fan-out of ...stretch out over three rather than two continuous ...the context of ... See full document

9

Synchronous Linear Context Free Rewriting Systems for Machine Translation

Synchronous Linear Context Free Rewriting Systems for Machine Translation

... allow two blocks per constituent, (almost) all manual alignments can be generated, depending on whether the normal-form is enforced or ...the fan-out to 2 drastically reduces parsing times (Maier et ... See full document

10

Efficient parsing with Linear Context Free Rewriting Systems

Efficient parsing with Linear Context Free Rewriting Systems

... on fan-out or parsing complexity, while in the head-driven case there is a minimal improvement because of a single production with parsing complexity 15 with- out optimal ...the optimal ... See full document

11

Discontinuous Data Oriented Parsing: A mildly context sensitive all fragments grammar

Discontinuous Data Oriented Parsing: A mildly context sensitive all fragments grammar

... The algorithm is deceptively simple. Most of the work is in producing all items that can be deduced from a given item and items in the chart. This in- volves iterating over all grammar rules with matching labels, and ... See full document

11

Tree Adjoining Grammars Are Not Closed Under Strong Lexicalization

Tree Adjoining Grammars Are Not Closed Under Strong Lexicalization

... Two important results about strong lexicalization have been obtained by Schabes (1990). The first result is that CFGs are not closed under strong lexicalization. (The author actually shows a stronger result ... See full document

14

LR Parsing for LCFRS

LR Parsing for LCFRS

... In the parse table, our operations are s(p, q) for shifting some terminal a followed by the old ad- dress concatenated with p and state q and r(α, i) for reducing the ith component of rule α. The two reduce ... See full document

6

LCFRS binarization and debinarization for directional parsing

LCFRS binarization and debinarization for directional parsing

... the fan-out of the grammar by reducing the number of gaps in the trees from which the grammar is ex- ...grammar fan-out of 2 is guar- ... See full document

7

Generalized Multitext Grammars

Generalized Multitext Grammars

... synchronous rewriting systems (Rambow and Satta, ...the rewriting process of GMTG does not increase the generative power beyond the above mentioned ... See full document

8

Combinatory Categorial Grammars: Generative Power and Relationship to Linear Context Free Rewriting Systems

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

PLCFRS Parsing Revisited: Restricting the Fan Out to Two

PLCFRS Parsing Revisited: Restricting the Fan Out to Two

... 4 PLCFRS for Data-Driven Parsing LCFRSs can be extracted directly from treebanks with a direct annotation of discontinuities (Maier and Søgaard, 2008). The difference between treebank PLCFRS and PCFG extraction is, intu- ... See full document

9

Optimal Design of Nonuniform Linear Arrays in Cellular Systems by Out of Cell Interference Minimization

Optimal Design of Nonuniform Linear Arrays in Cellular Systems by Out of Cell Interference Minimization

... of optimal design of linear arrays in a cellular systems under the assumption of Gaussian ...interference. Two design problems are considered: maximization of the ergodic capacity (through ... See full document

9

Show all 10000 documents...