Báo cáo khoa học: "Chinese Comma Disambiguation for Discourse Analysis" pptx

... Association for Computational Linguistics, pages 786–794, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Chinese Comma Disambiguation for Discourse Analysis Yaqin ... information to train and test supervised models. This discourse information is formalized as a classification of the Chinese comma, with each class representing the bound...

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

... of the Association for Computational Linguistics, pages 142–150, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Learning Word Vectors for Sentiment Analysis Andrew ... Pham, Dan Huang, Andrew Y. Ng, and Christopher Potts Stanford University Stanford, CA 94305 [amaas, rdaly, ptpham, yuze, ang, cgpotts]@stanford.edu Abstract Unsupervised vector-based...

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

... to make the scheme applicable to reliable an- notation for several non -discourse analysts (and for potential automatic annotation). For the development of our scheme, we used computational ... work as basis of or support for own work? Figure 2: Decision tree for annotation Our materials consist of 48 computational lin- guistics papers (22 for Study I, 26 for Study II),...

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

... disturbing elements. As for morphol- ogy, verbs are expanded with all their tense forms (i.e. present, present continuous, past tense and past participle). Synonyms and morphological forms are added ... before, AltaVista was used as search engine. A baseline for the answer validation experiment was defined by considering how often an answer oc- curs in the top 10 documents among those (100...

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

... broadcast audio for information access. At LIMSI, broadcast news tran- scription systems have been developed for English, French, German, Mandarin and Portuguese, and systems for other languages ... in de- veloping a system for processing broadcast au- dio for information access. The system has two main components, the speech transcription com- ponent and the information retrieval c...

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

... consistency a set of formu- las is consistent if it is satisfiable. Testing a set of Kasper-Rounds formulas for consistency thus sim- ply reduces to finding a satisfier for that set. Formally, we ... would represent the information in Fig. 3 in terms of Kasper-Rounds default logic. The strict statements become normal KR formulas in W. For instance, the information for MIDDLE-VE...

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

... the sentence level beforehand. Input files may be numbered text files or annotated files in XML- format. The annotation records linguistic infor- mation on four levels: word form, base form, part-of-speech ... proposed link the information inherent in the link is stored in the different dynamic resources. The inflected word forms will be added to the word form re- sources and the base forms t...

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

... for evaluation. The unification operation is useful for other NLP tasks, for instance, com- bining information from two different annotation schemes or enriching one annotation scheme with information ... Different formal frameworks yield different parse and gold formal types. All types are transformed into multi-function trees. All gold trees enter generalization to yield a new gold fo...

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

... linguistic requirements which have had to be violated in order for the parse to succeed. Such descriptions might well form the basis for a useful interaction between system and learner. However, ... inputs. It also contains all the grammatical information necessary for providing the user with examples of correct usage. These two types of information ought to be sufficient to gen...

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

... so on. Before motivating the use of dependency rela- tions as features for our task, a brief overview about dependency relations follows. 3.1 Dependency Relations The dependency parse for a given ... given parser – we use the Stanford parser 1 for computing dependency relations. The word w j is usually referred to as the head word in the depen- 1 http://nlp.stanford.edu/software/ lex-pa...

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