Synchronous Context Free Grammars
Synchronous Context Free Grammars and Optimal Parsing Strategies
... 2.1 Synchronous Context-Free Grammars As usual, a CFG has a finite set of rules having the general form A → α , where A is a nonterminal symbol to be rewritten and α is a string of nonterminal ...
37
Synchronous context-free grammars and optimal linear parsing strategies
... Introduction Synchronous Context-Free Grammars (SCFGs) are widely used to model translational equivalence between strings in both the area of compilers for programming languages and, more ...
40
Multi Target Machine Translation with Multi Synchronous Context free Grammars
... of synchronous context-free grammars to handle multiple tar- gets, and describe methods for rule extraction, scoring, pruning, and search with these mod- ...
10
Binarization of Synchronous Context Free Grammars
... (see Figure 12). However, for machine translation, the percentage of synchronous rules that are binarizable is what we care about. We answer this question in both large-scale automatically aligned data and ...
38
Factorization of Synchronous Context Free Grammars in Linear Time
... a Synchronous Context-Free Grammar into an equivalent grammar with a smaller number of nonterminals in each rule enables synchronous parsing algo- rithms of lower ...
8
Prefix Probability for Probabilistic Synchronous Context Free Grammars
... new synchronous rules s U for each possible choice of subset ...of context-free grammars, this is usually circumvented by casting the rules in bi- nary form prior to epsilon rule ...
10
Some Computational Complexity Results for Synchronous Context Free Grammars
... the English component are inverted in the Japanese component, where some additional lexical material is also added. In a SCFG, the ‘derives’ relation is defined on synchronous strings in terms of simultaneous ...
8
Efficient Multi Pass Decoding for Synchronous Context Free Grammars
... However, the mismatch between model score and BLEU score persists. So, we try our algorithm of maximizing expected count of synchronous con- stituents on the trigram forest. We find signifi- cant improvement in ...
9
Synchronous Context Free Tree Grammars
... to context-free grammars, and weaker models of finite-state ...a context-free gram- mar inducing the intersection of two languages, one induced by a given context-free ...
9
Synchronous Context-Free Tree Grammars
... to context-free grammars, and weaker models of finite-state ...a context-free gram- mar inducing the intersection of two languages, one induced by a given context-free ...
9
A Synchronous Context Free Grammar for Time Normalization
... Our synchronous grammar approach to time normal- ization, which handles recursive structures better than existing string-to-string approaches and handles a wider variety of grammars than existing parsing ...
6
On Müller context-free grammars
... 9. Conclusion, open questions We have defined Müller context-free grammars (MCFGs) generating languages of countable words, called MCFLs. The class of MCFLs is clearly closed under substitution and ...
16
Estimation of Probabilistic Context Free Grammars
... If, however, the language of the grammar does not include the null string, then there is an equivalent grammar (one with the same language) that has no null productions and [r] ...
8
CiteSeerX — Context-Free Grammars and Languages
... A grammar is unambiguous if, at each leftmost-derivation step, there is only one rule that can lead to a derivation of the desired string... 3.5 Leftmost Derivations and Ambiguity[r] ...
23
Probabilistic Context Free Grammars for Phonology
... We train the context-free grammar for German on the transcribed and syllabified training corpus with a simple supervised training method (M¨uller, 2001a). The main idea of the training method is that after ...
11
Analyzing ambiguity of context-free grammars
... As the second step, we took the full grammar. Our method succeeded to show unambiguity (using three unfoldings), which implies that the Boltzmann statistics computed according to Voss et al. [ 36 ] are indeed correct. ...
16
5 Context-Free Languages and Grammars
... 〈 adjective 〉 → friendly | furious | moist | green | severed | timey-wimey | little | · · · 〈 verb 〉 → ate | found | wrote | killed | mangled | saved | invented | broke | · · · 〈 adverb 〉 → squarely | incompetently | ...
21
1 Grammars and Context-Free Languages
... most grammars we deal with, there exists exactly one way to generate any given word in the language of the ...some grammars wherein the same word can be generated in more than one ...
11
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
... Besides the possible arguments of a word, a natural-language grammar does well to specify possible head words for those arguments.. A bilexical grammar makes many stip[r] ...
8