Báo cáo khoa học: "Exploiting Web Redundancy for Answer Validation" pptx

... Is It the Right Answer? Exploiting Web Redundancy for Answer Validation Bernardo Magnini, Matteo Negri, Roberto Prevete and Hristo ... knowledge which connects an answer to a question can be quantitatively estimated by exploiting the redundancy of Web information. Experiments carried out on the TREC-2001 judged -answer collec- tion show ... answer validation based on the in...

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

... problem is par- ticular severe for WSD, since sense-tagged data must be collected separately for each word in a language. One source to look for potential training data for WSD is parallel texts, ... surrounding channel then forms a training example for a supervised WSD program in the next step. The average time taken to perform manual se- lection of target translations for...

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

... Association for Computational Linguistics Exploiting Multiple Treebanks for Parsing with Quasi-synchronous Grammars Zhenghua Li, Ting Liu ∗ , Wanxiang Che Research Center for Social Computing and Information ... present a simple and effective framework for exploiting multiple monolingual treebanks with different annotation guidelines for pars- ing. Several types of transformation pa...

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

... PS parses for each sentence in C DS , and convert PS to DS for each parse; — For each sentence in C DS Do  ˆ t=argmax t Score(x i,t ), and select the ˆ t-th parse as a converted tree for this ... POS tag information, dependency structures and depen- dency tags in test set for conversion. Similarly, we used POS tag information in the test set to restrict search space of the parser...

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

... 969–976, Sydney, July 2006. c 2006 Association for Computational Linguistics Modelling lexical redundancy for machine translation David Talbot and Miles Osborne School of Informatics, University of Edinburgh 2 ... be re-enforced across the model. For instance (see Fig. 1), if cymru and gymru are clustered to- gether, the parameter for feature ψ 1 , shown above, may increase. This i...

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

... develop a novel prior for named entity recognition that exploits the hierarchical fea- ture space often found in natural language domains (§1.2) and allows for the transfer of information from labeled ... 2001), which are now one of the most preferred sequential models for many natural language processing tasks. The parametric form of the CRF for a sentence of length n is given as fol...

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

... concentrated our efforts on presenting different types of knowledge and their interrelations because this kind of infor- mation is typically relevant for explanations. We formally reconstruct ... to convey the message adequately. 1. INTRODUCTION The task of providing informative natural language explanations for illustrating the results produced by decision support systems has be...

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

... incorporating web- derived selectional preference features for sta- tistical dependency parsing, especially for longer de- pendencies? Question II: How well do web- derived selec- tional preferences perform ... al. (2010). The former uses the web- scale data explicitly to create more data for training the model; while the latter explores the web- scale N-grams data (Lin et al., 201...

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

... broadcast audio for information access. At LIMSI, broadcast news tran- scription systems have been developed for English, French, German, Mandarin and Portuguese, and systems for other languages ... in de- veloping a system for processing broadcast au- dio for information access. The system has two main components, the speech transcription com- ponent and the information retrieval c...

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