Báo cáo khoa học: "A LOGICAL SEMANTICS FOR NONMONOTONIC SORTS" pptx

... Domain of Descriptions: Logical Formulas We now define the domain FML of logical for- mulas which describe feature structures. Figure 3 defines the syntax of well formed formulas. In the following ... 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...

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

... 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 ... derived for the constituent, but lacking restrictive information associated with any focused components. 2.3 Two-part semantics In addition to p-sets, two semantic expres...

Ngày tải lên: 08/03/2014, 18: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 ... peptides should lead to aggregation and formation of inclusion bodies, and that Ab would be less susceptible to degradation in this form. More- over, the formation of inclusion bodies enable...

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

... a considerable engineer- ing effort, yet there is very limited avail- ability of off-the shelf tools for researchers whose interests are not in coreference, or for researchers who want to concentrate ... standoff format of the MMAX2 annotation tool (M ¨ uller and Strube, 2006) with MiniDiscourse, a library that efficiently imple- ments a subset of MMAX2’s functions. Using a generic format...

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

... allows that use of future information in ad- dition to past information. The pipeline model nat- urally allows access to all the past information. Algorithm 3 Pseudo code for the look ahead algo- rithm. ... rightmost S action taken before a non-S action happens. Note that it is possible that there is a relation between a and b, but we can- not perform R or L now. Therefore, we should consid...

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

... general information about the system’s components, a description and time- stamp for each system event and user event, names and timestamps for the system-recorded sound files, and timestamps for ... Open-ended tasks prompted users to search for any type of information with any input modality. The tasks in the two sets paralleled each other. For example, if one set of tasks as...

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

... only for N’s small enough to yield non-zero P(n) scores. For test corpora of reasonable size, the metrics are usually well-defined for N≤4. The BLEU proposed by Papineni et al. (2002) for ... recall scores for increasingly longer n-grams. For test corpora of reasonable size, the metrics are usually well- defined for N≤4. The ROUGE metric proposed by Lin and Hovy (2003)...

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

... time: we in- tend for it to generalize and encapsulate best practices, and serve as a testbed for new practices. Dyna is now be- ing used for parsing, machine translation, morphological analysis, ... used for parsing, syntax-based machine translation, morphological analysis, grammar induction, and finite-state operations. It is well known that various parsing algorithms for CFG and o...

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