[PDF] Top 20 Data Driven Parsing with Probabilistic Linear Context Free Rewriting Systems
Has 10000 "Data Driven Parsing with Probabilistic Linear Context Free Rewriting Systems" found on our website. Below are the top 20 most common "Data Driven Parsing with Probabilistic Linear Context Free Rewriting Systems".
Data Driven Parsing with Probabilistic Linear Context Free Rewriting Systems
... 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
9
Data Driven Parsing using Probabilistic Linear Context Free Rewriting Systems
... with Data-Oriented Parsing ...same data as we do in Maier (2010), and obtain an improvement of roughly ...faster parsing is made possible and sentences with a length of up to 40 words can be ... See full document
34
Prefix probabilities for linear context free rewriting systems
... the context of natural language parsing, it has been observed that the vast majority of rules in real world applications can be factorized to some small length, and that excluding the worst-case rules which ... See full document
12
On the Parameterized Complexity of Linear Context Free Rewriting Systems
... 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
9
Optimal Rank Reduction for Linear Context Free Rewriting Systems with Fan Out Two
... Recognition and parsing for a given LCFRS can be carried out in polynomial time on the length of the input string. This is usually done by exploit- ing standard dynamic programming techniques; see for instance ... See full document
9
LR Parsing for LCFRS
... LR parsing is a popular parsing strategy for variants of Context-Free Grammar ...mildly context-sensitive formalisms, such as Tree-Adjoining Gram- ...style parsing algorithm for ... See full document
6
Efficient Parsing of Well Nested Linear Context Free Rewriting Systems
... 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
9
Synchronous Linear Context Free Rewriting Systems for Machine Translation
... synchronous linear context-free rewriting systems as an extension to syn- chronous context-free grammars in which syn- chronized non-terminals span k ≥ 1 continu- ous ... See full document
10
Parsing Linear Context Free Rewriting Systems with Fast Matrix Multiplication
... Nakanishi et al. (1998) develop a matrix multiplication parsing algorithm for multiple context-free grammars (MCFGs). When these grammars are given in a binary form, they can be reduced to binary ... See full document
35
An Optimal Time Binarization Algorithm for Linear Context Free Rewriting Systems with Fan Out Two
... 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
9
Optimal Reduction of Rule Length in Linear Context Free Rewriting Systems
... 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
9
Generalized Multitext Grammars
... to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notational and in- tuitive simplicity of Context-Free Grammar ... See full document
8
Optimal Parsing Strategies for Linear Context Free Rewriting Systems
... tabular parsing algorithm with minimum ...the parsing complexity, of the resulting ...minimize parsing complexity – in fact, no such trade-off is necessary, as rank 2 is always sufficient for optimal ... See full document
8
Discontinuity and Non Projectivity: Using Mildly Context Sensitive Formalisms for Data Driven Parsing
... 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
8
Optimal Head Driven Parsing Complexity for Linear Context Free Rewriting Systems
... for parsing LCFRSs build a dynamic programming chart of recognized nonter- minals bottom-up, in a manner analogous to the CKY algorithm for CFGs (Hopcroft and Ullman, 1979), but with time and space complexity that ... See full document
10
Efficient parsing with Linear Context Free Rewriting Systems
... Discontinuity in constituent structures (cf. figure 1 & 2) is important for a variety of reasons. For one, it allows a tight correspondence between syntax and semantics by letting constituent struc- ture express ... See full document
11
LCFRS binarization and debinarization for directional parsing
... 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
7
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
A Probabilistic Context free Grammar for Disambiguation in Morphological Parsing
... 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
10
Response Generation in Dialogue Using a Tailored PCFG Parser
... a parsing paradigm for natural language generation task, which learns a tailored probabilistic context-free grammar for encoding meaning represen- tation (MR) and its corresponding natural ... See full document
5
Related subjects