Báo cáo khoa học: "AN ALGORITHM FOR GENERATING NON-REDUNDANT QUANTIFIER SCOPINGS" pptx

... An Algorithm For Generating Referential Descriptions With Flexible Interfaces Helmut Horacek Universit/it des Saarlandes FB 14 Informatik D-66041 Saarbrticken, ... basic terminology, we elaborate interface deficits of existing algorithms, form which we derive desi- derata for an improved algorithm. Then we describe concepts to meet these desiderata, ... neither for a visio...

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

... in. put form of (almos0 any format and returns a set of scoped formulas: scopings(form) = [ build-main(form) }, if form is quantifier free [ build-quant(q,r,s) I q ~ get-quants(form), r ... quantified formulas are 4- part objects. I will occasionally use a simple lan- guage of generalized quantifiers, where the formula format is DET(x,~(x ),¥(x )) for determiners DET and formul...

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

... serve as generative models for parallel bilingual sentences with weak order constraints. Focusing on Wans- duction grammars for bracketing, we formu- late a normal form, and a stochastic version ... quire more grammatical constraints; for example, tac- tics employing mutual information have been applied to tagged text (Magerumn & Marcus 1990). Algorithms for word alignment...

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

... memory. The algorithm is given no information whatsoever about the phonemic transcription .used, and even though cognate identification is carried out on the basis of a context-free one -for- one ... index: 9.32/8 -0.64 3.98 0.00 0.00 3.12 2.86 0.00 9.32 = 1.165 III PERFORMANCE OF THE ALGORITHM The algorithm as described has been implemented in Simula 67 on a DEC ELI...

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

... the algorithm Below we present the basic algorithm which implements the informal description given above. We give the algorithm in Prolog for convenience because various refinements to the algorithm ... of an expression and generating the arguments to that functor. In the presentation of the basic algorithm below we will make the simplifying assumption that for any form...

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

... describe the iterative filtering algorithm (Algorithm 1) and then the algorithm for the stop- ping criterion (Algorithm 2). In practice, we first run Algorithm 2 for 100 iterations to determine ... Meeting of the Association for Computational Linguistics, pages 430–439, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics An Algorithm for Uns...

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

... assumptions made by his formal model, we directly compare our algorithm to his. ACTION P~EPRESENTATION We use the action representation formally defined by Balkanski (1990) for modelling collaborative ... own beliefs for Contributes(7,A) and where pos- sible, more specific information as to how 7 contributes to A. Figure 2: The SharedPlan Augmentation Algorithm Step (4) of th...

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

... phrases for both languages. Noun phrases are then mapped to each other using an iterative re-estimation algorithm that bears similarities to the Baum-Welch algorithm which is used for train- ... correspondences for English "source" phrases. The algorithm is re- versible, by swapping E with F. The model for correspondence is that a source noun phrase in Ei is resp...

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

... lexical resources transform these resources into a network or graph and compute relatedness using paths in it (see Budanitsky & Hirst (2006) for an ex- tensive review). For instance, Rada et ... e.g. getPage(word) for retrieving Wikipedia articles titled word or getRelatedness(word1,word2), for com- puting the relatedness between word1 and word2, and display(path) for displaying...

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

... prepositions and if there are how the process of their word formation should be accounted for as their characteristics are not as straight forward as it is expected from other compound categories. ... completely behaving as compounds, it is doubtful that the process of word formation is a morphological one. The analysis put forward by this paper proposes “incorporation” by which an...

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