probabilistic context-free grammars
Estimation of Consistent Probabilistic Context free Grammars
... provide probabilistic context-free grammars with the consistency ...a probabilistic context- free grammar estimated by maximizing the likeli- hood of a sample of parse ...
8
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 ...
16
Cross Entropy and Estimation of Probabilistic Context Free Grammars
... training probabilistic context-free grammars on the basis of a distribution defined over an infinite set of trees, by minimizing the ...of grammars that are trained in this way, namely, ...
8
Estimation of Probabilistic Context Free Grammars
... The assignment of probabilities to the productions of a context-free grammar may generate an improper distribution: the probability of all finite parse trees is less than one.. The condi[r] ...
8
Probabilistic Context Free Grammars for Syllabification and Grapheme to Phoneme Conversion
... We have presented an approach to unsuper- vised learning and automatic detection of sylla- ble boundaries and grapheme-to-phoneme con- version using the standard probability model. Automatic conversion of a string of ...
8
Kullback Leibler Distance between Probabilistic Context Free Grammars and Probabilistic Finite Automata
... Regular expressions, with their procedural counter-part of finite automata (FAs), are not able to describe hierarchical, tree-shaped struc- ture, and thereby seem less suitable than CFGs for full analysis of syntactic ...
7
Statistical Properties of Probabilistic Context Free Grammars
... We present a method, called the relative weighted frequency method, to assign production probabilities that impose proper PCFG distributions on finite parses.. We demonstrate that these [r] ...
30
The information rate and other parameters of probabilistic context free grammars and their parsers
... parsing to go from abutting below the ~eftmost bottom edge of a domino to the next bottom edge at least one input must be matched against, so as there is only a finite number of input sy[r] ...
182
Compound Probabilistic Context Free Grammars for Grammar Induction
... We thus experiment to see if it is possible to use the induced trees to supervise a more flexible generative model that can make use of tree structures—namely, recurrent neural network grammars (RNNG) (Dyer et ...
17
Authorship Attribution Using Probabilistic Context Free Grammars
... We further investigate the use of syntactic infor- mation by building complete models of each au- thor’s syntax to distinguish between authors. Our approach involves building a probabilistic context- ...
5
Prefix Probability for Probabilistic Synchronous Context Free Grammars
... for probabilistic context-free ...for probabilistic context-free grammars, and require considerably more involved proofs of ...
10
Static Watson-Crick Context-Free Grammars
... Sticker systems and Watson-Crick automata are DNA computing models which are based on different principles, but the complementarity relation do exist in a computa- tion or derivation step. In 1998, sticker systems were ...
12
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
Recurrent Neural Networks as Weighted Language Recognizers
... deterministic probabilistic finite-state au- tomata or context-free grammars only one path or derivation exists for any given string, so the identi- fication of the highest-weighted string is ...
11
A Novel Disambiguation Method for Unification Based Grammars Using Probabilistic Context Free Approximations
... Approximation. (Dowding et al., 2001) com- pared (Moore, 1999)’s approach to grammar ap- proximation to (Kiefer and Krieger, 2000). As a ba- sis for the comparison, they chose an English gram- mar written in the ...
7
Prefix Probabilities for Linear Context Free Rewriting Systems
... to context-free ...for probabilistic tree adjoining gram- ...for probabilistic synchronous context-free gram- mars was shown by Nederhof and Satta (2011b), which departed from ...
12
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
Sets of Grammars Between Context Free and Context Sensitive
... 1965 International Conference on Computational Linguistics SETS OF GRAMMARS BETWEEN CONTEXT FREE AND CONTEXT SENSITIVE 16 1965 International Conference on Computational L i n g u i s t i c s SETS OF G[.] ...
14
Efficient Parsing for Bilexical Context Free Grammars and Head Automaton Grammars
... For a common special case that was known to allow On 3 parsing Eisner, 1997, we present an On 3 algorithm with an improved grammar constant.. Lexicalized grammar formalisms are of both t[r] ...
8
Restrictions on Monadic Context Free Tree Grammars
... monadic context- free tree grammars (CFTGs) are ...adjoining grammars (TAGs), it is examined whether the restrictions of linearity and non- deletion on monadic CFTGs are necessary to generate ...
7