synchronous context-free grammar
A Synchronous Context Free Grammar for Time Normalization
... a synchronous context free grammar. Synchronous rules map the source language to formally defined operators for manipulat- ing times (F IND E NCLOSED , S TART A T E ND O F , ...of ...
6
Issues Concerning Decoding with Synchronous Context free Grammar
... We extracted a GHKM grammar from a Chinese- English parallel corpus with the English side parsed. The corpus consists of 250K sentence pairs, which is 6.3M words on the English side. Terminal-aware ...
5
Improving Semantic Parsing with Enriched Synchronous Context Free Grammar
... WASP (Wong and Mooney, 2006) was strongly influenced by SMT techniques. Although WASP was also using multiple non-terminal symbols in SCFG to guarantee well-formed translations, our work differs from theirs in at least ...
11
Synchronous Linear Context Free Rewriting Systems for Machine Translation
... a synchronous context-free grammar (SCFG) (Chiang, 2007; Zollmann and Venugopal, 2006; Hoang and Koehn, 2010), in par- ticular inversion transduction grammar (ITG) (Wu, ...corpora. ...
10
A Gibbs Sampler for Phrasal Synchronous Grammar Induction
... A synchronous context free grammar (SCFG, (Lewis II and Stearns, 1968)) generalizes context- free grammars to generate strings concurrently in two (or more) ...the context ...
9
Worst Case Synchronous Grammar Rules
... We have shown in the exponent in the complex- ity of polynomial-time parsing algorithms for syn- chronous context-free grammars grows linearly with the length of the grammar rules. While it is very ...
8
Prefix Probability for Probabilistic Synchronous Context Free Grammars
... probabilistic context-free gram- mars but that has never been investigated in the con- text of PSCFGs, ...probabilistic context-free grammar, this problem is defined as ...
10
Synchronous Context Free Grammars and Optimal Parsing Strategies
... In the investigation of the recognition problem for CFGs and SCFGs, a crucial notion is the one of parsing strategy. Recognition algorithms can be seen as sequences of elementary computational steps in which two parse ...
37
Some Computational Complexity Results for Synchronous Context Free Grammars
... for synchronous context-free grammars have been proposed in the literature; see for instance (Chiang, 2004; Chiang, ...paired context-free productions have the same left-hand ...of ...
8
Synchronous Context Free Tree Grammars
... linear context-free rewriting system (LCFRS) (Vijay-Shanker et ...a context-free grammar in which each nonterminal has a fixed number of parameter positions, each of which contains a ...
9
Binarization of Synchronous Context Free Grammars
... on synchronous grammars and tree transducers promise to improve the quality of statistical machine translation output, but are often very computationally ...individual grammar rules due to arbitrary ...
38
Parsing Chinese With an Almost Context Free Grammar
... 2For this and all subsequent examples, a is the Chinese written form, b is its pronuncia- tion, c is its word gloss ' - - ' means there is no directly corresponding word in Engfish, and[r] ...
10
A Variant of Extended Two-dimensional Context-free Picture Grammar
... The set of all picture arrays over Σ is denoted by Σ ∗∗ . A picture language or a two dimensional language over Σ is a subset of Σ ∗∗ . The E2DCF P G [7] is an extension of the P 2DCF G introduced in [6]. The family of ...
8
Synchronous Tree Unification Grammar
... The underlying motivation for the development of Synchronous Tree Unification Grammar (STUG) is to model syntax and valency as separated, yet linked dimensions of natural language signs. This sharply ...
9
Dialogue Act Prediction Using Stochastic Context Free Grammar Induction
... the grammar induction ap- proach shows potential of learning dialogue game- like structures ...alogue context, rather than to evaluate according to a single possible ...
9
Alphabetic Flat Splicing Pure Context-free Grammar Systems
... of grammar system [3] consisting of several grammars that co-operate according to some well-defined protocol is an established area of study, motivated by the idea of modeling distributed complex ...a ...
6
Context Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
... We propose an algorithm for the transfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as a word over a vocabulary of description ...
5
Robust German Noun Chunking With a Probabilistic Context Free Grammar
... between nominative and accusative case is due to the fact that both cases are expressed by identical morphology in the feminine and neutral genders in German. The morphologic similarity between ac- cusative and dative is ...
7
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
Title Generation with Quasi Synchronous Grammar
... In this paper we propose a model for summariza- tion that attempts to capture and optimize these con- straints jointly. We learn both how to select the most important information (the content), and how to render it ...
11