Báo cáo khoa học: "EMPIRICAL STUDIES OF DISCOURSE REPRESENTATIONS FOR NATURAL LANGUAGE INTERFACES" ppt

... EMPIRICAL STUDIES OF DISCOURSE REPRESENTATIONS FOR NATURAL LANGUAGE INTERFACES Ntis Dahlb~ick Ame JOnsson Natural Language Processing Laboratory Department of Computer and Information Science ... future only be able to handle a subset of natural language. The usability of this type of in- terfaces is therefore dependent on finding subsets of natural langua...

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

... Applicative Language) . In PAL, new composite expressions are constructed only with a binary form of function application. Thus, if z and I/ are well-formed formulas of PAL, so is a form z(y). ... Expressions of PAL are related to expressions of natural language as follows: Generally, when a phrase consists of its immediate descendants, say z and y, a PAL expression for...

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

... semantics are a fruitful source of inspiration for computer languages and systems designers. The complexity of natural language and the high level of abstraction of most linguistic and semantic ... model of GB theory, but we feel that the transfer of some of its main principles and results to the field of natural language processing is worth investigating and...

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

... pattern of the form: noun cc noun 1 , as well as lists of any number of nouns separated by commas and ending in cc noun. Each noun in the list is linked with every other noun in the list. Thus for a ... co-occurrence counts, of the form: 1 + log(count), as the term weights for the word vectors. To measure the similarity of two words, w 1 and w 2 , we calculate the cosine of th...

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

... compares a number of statistical and machine learning techniques for ordering se- quences of adjectives in the context of a natural language generation system. 1 The problem The question of robustness ... so for which semantic information is least necessary. While we do not reliably have access to the meaning of an adjective, we do always have ac- cess to its form. And, fort...

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

... techniques of word segmenta- tion captured many language features such as context words, parts of speech, collocations and semantics [4], [5]. These reported about 95-99 % of accuracy. For sentence ... pmittrap@notes.nectec.or.th Abstract This paper reviews the current state of tech- nology and research progress in the Thai language processing. It resumes the charac- teristics...

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

... Automatic Construction of Frame Representations for Spontaneous Speech in Unrestricted Domains Klaus Zechner Language Technologies Institute Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, ... language in unrestricted domains. There are several reasons why so far an in-depth analysis of this type of language data has been con- sidered prohibitively hard: • in...

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

... form because τ is a tree; it is a solved form of ϕ by construction. Proposition 3. Every RMRS ϕ has only a finite number of solved forms, up to renaming of vari- ables. Proof. Up to renaming of ... of choices for the subsets S  in condition 2 of Def. 7, and there is only a finite set of choices of new dom- inance atoms that satisfy condition 3. Therefore, the set of solved...

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

... for example, have a DISPLACEMENT of 320 and a LENGTH of 144. (4) 7%11 aircraft carriers in the ONR database have R~S of 0, FUEL TYPE of BNKR, FLAG of BLBL, BEAM of 252, ENDURANCE RANGE of ... only one of the breakdowns. 5.0 SYSTEM OVERVIEW The ENHANCE system consists of ~ set of independent modules; each is responsible for generating some piece of descriptiv...

Ngày tải lên: 17/03/2014, 19:21

... performing these tasks. In general we can say that the use of structural features can im- prove the performance of NLP tasks that require the details of the contents to perform the task. Most of ... : j] def = s i . . . s j of S (allowing the existence of gaps), the position of u in S is written as i = (i 1 : i |u| ). The length of S[i] is l(i) = i |u| − i 1 + 1. For example...

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