[PDF] Top 20 Data Driven Parsing using Probabilistic Linear Context Free Rewriting Systems

... Most constituency treebanks rely on an annotation backbone based on Context-Free Grammar (CFG). Discontinuities cannot be modeled with CFG, because they require a larger domain of locality than the one ... See full document

... Before parsing, we binarize the extracted LCFRS. For this we first apply Collins-style head rules, based on the rules the Stanford parser (Klein and Manning, 2003b) uses for NeGra, to mark the resp. head daughters ... See full document

... Linear Context-Free Rewriting System (LCFRS) (Vijay-Shanker et ...for data-driven parsing of such structures (Maier and Kallmeyer, 2010; Kallmeyer and Maier, 2013; van ... See full document

... of probabilistic linear context-free rewriting systems ...the probabilistic simple RCGs discussed by Maier and Søgaard (2008) and by Kallmeyer and Maier (2010), and ... See full document

... To optimize the tabular algorithm time complexity of parsing with a binary LCFRS, equivalent to another non-binary LCFRS, we would want to minimize the time com- plexity it takes to parse each rule. As such, our ... See full document

... of context-sensitive grammars. On this line of investigation, mildly context-sensitive grammar formalisms have been introduced (Joshi, 1985), including, among several others, the tree ad- joining grammars ... 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

... While our results are mostly intractability re- sults, we see them as a first step towards a more finely grained understanding of the complexity of LCFRS parsing. Ruling out simple parameteri- zation by fan-out or ... 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 reduces ... See full document

... We have presented an algorithm for the binariza- tion of a LCFRS 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 ... See full document

... equivalence means that the derivations of the orig- inal grammar can be reconstructed using some sim- ple homomorphism (c.f. Nijholt, 1980). Our contri- bution is significant because the existing algorithms for ... See full document

... to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notational and in- tuitive simplicity of Context-Free Grammar ... See full document

... training data, which includes various languages, can be binarized by their algorithm, but they do not give the fan-out or parsing complexity of the resulting ...be parsing in time O(n 3k+4 ) for ... See full document

... eral LCFRS rules as input. G´omez-Rodr´ıguez et al. (2009) present an algorithm for binarization of LCFRSs while keeping fan-out as small as possi- ble. The algorithm is exponential in the resulting fan-out, and ... See full document

... In data-driven parsing with Linear Context-Free Rewriting System (LCFRS), markovized gram- mars are obtained through the annotation of bi- narization non-terminals during ... See full document

... guide parsing of an LCFRS ...ter parsing with the coarse grammar, the result- ing chart is pruned by removing all items that fail to meet a certain ...When parsing with the fine grammar, whenever a ... See full document

... that Context-Free Grammar (CFG) does not provide enough expressivity to de- scribe natural ...For data-driven probabilis- tic CFG parsing, some of the information present in ... See full document

... of derivations that are possible are fixed, we only need to learn a probabilistic model parameterized by λ. Since the “correct” correspondence between NL words and MR fields is fully accessible, i.e., there is a ... See full document

... Since the pronunciation of a word does not always consists of the concatenation of the pronunciation of the morphemes, because the pronunciation of mor- phemes can be modified in certain[r] ... 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