an optimaltime binarization algorithm

... values r(g) and f(g) are called the rank and fan-out of p, respectively, written r(p) and f(p). The rank and fan-out of G, written r(G) and f(G), respectively, are the max- imum rank and fan-out among ... more than two position sets in the agenda. This means that the binarization process has come to an end with the reduction of p to a set of productions equivalent to p and with rank and fan-out ... loop invariant is that X is a 2-feasible set, and that the union of all po- sition sets in X has fan-out ≤ 2: reductions can never change the union of all sets in X , and The- orem 1 guarantees us...

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

Ngày tải lên: 08/08/2013, 08:38

... to correct the algorithm. We therefore developed an alternative to the algorithm from Schabes and Vijay-Shanker (1990). This alternative is novel in presenta- tional aspects, and is fundamentally ... 3, and the automaton that operates on these tables is given in Section 4. Section 5 first explains why the algorithm from Schabes and Vijay-Shanker (1990) is incorrect, and then provides an ... composing trees. Many modern types of TAG also allow tree substitution next to adjunc- tion. Our algorithm can be straightforwardly extended to handle tree substitution. The main changes that are...

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

... Johnson, Andrew Kay and Antonio Sanfilippo at SLE, and our anonymous reviewers for useful feedback and discussions on the re- search reported here and on earlier drafts of this paper. of instantiated ... as translation coverage is extended and new lan- guage pairs are added. 5 Conclusion We have presented a polynomial complexity gener- ation algorithm which can form part of any Shake- and-Bake ... great man translated as un homme grand). The problem is justifying the main/subordinate distinction in every language that we might wish to translate into German. This distinction can be...

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

... Parmentier, and Johannes Dellert. 2008. De- veloping an MCTAG for German with an RCG- based parser. In Proceedings of LREC-2008, Mar- rakech, Morocco. Wolfgang Maier and Anders Søgaard. 2008. Tree- banks ... adjacent variables can be concatenated), it is called an in- stantiated predicate and the result of applying φ to all predicates in c, if defined, is called an instanti- ated clause. We also introduce range ... following the dot in an active item. Scan is applied whenever a predicted predicate can be derived by an ε-clause. The rules complete and convert are the ones from the CYK algorithm except that...

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

... conditional random fields (CRFs) and hidden Markov models (HMMs). Petrov and Klein (2008) reported on a syntactic parsing task that DPLVM models can learn more compact and accurate grammars than the ... for the LDI algorithm: the minimum bayesian risk reranking. The subsequent section describes an overview of DPLVM models. We discuss the probability distribution of DPLVM models, and present ... inference algorithms on DPLVMs, and the performance of CRFs. S.A. signifies sentence accuracy. As can be seen, at a much lower cost, the LDI-A (A signi- fies approximation) performed slightly better than the...

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

... of similar words. In COLING-ACL, pages 768–774. Deepak Ravichandran, Patrick Pantel, and Eduard H. Hovy. 2005. Randomized algorithms and nlp: Using locality sensitive hash functions for high speed ... Daelemans, Antal van den Bosch, and Jakub Za- vrel. 1999. Forgetting exceptions is harmful in lan- guage learning. Machine Learning, 34(1-3). James Gorman and James R. Curran. 2006. Scaling dis- tributional ... 105–116. Rochelle Lieber and Harald Baayen. 1997. Word fre- quency distributions and lexical semantics. Computers in the Humanities, 30:281–291. Dekang Lin. 1998. Automatic retrieval and clustering of similar...

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

... response time of an imple- mentation of the new algorithm is described. 3 THE VIJAY-SHANKER AND JOSHI APPROACH First, the approach of Vijay-Shanker and Joshi (see [Vijay-Shanker, Joshi 85])is ... If X has an ENN (NNi,TK1,FPi) and Y has an ENN (NNz,TK2,FP2) and NNI-(1 in the last positition) = NN2-(2 in the last position) and TKi = TK2 and at least FPi or FP2 = nil then for Z an ENN ... to an elementary tree. Actually, the correspondence between an ele- ment in the triangle matrix and a TAG tree is represented as a pointer from the node in a tri- angle cell to a node in an...

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

Ngày tải lên: 24/04/2014, 12:29

Ngày tải lên: 03/05/2014, 12:39

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

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

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

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

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

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

... paths 26 Analysis  How many steps will we spend in phase j?  Since X j is a geometric random variable, we know that Questions:  How many steps will the algorithm take?  How many steps ... number of lattice steps between two points  Constants p,q 18 Analysis Questions:  How many steps will the algorithm take?  How many steps will we spend in phase j?  In a given step, ... exist for this to happen? 29 Analysis  When r = 2, expected delivery time is O(log n) 2 Questions:  How many steps will the algorithm take?  How many steps will we spend in phase...

Ngày tải lên: 23/10/2012, 14:11

... made substantial contributions to conception and design, and to the analysis and interpretation of the data. TRM and GWC handled acquisition of data. All authors contributed to the manuscript ... 41:1845-1850. 26. van Gestel AM, Prevoo ML, van 't Hof MA, van Rijswijk MH, van de Putte LB, van Riel PL: Development and validation of the European League Against Rheumatism response criteria ... addressing important intellectual content. All authors read and approved the final manuscript for publication. Acknowledgements We would like to thank Mike Connor and Sheryl Berryman at the Birmingham...

Ngày tải lên: 25/10/2012, 10:45

Ngày tải lên: 01/01/2014, 18:42

... pp.50-55. [20] R. Ramaswami and K. Sivarajan, Optical Networks: A Practical Perspective, Morgan Kaufmann Publishers, 1998. [21] R. Ramaswami and K. Sivarajan, “Design of logical topologies ... non-empty sub-families F 1 and F 2 , such that none of them is an s-t cut. Proof Suppose F can be partitioned into F 1 and F 2 such that none of them is an s-t cut. Then we can find a pair of ... Theorem 1 Given an undirected graph G=(V, E), a pair of nodes (s ,t) and a family F of subsets of E, there is a pair of F-disjoint paths between s and t if and only if F can be partitioned...

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