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

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

... quantitative immunoblotting as a robust and reliable technique for quantitative data acquisition under standardized conditions, we establish an easy to handle and cost-effective alternative that permits ... generated under standardized conditions is critical for understanding dynamic cellular processes. We report strategies for error reduction, and algorithms for automated data processi...

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

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

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

... 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 am- biguous triples, split the attachment between the noun and the verb, assigning .5 to the noun and .5 to...

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

... our syntactic and lexical- based segmenter (SLSeg), demonstrate its performance against state-of-the-art systems, and make it available to the wider community. 2 Related Work Soricut and Marcu (2003) ... agreement (and with any dis- agreements and errors resolved), we proceeded to use the co-author’s segmentations as the gold stan- dard. 5.2 Evaluation The evaluation uses standard p...

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

... 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 selec- tion must ... meaning. The causation and instrument domains are OPTIONAL and may be realized by syntactic alternations. Other time, space, action and func- tionality domains are IMPLICIT, a...

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

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

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

... ~(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 convey...

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

... the size complexity of the forest and the time complexity of processing it, where is the num- ber of objects and events in the run-time environ- ment. Thus, the total space and time complexity of ... 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 noun phras...

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

... admitted type combina- tions 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...

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