Báo cáo khoa học: "A Self-Learning Agent for Exchanging Pop Trivia" doc

... grouping of information, thus expressing the information in- terdependencies. The language which SUG pro- vides for specifying these descriptions allows par- tiality both in the information about ... thereby also forgetting the predications over the nodes. This forgetting operation abstracts away from the existence of the forgotten node in the phrase structure. Once a node is forgot...

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

... example. 1 Introduction There is an increasing need for syntactical parsers for practical usages, such as information extrac- tion. For example, Yakushiji et al. (2001) extracted argument structures from ... data for the developers to clarify the defects of the grammar statistically. We applied willex to a large-scale HPSG-style grammar as an example. 1 Introduction There is an increa...

Ngày tải lên: 08/03/2014, 04:22

... has been proposed would appear to be really beyond the reach of a concerted effort. For information retrieval, and for social science, the implications of having a computer program able to reproduce ... all of it—becomes transformed into “meaningful” informa- tion before or as it reaches the person’s action direc- tion center. We may ask: What is the nature of the transformation i...

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

... green for words having a full agree- ment, red for words where no agreement can be found, orange for those words on which a valida- tion policy can be applied. A validation policy is a strategy for ... in- terconnection patterns for the WordNet lexicon is reported in Table 1. For the full set of interconnec- tions the reader can refer to Navigli and Velardi (2004). SSI performs di...

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

... 13–16, Athens, Greece, 3 April 2009. c 2009 Association for Computational Linguistics GOSSIP GALORE A Self-Learning Agent for Exchanging Pop Trivia Xiwen Cheng, Peter Adolphs, Feiyu Xu, Hans Uszkoreit, ... describes a self-learning soft- ware agent who collects and learns knowl- edge from the web and also exchanges her knowledge via dialogues with the users. The agent is bu...

Ngày tải lên: 31/03/2014, 20: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

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