[PDF] Top 20 Optimal Head Driven Parsing Complexity for Linear Context Free Rewriting Systems

... translation systems (Zhang et ...as head-driven strategies, although, as machine translation systems improve, lexicalized rules may become important in this setting as ...computational ... See full document

... Synchronous Context-Free Gram- mar (SCFG) (Uno and Yagiura, 2000; Zhang et ...the context of dependency parsing, where the need for formalisms with higher fan-out has been observed even in ... See full document

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

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

... descriptional complexity of ...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 ... See full document

... the parsing complexity that comes with allowing discontinuities, this is a promising finding since it has already been shown for monolingual parsing that restricting the fan-out to 2 drastically ... See full document

... the parsing problem for LCFRSs with f = 2 is NP-complete (Satta, 1992), and in known parsing algorithms the running time is exponentially affected by the rank r of the ...language parsing ... See full document

... has optimal time complexity, since it works in linear time with respect to the input production ...in linear time, since the problem of binarization for LCFRS in general, ... See full document

... that Context-Free Grammar (CFG) does not provide enough expressivity to de- scribe natural ...CFG parsing, some of the information present in constituency treebanks, namely the annotation of ... See full document

... for context summary estimation of parse items, and to an experimental evaluation of their ...best-first parsing context or as estimates for A ∗ ... See full document

... formalism for machine translation, as well as the de- sire to handle even more general synchronous gram- mar formalisms which allow nonterminals to cover discontinuous spans in either language (Melamed et al., 2004; ... See full document

... only on sentences with a length of up to 15 words. On those sentences, we obtain 83.97. The crucial difference between DPSG rules and LCFRS rules is that the former explicitly specify the material that can occur in gaps ... See full document

... computational complexity is such that until now, the length of sentences needed to be ...minimize parsing complexity, but the current paper shows that these techniques are not sufficient to parse ... See full document

... of complexity-reducing chart constraints do not interfere with the operation of high-accuracy, state- of-the-art parsing approaches, existing pruning tech- niques used within such parsers can obscure the ... See full document

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

... simple context-free tree ...monadic context-free tree languages was answered in (M¨onnich, ...simple context-free gram- mars, a result that would require a completely differ- ent ... See full document

... heads, Head-Driven (HD) models have been proposed by (Magerman, 1995; Char- niak, 1997; Collins, ...the head daughter is generated first, con- ditioned on properties of the mother ...the head ... See full document

... and parsing languages with less strict word-order implies that morphology provides important information about constituents that have been moved or extra- ... See full document

... Mildly Context-Sensitive Grammar (MCSG), while satisfying both of the above ...by context-free grammars, such as clitic climbing, extraposition, and other types of long- distance movement (Becker et ... See full document

... the context of lexicalization is whether the restriction of a given class of grammars to lexicalized form has any impact on the generative or computational properties of the ... See full document