probabilistic synchronous contextfree grammars

... translation system based on a prob- abilistic synchronous dependency insertion grammar. Synchronous depend- ency insertion grammars are a version of synchronous grammars defined on de- pendency trees. ... some versions of synchronous grammars pro- vide solutions for the non-isomorphic tree based transduction problem and hence possible solutions for MT. Synchronous Tree Adjoining Grammars, proposed ... 2005. c 2005 Association for Computational Linguistics Machine Translation Using Probabilistic Synchronous Dependency Insertion Grammars Yuan Ding Martha Palmer Department of Computer and Information...

Ngày tải lên: 20/02/2014, 15:20

Ngày tải lên: 23/03/2014, 16:20

Ngày tải lên: 23/03/2014, 16:20

Ngày tải lên: 23/03/2014, 19:20

... efficient application of synchronous rules that do not have a synchronous binarization. The primary contribution of this paper is to es- tablish that binarization of synchronous grammars need not be ... possible in a synchronous binarization. There are rules, though rare, that cannot be binarized synchronously at all (Wu, 1997), but can be incorporated in two-stage decoding with asynchronous binarization. On ... Papers, pages 141–144, Suntec, Singapore, 4 August 2009. c 2009 ACL and AFNLP Asynchronous Binarization for Synchronous Grammars John DeNero, Adam Pauls, and Dan Klein Computer Science Division University...

Ngày tải lên: 20/02/2014, 09:20

... difficulty in applying probabilistic mod- els to natural language is deciding what aspects of the sentence and the discourse are relevant to the model. Most previous probabilistic models of ... conditional probability of rewriting the non- terminal AT/. 32 Towards History-based Grammars: Using Richer Models for Probabilistic Parsing* Ezra Black Fred Jelinek John Lafferty David M. Magerman ... grammar- ian to the statistical estimation methods. We refer to probabilistic methods based on the derivation as History-based Grammars (HBG). In this paper, we explored a restricted imple-...

Ngày tải lên: 20/02/2014, 21:20

... NJ 07932 {abney, dmac, pereira}@research.att.com Abstract Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic push- down automata (PPDAs) have been used for language ... proof of theorem 4 is non- constructive in that it does not provide any 546 Relating Probabilistic Grammars and Automata Steven Abney David McAllester Fernando Pereira AT&T Labs-Research ... approaches are weakly equivalent, they impose different in- ductive biases. 2 Probabilistic and Weighted Grammars For the remainder of the paper, we fix a terminal alphabet E and a nonterminal...

Ngày tải lên: 08/03/2014, 06:20

... Journal of Chinese Information Processing, 18(4):1–8. David Smith and Jason Eisner. 2006. Quasi -synchronous grammars: Alignment by soft projection of syntac- tic dependencies. In Proceedings on the ... CoNLL 2009: Shared Task, pages 37–42. Kevin Gimpel and Noah A. Smith. 2011. Quasi- synchronous phrase dependency grammars for ma- chine translation. In Proceedings of the 2011 Confer- ence on Empirical ... Association for Computational Linguistics Exploiting Multiple Treebanks for Parsing with Quasi -synchronous Grammars Zhenghua Li, Ting Liu ∗ , Wanxiang Che Research Center for Social Computing and Information...

Ngày tải lên: 16/03/2014, 19:20

... characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed. Essentially, ... Unifying synchronous tree adjoining grammars and tree transducers via bimor- phisms. In Proc. EACL, pages 377–384. Association for Computational Linguistics. Stuart M. Shieber. 2007. Probabilistic synchronous tree-adjoining ... Schabes. 1990. Syn- chronous tree-adjoining grammars. In Proc. Com- putational Linguistics, volume 3, pages 253–258. Stuart M. Shieber. 2004. Synchronous grammars as tree transducers. In Proc. TAG+7,...

Ngày tải lên: 17/03/2014, 00:20

... predicate-argument annotations. Most related to our approach, Wu (2005) used inversion transduction grammars a synchronous context-free formalism (Wu, 1997)—for this task. Wu reported only positive-class ... part-of-speech tagging. In Proc. of EMNLP. David A. Smith and Jason Eisner. 2006. Quasi- synchronous grammars: Alignment by soft projec- tion of syntactic dependencies. In Proc. of the HLT- NAACL ... 2007. What is the Jeopardy model? a quasi- synchronous grammar for QA. In Proc. of EMNLP- CoNLL. Dekai Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Comput....

Ngày tải lên: 17/03/2014, 01:20

... results to our knowledge on learning synchronous grammars that generate logical forms. Using statistical machine translation techniques, a semantic parser based on a synchronous context-free grammar ... successfully put into use in syntax- based SMT are synchronous context-free gram- mars (SCFG) (Wu, 1997) and synchronous tree- substitution grammars (STSG) (Yamada and Knight, 2001). Both formalisms ... between natural languages (NL). In generating multiple parse trees in a single deriva- tion, synchronous grammars are ideal for model- ing syntax-based translation because they describe not only...

Ngày tải lên: 17/03/2014, 04:20

Ngày tải lên: 23/03/2014, 17:20

Ngày tải lên: 23/03/2014, 18:20

Ngày tải lên: 23/03/2014, 19:20

Ngày tải lên: 31/03/2014, 20:20

... describe our adapting the probabilistic framework to Vietnamese Real Estate domain. Chapter 5 presents our experiments on real estate domain to evaluate the performance of the probabilistic framework ... language, index-based and document- iv 4.2 A special domain - real estate 27 4.3 Adapting probabilistic framework to Vietnamese real estate domain 29 4.3.1 Real estate domain features ... Chapter 2 presents the current state of previous work of searching for object with focus on the probabilistic framework for finding object-oriented information in unstructured data. This chapter...

Ngày tải lên: 23/11/2012, 15:04

Ngày tải lên: 01/09/2013, 11:31

Ngày tải lên: 05/09/2013, 16:30

... multi-phase AC machine: regardless of whether the rotor rotates synchronously or asynchronously, all the fields in the machine rotate at synchronous speed. Since the resulting m.m.f. is responsible ... so-called synchronous speed of rotation is 3000 rpm or 1500 rpm for 50 Hz stator frequency. Synchronous speed is defined as nfP fP ss ==60 2// ω π (1) and this is the so-called mechanical synchronous ... the same, synchronous, speed as does the stator rotating field created by the system of stator three-phase currents. Hence all the fields in a synchronous machine rotate at the same, synchronous...

Ngày tải lên: 09/11/2013, 05:15

Ngày tải lên: 03/01/2014, 19:50