[PDF] Top 20 An Optimal Time Binarization Algorithm for Linear Context Free Rewriting Systems with Fan Out Two

... formal systems for modeling the syntax of nat- ural ...in rewriting systems that enlarge the generat- ive power of context-free grammars, still remain- ing far below the power of the ... See full document

... with fan-out 1 within the p-graph can be easily performed in O(n 2 ), where n is the number of its ...with fan-out one if and only if ...constant time for each of the Θ(n 2 ... See full document

... 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

... 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

... 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

... an algorithm for the uniform LCFRS membership problem whose run- ning time is a fixed polynomial in |w| times an ar- bitrary function in f and r?” By employing pa- rameterized complexity theory, we show ... See full document

... 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

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

... 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 ...rank, fan- ... See full document

... 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

... 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

... an algorithm for CFG parsing with the same time complexity as Valiant’s, but a somewhat simpler divide-and-conquer ...Rytter’s algorithm works by first recursively finding all chart items entirely ... See full document

... the two languages. We develop a theory of binarization for synchronous context-free grammars and present a linear-time algorithm for binarizing synchronous rules when ... See full document

... 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

... 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

... 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

... report PCFG parsing results from the literature 6 in Tab. 3, namely for PCFG parsing with a plain vanilla treebank grammar (K ¨ubler, 2005), for PCFG pars- ing with the Stanford parser (Rafferty and Manning, 2008) ... See full document

... create two different data sets for constituency ...start out with the unmodified NeGra treebank and remove all sentences with a length of more than 30 ... See full document

... Time optimal ontrol problems for a lass of linear multi-input systems are.. onsidered.[r] ... See full document

... LCFRS on the same data. The first contribution of this paper is a series of treebank transformations for NeGra and the DPTB which produces trees of a block degree of at most two. Unlike transforma- tions for PCFG ... See full document