Báo cáo khoa học: "COMPUTATIONAL PLEXITY AND LEXICAL FUNCTIONAL GRAMMAR" docx

... languages, and yet narrow enough to account for what might be dubbed "cognitive demands" among these, perhaps, the demands of lcarnability and pars,ability. If cognitive demands are ... stated aim of meeting the dual demands of tearnability and pa~ability - the Lexical Functional Grammars (LFGs) of Bresnan [!~ I. The theory of l.exical Functional Grammars is claimed to ... COM PUTATIONAL ('Obl PLEXITY AND LEXICAL FUNCTIONAL GRAMMAR Robert C. Berwick MIT Artificial Intelligence Laboratory, Cambridge,...

Tài liệu Báo cáo khoa học: Computational processing and error reduction strategies for standardized quantitative data in biological networks doc

... quantitative immunoblotting as arobust and reliable technique for quantitative dataacquisition under standardized conditions, we establishan easy to handle and cost-effective alternative thatpermits ... generated under standardized conditions iscritical for understanding dynamic cellular processes. We report strategiesfor error reduction, and algorithms for automated data processing and forestablishing ... wereloaded, in a randomized manner, onto two gels, trans-ferred to membranes (blot 1 and blot 2) and analyzedby three repetitive cycles of ERK immunoglobulinreprobing and application of the...

Tài liệu Báo cáo khoa học: "COMMONSENSE METAPHYSICS AND LEXICAL SEMANTICS" ppt

... material, physical objects, causality, functionality, force, and shape. Our approach to lexical semantics is then to construct core theories of each of these areas, and then to define, or at least ... project, and it will be described in subsequent papers. This work represents a convergence of research in lexical semantics in linguistics and efforts in AI to encode commonsense knowledge. Lexical ... "last night", and so on. The change ontology is exhibited in most verbs, and in temporal clausal connectives. The universal presence of both classes of lexical items and grammatical mark-...

Báo cáo khoa học: "STRUCTURAL AMBIGUITY AND LEXICAL RELATIONS" ppt

... ambiguity through lexical associations Whittemore et al. (1990) found lexical preferences to be the key to resolving attachment ambiguity. Similarly, Taraban and McClelland found lexical content ... and k may be assigned) 6. Ambiguous Attach 2 - for the remaining ambiguous triples, split the attachment between the noun and the verb, assigning .5 to the noun and .5 to the verb. (j and ... Table 5: Count of noun and verb associations for COBUILD and the AP sample there are over 20,000 nouns, over 5000 verbs, and over 90 prepositions.) On the other hand, the lack of overlap...

Báo cáo khoa học: "A Syntactic and Lexical-Based Discourse Segmenter" pdf

... our syntactic and lexical- based segmenter (SLSeg), demonstrate itsperformance against state-of-the-art systems, and make it available to the wider community.2 Related WorkSoricut and Marcu (2003) ... agreement (and with any dis-agreements and errors resolved), we proceeded touse the co-author’s segmentations as the gold stan-dard.5.2 EvaluationThe evaluation uses standard precision, recall and F-score ... and lexical information.Our approach employs a set of rules for insert-ing segment boundaries based on the syntax ofeach sentence. The segment boundaries are thenfurther reﬁned by using lexical...

Báo cáo khoa học: "VERB SEMANTICS AND LEXICAL SELECTION" pdf

... verbs in computer systems and its impact on lexical selection problems in machine transla- tion (MT). Two groups of English and Chinese verbs are examined to show that lexical selection must ... meaning. The causation and instrument domains are OPTIONAL and may be realized by syntactic alternations. Other time, space, action and functionality domains are IMPLICIT, and are neces- sary ... approach that has a fixed num- ber of target candidate verbs and provides no way to measure the meaning similarity among verbs, is not able to handle the new verb usages, i.e., the small portion...

Báo cáo khoa học: "COMPUTATIONAL COMPLEXITY OF CURRENT GPSG THEORY" docx

... and I. Sag (1985). Gener- alized Phrase Structure Grammar. Oxford, England: Basil Blackwell. Garey, M, and D. Johnson (1979). Computers and Intractabil- ity. San Francisco: W.H. Freeman and ... expanded and unexpanded grammar statements," strongly im- plying that GPSG is efficiently processable as a consequence. 14 But this "expanded grammar" is not adequately expanded, ... exponential-polynomial time hard, and assuredly intractable. The paper pinpoints sources of complexity (e.g. metarules and the theory of syntactic features) in the current GPSG theory and concludes with...

Báo cáo khoa học: "ITERATION, HABITUALITY AND VERB FORM SEMANTICS" docx

... ~(I,E) and e is oefineo with respect to I : c(e.I~ As it stands, the format does not provioe any means for stating a direct relationship between the intervals inside the frame time ~I and e~ ... atempora! proposition on the ot~er hand. (b; the cat sat on t~e mat w~.i. for instance, be analyseo in a basic proposition "the cat sit on the met" and the ~n~ormation conveyed Dv ... can be handled In one o; two eaVs either by Oefinlng complex mappings from source language to target language forms in transfer or Oy Oeflnlng mappings Oetween language specific forms and Interlingual...

Báo cáo khoa học: "Computational properties of environment-based disambiguation" docx

... the size complexity of the forest and the timecomplexity of processing it, where is the num-ber of objects and events in the run-time environ-ment. Thus, the total space and time complexityof ... Billot and Lang, 1989), and can be con-structed and traversed in time of the same com- plexity (e.g. for context free grammars).For example, the two parse trees for the nounphrase ‘button on handle ... beside adapter”the handle (but not necessarily the button) is be-side an adapter, and the other in which a button ison a handle and the button (but not necessarily thehandle) is beside an...

Báo cáo khoa học: "EFFICIENT INCREMENTAL PROCESSING WITH CATEGORIAL GRAMMAR" docx

... admitted type combinations and transitions. The set of types (T) is defined recursively in terms of a set of basic types (To) and a set of operators (\ and/ , for standard bidirectional CG), ... B' (or the DC), and others (i.e. (b) and (e)) can only be derived with a right-branching proof. Combinations of the pat- terns (c),(d) and (g) commonly allow both right and left-branching ... cussion of the notions of head and dependent, and their relevance to CG. The dependency grammar (DG) tradition takes as fundamental the notions of head, dependent and the head-dependent relationship;...

Xem thêm