factoring synchronous grammars by sorting

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

... 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 constrained by ... improves BLEU by 0.3 and model score by 13 relative to an n-ary forest baseline by reducing search errors during forest rescoring. model reranking has also been established, both for synchronous ... 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

... parsing for unification-based grammars by using default unification, which almost always succeeds in unification by overwriting inconsistent con- straints in the grammars. We further pursue best-first ... 4 Shift-reduce parsing for unification- based grammars Non-deterministic shift-reduce parsing for unifi- cation-based grammars has been studied by Bris- coe and Carroll (Briscoe and Carroll, ... phrase- structure rules and the lexical entries are represented by feature structures (Carpenter, 1992), and constraints in the grammar are forced by unification. Among the phrase-structure rules, a...

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

... 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 Workshop on ... be performed by applying heuristic head-finding rules. proach also outperforms the treebank conversion ap- proach of Niu et al. (2009). 2 Related Work The present work is primarily inspired by Jiang ... 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...

Ngày tải lên: 16/03/2014, 19: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 ... methods for model- ing the target MRL. This is motivated by the fact that many of the errors made by the λ-WASP parser can be detected by inspecting the MR translations alone. Figure 7 shows some...

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

... 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. ... 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 by (Shieber ... Ding and Palmer. 2004b. Synchronous Dependency Insertion Grammars: A Grammar Formalism for Syn- tax Based Statistical MT. Workshop on Recent Ad- vances in Dependency Grammars, COLING-04. Bonnie...

Ngày tải lên: 20/02/2014, 15: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, ... applied. This is easily achieved by label- ing the root of each adjoined auxiliary tree by a special marker. Traditionally, the root label A of an auxiliary tree is replaced by A ∅ once adjoined. Since ... investigated in the formal language com- munity (G ´ ecseg and Steinby, 1984; G ´ ecseg and Steinby, 1997), but as argued by Shieber (2004) they are still too weak for syntax-based machine translation....

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

... labeled with fluorescently conjugated antigen are readily distinguished and iso- lated by fluorescence-activated cell sorting (FACS). Unlike phage display, FACS has the distinct advantage of relying ... screening methodology, sorting a library > 10 9 cells using FACS is time-consuming and challenging [40–43]. To reduce the initial library to a size that is manage- able by FACS and to demonstrate ... Evaluation of the enrichment in each round of selection was performed by phage ELISA as described above. Library selection by phage biopanning Electrocompetent E. coli K91K ⁄ F¢ cells were transformed with...

Ngày tải lên: 22/03/2014, 21:21

... nonterminals with the same index in a pair of synchronous strings are rewritten by a synchronous rule. This is done in such a way that the result is once more a pair of synchronous strings. An auxiliary notion ... with the techniques pro- posed by Jelinek and Lafferty (1991) and by Stolcke (1995), which are extensions of parsing algorithms for probabilistic context-free grammars, and require considerably ... formulated in quite different terms from the solutions by Jelinek and Lafferty (1991) and by Stolcke (1995) for probabilistic context-free grammars. In this paper we reduce the computation of prefix...

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

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

Ngày tải lên: 24/03/2014, 01:21

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

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

Ngày tải lên: 08/08/2012, 17:20

... VHDL resulted from work done in the ’70s and early ’80s by the U.S. Department of Defense. Its roots are in the ADA language, as will be seen by the overall structure of VHDL as well as other VHDL ... that contains the value of signal b delayed by 10 nanoseconds. The second statement creates a driver that contains the value of signal c delayed by 10 nanoseconds. How these two drivers are resolved ... as well as other VHDL statements. VHDL usage has risen rapidly since its inception and is used by literally tens of thousands of engineers around the globe to create sophisticated electronic...

Ngày tải lên: 16/08/2012, 08:46

... 14 Microsoft ADO.NET 4 Step by Step 15. For this test, include the Customer table in the DataSet by expanding the Tables section and marking the Customer table ... with the Where Clause. . . . . . . . . . . . . . . . . . . . . . . . . . . 295 Sorting Results with the Order By Clause . . . . . . . . . . . . . . . . . . . . . . . . . 296 Selecting Linked ... auto-increment columns, with these new values based on the rules established by the AutoIncrementSeed and AutoIncrementStep properties. By default, the AutoIncrement property is set to False, which disables...

Ngày tải lên: 17/08/2012, 08:39

Ngày tải lên: 27/08/2012, 09:21

... đúng A)Từ khóa throw và throws phải đc sử dụng bởi phương thức mà có thể truyền các lỗi Đề Thi Java By Example (27-6-2008) 1.Cho đoạn mã chương trình sau: For( int y=2 ; y= ){ System.out.print(x+...

Ngày tải lên: 18/09/2012, 09:13

Ngày tải lên: 23/09/2012, 14:47