Báo cáo khoa học: "Simplifying Text for Language-Impaired Readers" ppt

... attentional information to produce coherent text (McKeown, 1985, McCoy, 1985, Paris, 1988b), omitting intentional informa- tion, or conflating intentional and rhetorical information (Hovy, ... information outlined by Grosz and Sidner as well as an explicit representation of the rhetorical structure of the texts it generates. We present a text planner that builds a de- tailed...

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

... 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

... natural-language texts; but there are major obstacles to placing relevant texts in the hands of those who need them. Even when texts are made available in machine-readable form, documents relevant ... for presenting information to users under a given set of circumstances. I believe we can look forward to rapid progress on the use of multimedia communication, especially in mixtures of...

Ngày tải lên: 21/02/2014, 20: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

... context of grammatical formalisms. For the following discussion fix a particular grammar G = (n,E,A~). Definition 5. Let Tc : Z -+ Z be a trans- formation on sets o.f items, where .for every ... 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 grammars a...

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

... This poses challenges for a number of NLP applications such as machine translation, speech recognition, text classification, information extraction, or information retrieval. For machine translation, ... options for the German word Aktionsplan Aktionsplan Empirical Methods for Compound Splitting Philipp Koehn Information Sciences Institute Department of Computer Science University...

Ngày tải lên: 08/03/2014, 21: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 ... numbers, the incoming text must be con verted from the written alphabet into a numeri- cal form acceptable to the machine. Several different coding schemes are available for this...

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

... Greece, 3 April 2009. c 2009 Association for Computational Linguistics A text- based search interface for Multimedia Dialectics Katerina Pastra Inst. for Language & Speech Processing Athens, ... commu- nication. In this paper, we present a sup- port tool for COSMOROE, a theoretical framework for modelling multimedia di- alectics. The tool is a text- based search in- terface t...

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

... 2002). Such slow exe- cution time is inadequate for Information Retrieval, Question Answering, or Text Mining, where fast analysis of large quantities of text is indispensable. This paper presents ... calcu- lated in an explicit form as: function PKI classify (X) r = 0 # an array, initialized as 0 foreach i ∈ X foreach j ∈ h(i) r j = r j + 1 end end r esult = 0 foreach j ∈ SV r esult =...

Ngày tải lên: 08/03/2014, 04:22