Báo cáo khoa học: "A Compositional Semantics for Focusing Subjuncts" doc

... semantic object for the phrase. Proponents of com- positionM semantics argue that natural language it- self is for the most part compositional. In addition, using a composition semantics in semantic ... operators for the focusing subjunct 7 (see below). 3.3 The sentential operators The sentential operators for only and even are given below. (The one for too is t...

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

... satisfiability problem for CNF formulas of propositional logic can be reduced to the consistency (or satisfia- bility) problem for formulas in FML. Thus, the consistency problem for formulas in FML ... Greek alpha- bet axe used to stand for arbitrary formulas in FML. The formulas NIL and TOP axe intended to convey gno information z and ~inconsistent in- formation s respect...

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

... A COMPOSITIONAL SEMANTICS OF TEMPORAL EXPRESSIONS IN ENGLISH Erhard W. Hinrichs BBN Laboratories Inc. 10 Moulton St. Cambridge, MA 02238 Abstract This paper describes a compositional semantics ... referent for the plural pronoun they. In order to derive the appropriate discourse entity for the interpretation of they, Webber suggests the rule schema as in (43). (43) say...

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

... consistency a set of formu- las is consistent if it is satisfiable. Testing a set of Kasper-Rounds formulas for consistency thus sim- ply reduces to finding a satisfier for that set. Formally, we ... would represent the information in Fig. 3 in terms of Kasper-Rounds default logic. The strict statements become normal KR formulas in W. For instance, the information for MIDDLE-VE...

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

... nevertheless a formal logic admitting of a mathemati- cally precise semantics. The intended semantics incorpo- rates a Fregean distinction between sense and denotation, associated principles of compositionality, ... sentential formulas. 3.1. Predicates of Variable Arity Atomic formulas in NFLT have an explicit ro[e-marker for each argument; in this respect NFLT resembles seman- ti...

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

... turns input text ~ format into standard format for discourse referents. Coreference [Semantic type matching 1 nalysis for [lbr pronouns J efinite NPS Hobbs naive lagreement for | algorithm ... especially problematic for designers of dialogue systems trying to pre- dict how anaphora resolution techniques devel- oped for written monologue will perform when adapted for s...

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

... of several formats. Format S (specifiers) in- volves whole constituents, including symbols and subscripts. Format A is for text, and in- volves only symbols. Both format S and for- mat A ... that calls for reading in format S from a designated channel, the next constituent from the input is brought into the workspace where it replaces the designated numbered constituent. For ex...

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

... incu- bated for 4 days with each of the peptides (10 lm), and cells were fixed and used for immunocytochemical analyses. Immunocytochemistry Neurons were fixed in 4% paraformaldehyde for 20 min at ... to transformed Ca 2+ -competent E. coli cells (ER2566) by heat shock. The transformed cells were spread on LB agar plates containing ampicillin (50 mgÆL )1 ), single colonies were picked fo...

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

... labelled information for training. Our sys- tem extracts transliteration pairs in an unsupervised fashion. It is also able to utilize labelled information if available, obtaining improved performance. We ... of the Association for Computational Linguistics, pages 469–477, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics A Statistical Model for...

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

... p null = 10 −10 for this value in the experiments we report below. 784 either φ P z i for phrase pairs or φ null for single lan- guage phrases. We choose Dirichlet process (DP) priors for these parameters: φ P z i ∼ ... proce- dure for each sentence pair is non-trivial, prov- ing NP-complete for learning phrase based models (DeNero and Klein, 2008) or a high order poly- nomial (O(...

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