Báo cáo khoa học: "A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms" potx

... Shake-and-Bake generation algorithm of (Whitelock, 1992) is NP- complete. We present a polynomial time algorithm for lexicalist MT generation pro- vided that sufficient information can be ... An Efficient Generation Algorithm for Lexicalist MT Victor Poznafiski, John L. Beaven &: Pete Whitelock * SHARP Laboratories of Europe Ltd. Oxford Science Park, Oxford OX4 4GA U...

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

... elsewhere (Brown et al., 1993). Translation is performed in the reverse direction from generation, as usual for recognition under gen- erative models. For each Chinese sentence c that is to be translated, ... that exploits bracket- ing information (Wu and Ng, 1995). If any brackets for the Chinese sentence can be supplied as addi- tional input information, produced for example...

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

... into on- tological domains for modelling some forms of metaphors. • Types are not sufficiently 'constrained' to ac- count for the constraints holding, for each predicate, on the ... in particular for the Telic role, (explored e.g. in the EuroWordNet project, the European WordNet). Qualias are well-designed and useful for nouns, but look more artificial for other...

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

... Association for Computational Linguistics:shortpapers, pages 558–563, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics A Probabilistic Modeling Framework for Lexical ... (e.g. parsing) aiming at high performance. Nevertheless, simple entailment methods, per- forming at the lexical level, provide strong baselines which most systems did not outperform...

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

... included. The algorithm then loops over each context (CONTEXTS is the set of all contexts): for r, w ′  in CONTEXTS: WLIST = set of all w where w, r, w ′  exists for w 1 in WLIST: for w 2 in ... UK adam@lexmasterclass.com Abstract Gorman and Curran (2006) argue that the- saurus generation for billion+-word corpora is problematic as the full computation takes many days. We pres...

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

... electrode. For starch extraction, pellets for ethanol extraction were solubilized by heating them to 95 °Cin0.5m NaOH for 30 min. After acidification with 1 m CH 3 COOH, the suspension was digested for ... pattern search method for bound constrained gloabal optimiza- tion. J Glob Optim 39 , 197–219. 34 Schmidt H & Jirstrand M (2006) Systems Biology Tool- box for MATLAB: a compu...

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

... target for prey capture. However, the genetic information for ÔunderdevelopedÕ a-conotoxins targeting other nAChR subtypes might still be present in the snails and could supply novel ligands for ... indicating that at least two other subunits are required for effective channel formation. In Correspondence to A. Nicke, Max Planck-Institute for Brain Research, Deutschordenstr. 46, D-6...

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

... paper, we formulate ex- tractive summarization as a two step learn- ing problem building a generative model for pattern discovery and a regression model for inference. We calculate scores for sentences ... 2010. c 2010 Association for Computational Linguistics A Hybrid Hierarchical Model for Multi-Document Summarization Asli Celikyilmaz Computer Science Department University of Cal...

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

... relevant to the target concerned. Therefore, we argue that existing information representation i.e. bag-of-word, cannot satisfy the information needs for opinion retrieval. In this paper, ... and Ounis, 2006). Therefore, in this paper we regard the information needs for opinion retrieval as relevant opinion. 2.2 Motivation of Our Approach In traditional information retrieval (IR...

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

... re-ranking model performs rather well for a limited number of candidate structures, and out- performs Charniak’s model when k = 5. In this case we observe a small boost in performance for the detection ... candi- dates? Since no parser currently exists for the TDS representation, we utilize a state of the art parser for PS trees (Charniak, 1999), and transform each candidate to TDS. T...

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