an algorithm for generation
Báo cáo khoa học: "AN ALGORITHM FOR GENERATION IN UNIFICATION CATEGORIAL GRAMMAR" pdf
... appearance of a variable can only be further instanfiated by a semantic individual constant and so the semantic representation after generation cannot be further instantiated in such a way that ... the algorithm The most important feature of categorial grammars is the close correspondence of syntactic and semantic ftmctors. In generation, if the semantic functor of an expression can ... Abstract We present an algorithm for the generation of sentences from the semantic representations of Unification Categorial Grammar. We discuss a variant of Shieber's semantic monotonicity...
- 8
- 382
- 0
Tài liệu Báo cáo khoa học: "An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words" ppt
... take note of three lemmas for IITGs (proofs omitted): Lemma l For any inversion-invariant transduction grammar G, there exists an equivalent inversion- invariant transduction grammar G' ... G' contains no productions of the form A ~ e/e. Lemma2 For any inversion-invariant transduction grammar G, there exists an equivalent inversion- invariant transduction gratrm~r G' where ... right-hand side of any production of G' contains either a single terminal- pair or a list of nonterminals. Lemma3 For any inversion-invariant transduction grammar G, there exists an equivalent...
- 8
- 382
- 0
Tài liệu Báo cáo khoa học: "AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES" pptx
... III PERFORMANCE OF THE ALGORITHM The algorithm as described has been implemented in Simula 67 on a DEC ELI091 and applied to a corpus of some 300 words in 75 languages and dialects of Vanuatu. ... (Abramowitz and Stegun 1970). B. Vowel/Consonant Correspondences Disallowing correspondences between vowels and consonants vastly improved the performance of the algorltbm. No human intervention ... AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES Jacques B.M. Guy Linguistics Department (RSPacS) Australian National University GPO Box 4, Canberra 2601 AUSTRALIA...
- 4
- 422
- 0
Báo cáo khoa học: "An Algorithm For Generating Referential Descriptions With Flexible Interfaces" pdf
... p and false otherwise Table 2: Functions used in the algorithm 210 Major problems for the future are an even tighter inte- gration of the algorithm in the generation process as a whole and ... cases are not problematic, for instance, when two descriptors achieve unique identifi- cation and can be expressed by a simple noun phrase consisting of a head noun and an adjective. In more complex ... In Proceedings of the 5th European Work- shop on Natural Language Generation, pages 43-58, Leiden, The Netherlands. Helmut Horacek. 1996. A New Algorithm for Generating Referring Expressions....
- 8
- 325
- 0
Báo cáo khoa học: "An Algorithm for Unsupervised Transliteration Mining with an Application to Word Alignment" ppt
... non-transliteration pairs than transliter-ation pairs. We don’t want to maximize the like-lihood of the non-transliteration pairs. Instead wewant to optimize the transliteration performance for test ... filtering model and thetransliteration model. In section 3, we present ouriterative transliteration mining algorithm and an al-gorithm which computes a stopping criterion for themining algorithm. ... itsperformance is similar to or better than many of thesemi-supervised systems on three language pairs.We are only aware of one previous work whichuses transliteration information for word...
- 10
- 320
- 0
Báo cáo khoa học: "AN ALGORITHM FOR PLAN RECOGNITION COLLABORATIVE DISCOURSE*" pot
... several graph-based algorithms derived from his formal model of plan recognition. In Kautz's algorithms, an explanation for an observation is represented in the form of an explanation graph ... modelling this information and have provided an algorithm for constructing and reasoning with it. The steps of the construction algorithm parallel the reasoning that an agent performs in determining ... like to thank Cecile Balkanski, Barbara Grosz, Stuart Shieber, and Candy Sidner for many helpful discussions and comments on the research presented in this paper. REFERENCES Allen, J. and Perrault,...
- 6
- 293
- 0
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
... Shake-and-Bake generation algorithm of (Whitelock, 1992) is NP- complete. We present a polynomial time algorithm for lexicalist MT generation pro- vided that sufficient information can be transferred ... wish to thank our colleagues Kerima Benkerimi, David Elworthy, Peter Gibbins, Inn Johnson, Andrew Kay and Antonio Sanfilippo at SLE, and our anonymous reviewers for useful feedback and discussions ... 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...
- 7
- 410
- 0
Báo cáo y học: " Derivation and preliminary validation of an administrative claims-based algorithm for the effectiveness of medications for rheumatoid arthritis"
... used for the analysis were from the administrative claims data. To test the performance of the effectiveness algorithm and to see whether it was similar for non-biologic RA treatments, we performed ... 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 ... optimization of the algorithm would be desirable, but substantially more data would be required for this approach and for validation. Finally, as an additional opportunity to extend the algorithm in...
- 29
- 581
- 0
Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspecified Representations" pdf
... Proceedings of COLING’02.K. van Deemter and S. Peters. 1996. Semantic Ambiguityand Underspecification. CSLI, Stanford.E. Vestre. 1991. An algorithm for generating non-redundantquantifier scopings. In ... semantics: An introduction. Journal ofLanguage and Computation. To appear.M. Egg, A. Koller, and J. Niehren. 2001. The ConstraintLanguage for Lambda Structures. Logic, Language, andInformation, ... rules. For instance, proper namesand pronouns (which the ERG analyses as scope-bearers, although they can be reduced to constantswithout scope) can be permuted with anything. In-definites and...
- 8
- 429
- 0
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
... for 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 ... CS(N), for each N; • (N, L) • CS(N), for each N such that N <~* l, and each L • Af*; • N • CS(N), for each N such that -~(N<~*l); and • for each N, children(N) = MI""Mm and ... 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...
- 7
- 413
- 0
Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot
... pe,forms instanliation tit)ring parsing. Some details of the LR parsing algorithm are assumed from Aho and Ullman (1987) and Aho and Johnson (1974), and more formal definitions and notations ... Carl and Ivan A. Sag 1987. Information-Based Syntax and Semantics VoI.1. CSLI Lecture Notes 13. Stanford: CSLI. Shieber, S. 1985. "Using Restriction to Extend Parsing Algorithms for ... AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa Beckman Institute for Advanced Science and Technology and Linguistics...
- 6
- 334
- 0
Báo cáo khoa học: "An Earley Parsing Algorithm for Range Concatenation Grammars" potx
... 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 ... to instantiate a clause of the grammar,we need to find ranges for all variables in theclause and for all occurrences of terminals. For convenience, we assume the variables in a clauseand the ... adjacentvariables can be concatenated), it is called an in-stantiated predicate and the result of applying φ toall predicates in c, if defined, is called an instanti-ated clause.We also introduce range...
- 4
- 354
- 0
Báo cáo khoa học: "A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms" potx
... coordinated research effort with the Center for the Study of Language and Information, Stanford University; van Noord was supported by the Euro- pean Community and the Nederlands Bureau voor Bibliotheekwezen ... Natural-Language Analysis, Volume 10 of CSLI Lecture Notes. Center for the Study of Language and Information, Stan- ford, California. Distributed by Chicago Uni- versity Press. Fernando C.N. Pereira and ... olin, banana) 'John ate a banana' eat(john, nice(yellow(banana))) 'John ate a nice yellow banana' The generator of Section 4.1 would generate any of these sentences for...
- 11
- 273
- 0
Báo cáo khoa học: "An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two" ppt
... 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 all of ... constituents. Many applications useLCFRSs where the fan-out (a measure ofthe discontinuity of phrases) is not allowedto be greater than 2. We present an ef-ficient algorithm for transforming LCFRSwith ... thewhile loop can be executed in constant time.5 DiscussionWe have presented an algorithm for the binariza-tion of a LCFRS with fan-out 2 that does not in-crease the fan-out, and have discussed...
- 9
- 376
- 0
Báo cáo khoa học: "An efficient algorithm for building a distributional thesaurus (and other Sketch Engine developments)" pdf
... COLING-ACL, pages 768–774.Deepak Ravichandran, Patrick Pantel, and Eduard H.Hovy. 2005. Randomized algorithms and nlp: Usinglocality sensitive hash functions for high speed nounclustering. In ... 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 ... based on corporaof between 50M and 2B words for, at time of writ-ing, Chinese, English, French, Italian, Japanese,Portuguese, Slovene and Spanish.2 Histograms for presenting statisticalfacts...
- 4
- 346
- 0
- an algorithm for generating
- an algorithm for identifying cognates
- an algorithm for simultaneously
- an algorithm for finding
- an algorithm for generating abstract syntax trees
- an algorithm for generating quantifier scopings
- write an algorithm for generating fibonacci series
- an algorithm for generating artificial test clusters
- an algorithm for finding best matches in logarithmic
Tìm thêm: hệ việt nam nhật bản và sức hấp dẫn của tiếng nhật tại việt nam xác định các nguyên tắc biên soạn khảo sát chương trình đào tạo của các đơn vị đào tạo tại nhật bản xác định thời lượng học về mặt lí thuyết và thực tế điều tra đối với đối tượng giảng viên và đối tượng quản lí khảo sát các chương trình đào tạo theo những bộ giáo trình tiêu biểu nội dung cụ thể cho từng kĩ năng ở từng cấp độ mở máy động cơ lồng sóc mở máy động cơ rôto dây quấn các đặc tính của động cơ điện không đồng bộ hệ số công suất cosp fi p2 đặc tuyến hiệu suất h fi p2 đặc tuyến mômen quay m fi p2 đặc tuyến tốc độ rôto n fi p2 đặc tuyến dòng điện stato i1 fi p2 sự cần thiết phải đầu tư xây dựng nhà máy phần 3 giới thiệu nguyên liệu từ bảng 3 1 ta thấy ngoài hai thành phần chủ yếu và chiếm tỷ lệ cao nhất là tinh bột và cacbonhydrat trong hạt gạo tẻ còn chứa đường cellulose hemicellulose chỉ tiêu chất lượng theo chất lượng phẩm chất sản phẩm khô từ gạo của bộ y tế năm 2008 chỉ tiêu chất lượng 9 tr 25