Báo cáo khoa học: "Compositional Semantics for Linguistic Formalisms" pptx

... fully-abstract semantics for linguistic formalisms. For lack of space, some proofs are omitted; an extended version is avail- able as a technical report (Wintner, 1999). 2 Grammar semantics Viewing ... languages, to the domain of linguis- tic formalisms. We study alternative definitions for the semantics of such formalisms, suggest- ing a denotational semantics that we s...

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

... notation for a fully lntensional natural- language semantics (such as the semantics presented in Rapaport 198-1 ), the n(~es would represent only mtensional items. Thus, a semantics for such ... ~anthdates For L w . For /,. I Focus on ~,haptro's propositional ,Semantic Network Processing System (SNell.': Shaptn) 1979). For which Israel (1983) has offered a I&apo...

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

... Transforming the entire for- est to n-ary form is intractable, however, because the number of hyperedges would be exponential in n. Instead, we include only the top k n-ary back- traces for each forest ... Collapsing Binarization To facilitate a change in binarization, we transform the translation forest into n-ary form. In the n-ary forest, each hyperedge corresponds to an original gramm...

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

... Equivalents. If the new form is a form of a word in the old glossary, the Eng- lish equivalents previously used are carried forward. If no form of the word has occurred before, the linguist assigns ... different occurrences of the same form. Research Methodology 9 10 Edmundson and Hays Word: a form that represents a set of forms differing only in inflection. For example, "...

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

... the Association for Computational Linguistics, pages 171–175, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Syntactic Stylometry for Deception Detection Song ... node, e.g., PRPˆNP 4 → “you”. 4 Experimental Results For all classification tasks, we use SVM classi- fier, 80% of data for training and 20% for test- ing, with 5-fold cross vali...

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

... number of standard devices are available for coding the incoming text for insertion into the machine and, after the translation process is completed, for decoding and printing the translation ... its original form, the dissection scheme for endings and compounds can be tried; if this fails, the word can be printed through without alteration. Several methods are available for...

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

... queries are not phrases in the linguistic sense. However, this does not seem to cause any real problem because non -linguistic phrases may form their own clusters. For example, one cluster contains ... paradigm for parallel programming (Dean and Ghemawat, 2004). The most straightforward MapReduce implementation of K-Means would be to have mappers perform Step ii and reducers...

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

... Language and Information Stanford University Abstract The design, implementation, and use of grammar for- ma]isms for natural language have constituted a major branch of coml)utational linguistics ... tionships among various formalisms, suggest new possibil- ities for linguistic analysis (the subject matter of the for- malisms), and establish connections between grammar for-...

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

... to model the linguistic behaviour of adjec- tives using no previous lexical knowledge. There- fore, information on derivational morphology was not used at this stage (but it was for analysis; ... presents a different set of linguistic properties. Therefore, even those adjectives which are ambiguous exhibit the properties of one sin- gle class in each particular context. For instance,...

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

... processed dataset, for a number of lan- guages there were missing values, esp. for features 1037 (12) through (14). The linguistic reasons for this were two-fold: (i) lack of reliable information; ... that they are imple- mented in a uniform way (in all three cases by con- verting a logic formula - either CNF or something more complicated - into a DNF formula), and all can use...

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