Context-Free Grammars
Cross Entropy and Estimation of Probabilistic Context Free Grammars
... Probabilistic context-free grammars are able to de- scribe hierarchical, tree-shaped structures underly- ing sentences, and are widely used in statistical nat- ural language processing; see for ...
8
Estimation of Consistent Probabilistic Context free Grammars
... probabilistic context- free ...of context-free ...tree-adjoining grammars (Schabes, 1992; Sarkar, 1998), for which consistency results have not yet been shown in the ...
8
Splittability of bilexical context free grammars is undecidable
... Bilexical context-free grammars, or 2-LCFGs for short, are specialized context-free grammars where each nonterminal is associated with a terminal symbol representing a lexical ...
13
Synchronous Context Free Grammars and Optimal Parsing Strategies
... synchronous context-free grammars is polynomial in the sentence length for a fixed grammar, but the degree of the polynomial depends on the ...
37
Prefix Probability for Probabilistic Synchronous Context Free Grammars
... possible choice of subset U. In the worst case, this may result in an exponential blow-up of the source grammar. In the case of context-free grammars, this is usually circumvented by casting the ...
10
Dynamic compilation of weighted context free grammars
... Dynamic compilation of weighted context free grammars Dynamic compilation of weighted context free grammars M e h r y a r M o h r i a n d F e r n a n d o C N P e r e i r a A T & T L a b s R e s e a r[.] ...
7
Static Watson-Crick Context-Free Grammars
... Watson-Crick grammars which are classified into three classes: Wat- son-Crick regular grammars, Watson-Crick linear grammars and Watson-Crick context-free ...Watson-Crick ...
12
Weighted and Probabilistic Context Free Grammars Are Equally Expressive
... weighted context-free grammars (WCFGs), where each production is associated with a positive real-valued weight, and probabilistic context-free grammars (PCFGs), where the weights ...
16
Left To Right Parsing and Bilexical Context Free Grammars
... Abstract We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction o[r] ...
8
Object Oriented Parallel Parsing for Context Free Grammars
... Object Oriented Parallel Parsing for Context Free Grammars Object Oriented Parallel Parsing for Context Free Grammars Akinori Yonezmva Ichiro Ohsawa Department of Information Science Tokyo Institute o[.] ...
6
LR(k) Parsing of Coupled Context Free Grammars
... LR(k) Parsing of Coupled Context Free Grammars LIl~(k) I ' m s i n g of C( ut 1 A Cont(xt, ]~ ( c G r a m m a r s ) ) 0 " ~ ~ ~ ' ~ * ~ * G~se]a Pit;sch l ? B l n f o r n l a t i k , U n i v e r s i l[.] ...
5
Probabilistic Context Free Grammars for Syllabification and Grapheme to Phoneme Conversion
... abilistic context-free grammars ...constructed context-free grammars (CFGs) for both syllabication and grapheme-to-phoneme conversion ...
8
Some Computational Complexity Results for Synchronous Context Free Grammars
... This paper investigates some computa- tional problems associated with proba- bilistic translation models that have re- cently been adopted in the literature on machine translation. These models can be viewed as pairs of ...
8
The Ellogon Pattern Engine: Context free Grammars over Annotations
... that grammars are usually associated with sequences of characters and strings, it is feasible to apply them on “sequences” of any kind of objects, which may be far more complex than ...combine grammars with ...
6
Fast Statistical Parsing with Parallel Multiple Context Free Grammars
... We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm by An- gelov (2009) to which we added statisti- ...
9
Binarization of Synchronous Context Free Grammars
... synchronous grammars and tree transducers promise to improve the quality of statistical machine translation output, but are often very computationally ...synchronous context-free grammars and ...
38
Practical Parsing of Parallel Multiple Context Free Grammars
... We discuss four previously published parsing algorithms for parallell multiple context-free grammar (PMCFG), and ar- gue that they are similar to each other, and implement an Earley-style top-down algo- ...
9
Compound Probabilistic Context Free Grammars for Grammar Induction
... Grammar induction has a long and rich history in natural language processing. Early work on gram- mar induction with pure unsupervised learning was mostly negative (Lari and Young, 1990; Car- roll and Charniak, 1992; ...
17
Speeding up parsing of biological context free grammars
... Where copyright permits, full text material held in the repository is made freely available online and can be read, downloaded and copied for noncommercial private study or research pur[r] ...
16
Authorship Attribution Using Probabilistic Context Free Grammars
... In this paper, we have presented our ongoing work on authorship attribution, describing a novel ap- proach that uses probabilistic context-free gram- mars. We have demonstrated that both syntac- tic and ...
5