Báo cáo khoa học: "Applying Machine Learning to Chinese Temporal Relation Resolution" pptx

... taken into account in temporal relation resolution, and introduces how these features are expressed in Chinese. In Section 3, the proposed machine learning algorithms to identify temporal relations ... on Chinese temporal relation extraction was first reported by Li and Wong (Li and Wong, 2002). To discover temporal relations em- bedded in a sentence, they devised...

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

... present paper we use a machine- learning ap- proach in order to add Cast3LB function tags to nodes of basic constituent trees output by a prob- abilistic parser trained on Cast3LB. To our knowl- edge, ... attributed to two main factors. Firstly, the mapping from Cast3LB tags to LFG grammat- ical functions is not one -to- one. For example three Cast3LB tags (CC, MOD and ET) are al...

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

... to the user model), we would need to explore many more strategies through interactions with users to find an optimal one. One way to reduce costs for build- ing such an optimised strategy is to ... lead to repetitive action, i.e. if a screen output was once shown to this user, and the user has previously used or referred to the screen, the screen will be used over and over agai...

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

... the use of learning for NERC. In- stead of using ML to construct a NERC system that will be used autonomously, the system con- structed by ML, according to our approach is used to monitor the performance ... Us- ing Machine Learning Machine learning has been used successfully to control a rule-based system that performs a dif- ferent task, namely document filtering (Wolinski...

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

... classes over relations (see below) axe to apply to discourse semantics representations and to discourse relations respectively. SEM like:[j,m] ] ] IN _ OUT [like:[m]] With regard to VPE resolution, ... although in (15), bottom- up (or local) information seems to prevail, example (16) shows that in some cases, top-down information may be strongest: (16) (a) Jon won't g...

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

... for German, we were able to obtain the system submitted by (Curran and Clark, 2003) to the 2003 CoNLL competition. In order to run the recogniser, the data needs to be tokenised, tagged and lemmatised, ... presents a novel ensemble learning approach to resolving German pronouns. Boosting, the method in question, combines the moderately ac- curate hypotheses of several classifiers...

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

... types of extensions to the Soon et al. corpus-based approach. First, we propose and evaluate three extra-linguistic modifications to the machine learning framework, which together pro- vide substantial ... the problem of determining which noun phrases (NPs) refer to each real-world entity mentioned in a doc- ument. Machine learning approaches to this prob- lem have been reasona...

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

... A Machine Learning Approach to Pronoun Resolution in Spoken Dialogue Michael Strube and Christoph M ¨ uller European Media Laboratory GmbH Villa Bosch Schloß-Wolfsbrunnenweg ... (A3) has to have access not only to (B2) but also to (A1). 3 Data 3.1 Corpus Our work is based on twenty randomly chosen Switchboard dialogues. Taken together, the dia- logues contain 30810 tokens ... assu...

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

... in- terpretation of the sentence, and could contribute to a natural language understanding or machine translation application. Since WH dependencies also tend to distort the surface subcategorization properties ... the WH operator, and train a classifier to trace down- ward from there, eventually predicting the location of the gap. At each node we encounter, the classi- fier chooses e...

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

... (84.36% in test). There- fore, we decided to adopt this as a basis in order to get an automatic clause splitting tool for Basque. But as it is known, machine learning techniques cannot be applied ... for each token, we stored whether it was followed by a comma or not. That is, for each word (token), it was stored whether a comma was placed next to it or not. Therefore, each to...

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