[PDF] Top 20 Prefix probabilities for linear context free rewriting systems
Has 10000 "Prefix probabilities for linear context free rewriting systems" found on our website. Below are the top 20 most common "Prefix probabilities for linear context free rewriting systems".
Prefix probabilities for linear context free rewriting systems
... Seki et al. (1991, Thm 3.9(3), pg. 203) have shown that the class of languages generated by LCFRSs are closed under intersection with regular lan- guages. 1 The proof is a generalization of the proof that ... See full document
12
Optimal Head Driven Parsing Complexity for Linear Context Free Rewriting Systems
... Similar questions have arisen in the context of machine translation, as the SCFGs used to model translation are also instances of LCFRSs, as already mentioned. For SCFG, Satta and Peserico (2005) showed that the ... See full document
10
Data Driven Parsing using Probabilistic Linear Context Free Rewriting Systems
... We bring together these developments by presenting a parser for Probabilistic LCFRS (PLCFRS), continuing the promising work of Levy (2005). Our parser pro- duces trees with crossing branches and thereby accounts for ... See full document
34
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
Discontinuity and Non Projectivity: Using Mildly Context Sensitive Formalisms for Data Driven Parsing
... We present a parser for probabilistic Linear Context-Free Rewriting Systems and use it for constituency and dependency treebank pars- ing. The choice of LCFRS, a formalism with an ... See full document
8
Efficient Parsing of Well Nested Linear Context Free Rewriting Systems
... these systems can always be transformed, in an efficient way, into a specific normal form with no more than two nonterminals in their productions’ right-hand ... See full document
9
Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two
... casting context-free gram- mars into binary ...the context- free case, for LCFRS there are worst case gram- mars in which rank reduction is not possible at all, as shown in (Rambow and Satta, ... See full document
9
Generalized Multitext Grammars
... nizing context-free grammars recently proposed by Melamed ...synchronous rewriting is implemented by means of an indexing relation that is maintained over occurrences of nonterminals in a sentential ... See full document
8
An Optimal Time Binarization Algorithm for Linear Context Free Rewriting Systems with Fan Out Two
... Our algorithm has optimal time complexity, since it works in linear time with respect to the input production length. It still needs to be invest- igated whether the proposed technique, based on determinization of ... See full document
9
Prefix Probability for Probabilistic Synchronous Context Free Grammars
... synchronous rewriting or tree transduc- tion. Probabilistic synchronous context-free gram- mars (PSCFGs) are one among the most popular ex- amples of such ...and systems which extract rules ... See full document
10
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
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
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
Optimal Parsing Strategies for Linear Context Free Rewriting Systems
... a Linear Context-Free Rewrit- ing System (LCFRS) into two simpler produc- tions by factoring out a subset of the nontermi- nals on the production’s righthand ... See full document
8
Synchronous Linear Context Free Rewriting Systems for Machine Translation
... community, linear context-free rewriting systems (LCFRS) have been established as an appropriate formalism for the mod- eling of discontinuous structure (Maier and Lichte, 2011; ... See full document
10
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- ... See full document
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] ... See full document
7
Data Driven Parsing with Probabilistic Linear Context Free Rewriting Systems
... Data-driven parsing has largely been dominated by Probabilistic Context-Free Grammar (PCFG). The use of PCFG is tied to the annotation princi- ples of popular treebanks, such as the Penn Tree- bank (PTB) ... See full document
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] ... See full document
8
Parsing Linear Context Free Rewriting Systems with Fast Matrix Multiplication
... formalisms that were developed independently and later shown to be weakly equiv- alent by Vijay-Shanker and Weir (1994): tree-adjoining grammars (Joshi and Schabes 1997), linear indexed grammars (Gazdar 1988), ... See full document
35
Related subjects