Tóm tắt báo cáo khoa học tuổi trẻ

Báo cáo khoa học: "Medical treatment for the terminally ill: the ‘risk of unacceptable badness’"

Báo cáo khoa học: "Medical treatment for the terminally ill: the ‘risk of unacceptable badness’"

... end -of- life issues to patients and their families [11] It is not uncommon for physicians to ask loaded questions in their quest for end -of- life decisions For example, ‘This is your grandmother’s ... futile Under the current rules, the only test of futility is that embodied by the question, ‘Will this treatment result in sustained life?’ If the answer is ‘yes’, then virtu...
Ngày tải lên : 25/10/2012, 10:45
  • 2
  • 463
  • 0
Tài liệu Báo cáo khoa học: "STRING-TREE CORRESPONDENCE GRAMMAR: A DECLARATIVE GRAMMAR FORMALISM FOR DEFINING THE CORRESPONDENCE BETWEEN STRINGS OF TERMS AND TREE STRUCTURES" pdf

Tài liệu Báo cáo khoa học: "STRING-TREE CORRESPONDENCE GRAMMAR: A DECLARATIVE GRAMMAR FORMALISM FOR DEFINING THE CORRESPONDENCE BETWEEN STRINGS OF TERMS AND TREE STRUCTURES" pdf

... complex than the classical definition) The set of rules in a grammar forms a formal grammar, ie it defines a language, in fact two languages, one of strings and the other of trees At the moment, there ... the grammar formalism One also sees that the grammar is declarative in nature, and thus it is interpretable both for analysis and for generatio...
Ngày tải lên : 22/02/2014, 10:20
  • 7
  • 444
  • 0
Báo cáo khoa học: Lipopolyamine treatment increases the efficacy of intoxication with saporin and an anticancer saporin conjugate doc

Báo cáo khoa học: Lipopolyamine treatment increases the efficacy of intoxication with saporin and an anticancer saporin conjugate doc

... understood process Both saporin and anticancer saporin conjugates enter the target cell by endocytosis and then escape the endomembrane system to reach their cytosolic target [7–11] Other toxins that ... corresponded to lipopolyamine transfection efficiency was documented for saporin intoxication Lipopolyamine treatment enhances the potency of uPA -saporin, an an...
Ngày tải lên : 07/03/2014, 05:20
  • 12
  • 481
  • 0
Báo cáo khoa học: "Edit Tree Distance alignments for Semantic Role Labelling" ppt

Báo cáo khoa học: "Edit Tree Distance alignments for Semantic Role Labelling" ppt

... trees for the tree distance algorithm; foreach sentence (training & testing data) obtain each minimal sub -tree for each predicate; end foreach sub -tree T from the testing data calculate the distance ... labelled Input: list of alignments sorted by ascending tree distance Output: labelled sub -tree foreach argument(a) in T foreach alignment (ali) in the sorted list if ther...
Ngày tải lên : 07/03/2014, 22:20
  • 6
  • 299
  • 0
Báo cáo khoa học: "Adjoining Tree-to-String Translation" potx

Báo cáo khoa học: "Adjoining Tree-to-String Translation" potx

... derived tree using tree-to-string rules that allow for both substitution and adjoining We describe how to convert TAG derivations to translation forest (Section 4) We evaluated the new tree-to-string ... Conclusion We have presented a new tree-to-string translation system based on synchronous TAG With translation rules learned from Treebank-style trees, the adjoining tree-to-string sy...
Ngày tải lên : 07/03/2014, 22:20
  • 10
  • 216
  • 0
Báo cáo khoa học: "Making Tree Kernels practical for Natural Language Learning" potx

Báo cáo khoa học: "Making Tree Kernels practical for Natural Language Learning" potx

... → school A subtree Figure 1: A syntactic parse tree We define as a subtree (ST) any node of a tree along with all its descendants For example, the line in Figure circles the subtree rooted in ... that the above tree kernels are not convolution kernels as those proposed in this article In (Shen et al., 2003), a tree- kernel based on Lexicalized Tree Adjoining Grammar (LTAG) for...
Ngày tải lên : 08/03/2014, 21:20
  • 8
  • 340
  • 0
Báo cáo khoa học: "Combining Tree Structures, Flat Features and Patterns for Biomedical Relation Extraction" ppt

Báo cáo khoa học: "Combining Tree Structures, Flat Features and Patterns for Biomedical Relation Extraction" ppt

... stands for the new feature based kernel (henceforth, TPWF kernel) computed using flat features collected by exploiting patterns, trigger words, negative cues and walk features KSL and KP ET stand ... syntactic dependency patterns, trigger words, negative cues, regular expression (henceforth, regex) patterns and walk features (i.e e-walks and v-walks)2 The syntactic dependen...
Ngày tải lên : 08/03/2014, 21:20
  • 10
  • 377
  • 0
Báo cáo khoa học: "A Tree Transducer Model for Synchronous Tree-Adjoining Grammars" pdf

