Báo cáo khoa học: "Automatic Selectional Preference Acquisition for Latin verbs" doc

... 73–78, Uppsala, Sweden, 13 July 2010. c 2010 Association for Computational Linguistics Automatic Selectional Preference Acquisition for Latin verbs Barbara McGillivray University of Pisa Italy b.mcgillivray@ling.unipi.it Abstract We ... for Latin would benefit from exploiting the existing resources and tools through automatic lexical acquisition methods. In this paper we dea...

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

... of distilling the information source from the observation of a document and the step of generat- ing a title from the estimated information source, but it was for English documents. 1.1 Headline ... registered for every nominated sentence. A sim- ple stop-word list consisting of about 180 words was created for this purpose. Calculating matching score for every sentence is also pe...

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

... semantic information. The collocation for ambiguous words also contains semantic information about multiple senses for this ambiguous word. This paper uses the ambiguity of collocation for the ... overall process for this purpose. Figure 1 Processing for detecting sense boundary 3 Automatic clustering of collocation For extracting practical senses, the contextual words...

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

... source docu- ments. A subsequent mention of an entity in a source document which is extracted to be the first mention of the entity in the summary is proba- bly not informative enough. For each ... success for pre- dicting summary coherence. They can therefore be considered to be the state-of-the-art approach for automatic evaluation of linguistic quality. 4 Summarization data For our...

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

... it provides a platform for simulating a complex cellular activity because the product of the system is the pro- tein, the main player of the multiple cellular functions. Yu et al. [26] performed the ... gaining attention for its simplicity and high degree of controllability. Proteins are pro- duced only when template DNA or mRNA is added to the reaction mixture, followed by incubation fo...

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

... cri- teria separately, since different applications might have different preferences for each. For example, a paraphrase suggestion tool for a word processing software might be more concerned with semantic adequacy, ... are simple word substitutions, e.g. rabbit for bunny or gun for re- volver, while others are phrasal, e.g. frying meat for browning pork or made a basket for sco...

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

... pages 113–116, Columbus, Ohio, USA, June 2008. c 2008 Association for Computational Linguistics Kernels on Linguistic Structures for Answer Extraction Alessandro Moschitti and Silvia Quarteroni DISI, ... POVO (TN) - Italy {moschitti,silviaq}@disi.unitn.it Abstract Natural Language Processing (NLP) for Infor- mation Retrieval has always been an interest- ing and challenging research are...

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

... this in- terface in Ogg Theora format 1 can be viewed at http://www.cs.cmu.edu/˜dhuggins/touchcorrect.ogg. 1 For Mac OS X: http://xiph.org/quicktime/download.html For Windows: http://www.illiminable.com/ogg/downloads.html 18 ... applications. This interface is potentially useful for dicta- tion on portable touchscreen devices such as the Nokia N800 and other mobile Internet de- vices....

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

... tor, &, unique to SFG. Formulas involving ~ are called e~tension formulas and they have a more complicated semantics. For example, Dative has the following informal interpretation: Two ... 2. For c = 1, ,k, for each Graph(hi) of Wc, add [ni, c - 1, c] to Se. B. Completions: For c = 1, , k, do repeatedly until no more states can be added to Se: 1. Leftward Completion: F...

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

... P is a conjunction of literals (for dominance, labeling, parallelism etc). We use the abbreviations Xa - hY for XeY A X and X = Y for Xa*Y A Ya*X. For simplicity, we view inequality ... elements) in the Constraint Language for Lambda Structures (CLLS) (Egg et al., 2001). CLLS is an expressive tree description language that provides a uniform framework for seman- tic under...

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