Báo cáo khoa học: "A Logic of Semantic Representations for Shallow Parsing" pdf

... Proceedings of the 12th Conference of the European Chapter of the ACL, pages 451–459, Athens, Greece, 30 March – 3 April 2009. c 2009 Association for Computational Linguistics A Logic of Semantic Representations ... 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 v...

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

... automati- cally generated before the search for a proof starts. Additionally, the prover uses a SUMO knowledge base of temporal reasoning axioms that consists of axioms for a representation of time points ... Representation For the textual entailment task, our logic prover uses a two-layered logical representation which captures the syntactic and semantic propositions encoded...

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

... exactly the words of one argument of p, put F p,a in T + (positive examples), otherwise put it in T − (negative examples). For example, in Figure 1, for each combina- tion of the predicate give ... the sentence, e.g. after for Arg 1 and before for Arg 0 . - Voice: This feature distinguishes between active or pas- sive voice for the predicate phrase, e.g. active for every arg...

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

... Computing Sciences, University of Sussex Falmer, Brighton BN1 9QH, UK *Center for the Study of Language and Information, Stanford University Ventura Hall, Stanford, CA 94305-4115, USA {kiefer, ... reduc- ing effort in the lexicon stage to a minimum. We continue to compute morphological infor- mation online, due to the significant increase of entries (a factor of 10 to 20 fo...

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

... gen- eration of basic Stanford dependencies (for constituent parsers) and part -of- speech tagging (for dependency parsers). 3 Results Table 3 tabulates efficiency and performance for all parsers; ... Linguistics A Comparison of Chinese Parsers for Stanford Dependencies Wanxiang Che † car@ir.hit.edu.cn Valentin I. Spitkovsky ‡ vals@stanford.edu Ting Liu † tliu@ir.hit.edu.cn † School...

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

... summaries of at most 250 words for each cluster. For each cluster, a title and a narrative describing a user’s information need are provided. The narrative is usually composed of a set of questions ... and its variant. In Proceedings of the 12th Conference of the European Chapter of the Association for Compu- tational Linguistics, pages 781–789. Association for Computation...

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

... BUILDING(s) (of) ONE/ALONE (of) DOUBLE/GEMINATE (of) ANNUAL/YEARS (of) LAYER/LAMELLA (of) (to /for) (by/with/as) LINE (of) THIN-CRUST(s) HOW/AS/BUT (of) (to /for) (by/with/as) FOSSILIZED (of) (to /for) - ... ON/IN/AT/TO /FOR/ - BY/WITH (of) MORPHOLOGICAL * MORPHOLOGICAL-FEA- TURES (of) REMAINDERS/RADICALS (of) SELVES (of) - PLANTS. WITH/FROM/ABOUT (by/with/as)CONSIDERA- TION/CALCUL...

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

... the document. From a linguistic point of view, a document is made up of words, and the semantics of the doc- ument is determined by the meaning of the words and the linguistic structure of the document. The Naive ... A Comparison of Event Models for Naive Bayes Anti-Spam E-Mail Filtering Karl-Michael Schneider University of Passau Department of General Linguistics Innstr. 40...

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

... Linguistics A Scalable Probabilistic Classifier for Language Modeling Joel Lang Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh ... inter- polated form of Kneser-Ney smoothing (Kneser and Ney, 1995) was shown to consistently outperform a variety of other smoothing techniques (Chen and Goodman, 1999) and...

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

... provides a proof of viability of transformation-based techniques in the form of a number of processors, including a (widely- distributed) part -of- speech tagger (Brill, 1994), a procedure for prepositional ... cult because of the lack of a single metric for re- porting scores. Two common measures of perfor- mance are recall and precision, where recall is de- fin...

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