Báo cáo khoa học: "A Tree Transducer Model for Synchronous Tree-Adjoining Grammars" pdf

... generally not discuss trees with error symbols explicitly Extended tree transducer An extended tree transducer is a theoretical model that computes a tree transformation Such transducers have been ... al (2009) for a more detailed exposition to XTT Synchronous tree- adjoining grammar XTT are a simple, natural model for tree transformations, however they are not suitably...
Ngày tải lên : 17/03/2014, 00:20
  • 10
  • 294
  • 0
Báo cáo khoa học: "A Tree Sequence Alignment-based Tree-to-Tree Translation Model" potx

Báo cáo khoa học: "A Tree Sequence Alignment-based Tree-to-Tree Translation Model" potx

... parse trees T ( f1J ) and T (e1I ) in Fig 1, Fig illustrates two examples of tree sequences derived from the two parse trees A tree sequence translation rule r is a pair of aligned tree % sequences ... combine the strengths of phrase-based and syn- Tree Sequence Alignment Model 3.1 Tree Sequence Translation Rule The leaf nodes of a sub -tree in a tree sequence can be...
Ngày tải lên : 17/03/2014, 02:20
  • 9
  • 303
  • 0
Báo cáo khoa học: "Generalizing Tree Transformations for Inductive Dependency Parsing" potx

Báo cáo khoa học: "Generalizing Tree Transformations for Inductive Dependency Parsing" potx

... adopted in the treebank The rest of the paper is structured as follows Section surveys tree transformations used in dependency parsing and discusses dependencies between transformations, on the ... the three transformations boosts the performance of MaltParser for all treebanks and in two cases out of four outperforms MSTParser (which was the top scoring system for all four treeb...
Ngày tải lên : 17/03/2014, 04:20
  • 8
  • 264
  • 0
Báo cáo khoa học: "Dependency Treelet Translation: Syntactically Informed Phrasal SMT" ppt

Báo cáo khoa học: "Dependency Treelet Translation: Syntactically Informed Phrasal SMT" ppt

... From this aligned parallel dependency corpus we extract a treelet translation model incorporating source and target treelet pairs, where a treelet is defined to be an arbitrary connected subgraph ... software and is Pruning treelet translation pairs Channel model scores and treelet size are powerful predictors of translation quality Heuristically pruning low scoring treelet transl...
Ngày tải lên : 17/03/2014, 05:20
  • 9
  • 127
  • 0
Báo cáo khoa học: "Dependency Tree Kernels for Relation Extraction" pot

Báo cáo khoa học: "Dependency Tree Kernels for Relation Extraction" pot

... [1] = t2 , t0 [{0, 1}] = {t1 , t2 }, and t1 p = t0 Tree kernels for dependency trees We now define a kernel function for dependency trees The tree kernel is a function K(T1 , T2 ) that returns ... parse trees with semantic labels denoting entity and relation types Whereas Miller et al (2000) use a generative model to produce parse information as well as relation information, we h...
Ngày tải lên : 17/03/2014, 06:20
  • 7
  • 289
  • 0
Báo cáo khoa học: "Loosely Tree-Based Alignment for Machine Translation" pptx

Báo cáo khoa học: "Loosely Tree-Based Alignment for Machine Translation" pptx

... ta and tb += β(εa , εb ) Pelem (ta |εa )Palign (α|εi ) (i,j)∈α β(εi , εj ) end for end for end for end for end for The outer two loops, iterating over nodes in each tree, require O(|T |2 ) Because ... human-annotated word-level alignments between the sentence pairs For scoring the viterbi alignments of each system against goldstandard annotated alignments, we use the alignment e...
Ngày tải lên : 17/03/2014, 06:20
  • 8
  • 274
  • 0
Báo cáo khoa học: "TENSE TREES AS THE "FINE STRUCTURE" OF DISCOURSE" ppt

Báo cáo khoa học: "TENSE TREES AS THE "FINE STRUCTURE" OF DISCOURSE" ppt

... nodes The traversal of trees and the addition of new tokens is simply and fully determined by the logical forms of the sentences being interpreted The major advantage of tense trees is that they ... is at the same time as the event of John's picking up the phone, epiek; and the event of John's calling, eean, is located after some time e2, which is the at...
Ngày tải lên : 17/03/2014, 08:20
  • 9
  • 338
  • 0
Báo cáo khoa học: "TOWARD TREATING ENGLISH NOMINALS CORRECTLY" doc

Báo cáo khoa học: "TOWARD TREATING ENGLISH NOMINALS CORRECTLY" doc

... nominals and the second which takes n-ary nominals and figures out the stress pattern of those W e deal with each in turn Binary Nominals Much of the work in assigning stress to nominals in English ... Chomsky, N and M Halle 1968 The Sound Pattern of English New York: Harper and Row Finin, T 1980 The Semantic Interpretation of Compound Nominals Doctoral dissertation, University...
Ngày tải lên : 17/03/2014, 20:20
  • 7
  • 114
  • 0

Xem thêm