an efficient generation algorithm

... 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

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

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

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

... 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

... Cambridge, England. K. Clark and S. Gregory. 1986. Parlog: Parallel programming in logic. Journal of the A CM Transaction on Programming Languages and Syste ms, 8 ( 1):1-49. Ralph Grishman and Mehesh ... heap can be read by any CSAs, each CSA can read the re- sult performed by any other CSAs. However, the portion of a shared heap that the CSA can write to is limited. Any other CSA cannot ... Applied Natural Language Processing, pages 71-76. Association for Computational Linguistics. T. Kasami. 1965. An efficient recognition and syntax algorithm for context-free languages. Technical...

Ngày tải lên: 20/02/2014, 18: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

... on Banks and Other Financial Organizations; the Law on Bank Rehabilitation, Bankruptcy and Liquidation; and the Law on the Agency for Deposit Insurance and Bank Rehabilitation, Bankruptcy and ... Valjevska banka, JIK banka, Pozarevacka banka, Sabacka banka, Beogradska banka, Beobanka, Jugobanka, and Investbanka. Later, two more banks were added to this list - Dafiment banka and Banka privatne ... securities and other financial instruments and of these entities, and shall con- duct the clearing and balancing of accounts of securities and balancing of accounts of financial assets and liabilities...

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

... Y. Hu, A. Nanda, and Q. Yang. Measurement, anal- ysis and performance improvement of the Apache web server. In Proceedings of the 18th IEEE In- ternational Performance, Computing and Commu- nications ... testbed configuration. Special thanks to Zeus Technology for use of their server software and Damian Reeves for feedback and technical assistance with it. Thanks to Jef Poskanzer for the thttpd web server, ... versions. The choice of an operating system has a signifi- cant impact on Web server performance. Perfor- The number of concurrent connections can have a significant impact on server performance [4]. Our...

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

... play an impor- tant role in synthesizing linguistic analyses such as parsing and semantic analysis, and linguistic and non-linguistic inferences. Acknowledgments I would like to thank Kiyoshi ... and indicates its disadvan- tages. Section 4 explains the basic ideas and the algorithm of CP. Section 5 presents some results of implementation and shows that adopting CP makes parsing efficient. ... Avoiding unnecessary expansion of disjunction is important for efficient disjunctive unification. Kasper (1987) and Eisele and DSrre (1988) have tackled this problem and proposed unification...

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

... The transformational cycle in German and Dutch. Ph.D. thesis, University of Utrecht, Utrecht, Netherlands. Per-Kristian Halvorsen and Ronald M. Kaplan. 1988. Projections and semantic description ... like to thank Mary Dalrymple and Louis des Tombe for their helpful discussions regarding this work. Bibliography Jonathan Calder, Mike Reape, and Hank Zeevat. 1989. An algorithm for generation ... how the algorithm and the grammar it uses can be extended to encompass some important analyses and constraints. 6.1 Completeness and Coherence Wedekind (1988) defines completeness and coher-...

Ngày tải lên: 17/03/2014, 20: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

... Proceedings of EACL '99 number of candidateswill be much smaller than the number of trees in DB. 2 Efficient query evaluation The treegram-index retrieval method ... abstract. 2The employed algorithm is a generalization of the well-known transformation of trees to binary trees. d's value is a configurable parameter of the index- generation. Problem ... query treegram, VENONA expands the structure number to a set of index treegram structures and re- moves those labels that consist of a vari- able: Variables and the constraints that they...

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

... can say only so much about the properties of the system, or about algorithms for generation, comprehension, and learning. The central claim of OT is that the phonology of any language can ... tively that all overlap on the timeline and whose intersection does not overlap any event of type/31,/3.,, • (10) (al anda2 and ) .L (/31 and/3~ and ) Scoring: Constraint(R) = number of ... [B~ .]]) can be computed from A, B:, B2, Ci(B1), and Ci(B~.). The optimal tree can then be found with a standard dynamic-programming chart parser for weighted CFGs. It is an important question...

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

... than oak trees. (D) partially blanked sentence acts as the stem and the key “more than” is accompanied by three distractors of “as much as”, “up as”, and “as many to”. On the other hand, ... approach and offers significant potential for computer assisted language learning and assessment. 1 Introduction Language testing, aimed to assess learners’ language ability, is an essential ... 101, Kuangfu Road, Hsinchu, 300, Taiwan jschang@cs.nthu.edu.tw Abstract This paper introduces a method for the semi-automatic generation of grammar test items by applying Natural Language...

Ngày tải lên: 23/03/2014, 18: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

... encoded by an IDL-graph under an n-gram language model. Theorem 1 Let be an IDL-expression, G( ) its IDL-graph, and W( ) its wFSA under an n-gram language model LM. Algorithms IDL-NGLM-BFS and IDL-NGLM-A ... be an IDL-expression, its IDL-graph, its FSA, and its wFSA under an n-gram language model. Let be the set of states of , and the set of states of . Let also , , and . Algorithms IDL-NGLM-BFS and ... significant savings. 3.2 Generation via Intersection of IDL-expressions with Language Models Algorithm IDL-NGLM-BFS The first algorithm that we propose is algorithm IDL-NGLM-BFS in Figure 4. The algorithm...

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

... i.e., En- glish and Japanese, and the resultant two corpora share the same content. Both transcriptions went through morphological analysis, which was manually checked. The transcriptions have ... with the translation problem of positive responses appearing in both Japanese and English dialogues. Japanese positive responses like Hat and Soudesuka, and the English ones like Yes and I see ... greater than 2.01 as significant (two- sided significance level of 5 %). The accuracy for Japanese translation was sat- urated with the two features (K) and (I). Further addition of any feature...

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

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

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