Báo cáo khoa học: "An Algebra for Semantic Construction in Constraint-based Grammars" pot

... seman- tics within HPSG is so underdetermined. In this paper, we begin by giving a formal ac- count of a very simplified form of the algebra and in §3, we consider its interpretation. In §4 to §6, we ... contribute semantic information, but we assume that this information obeys all the same constraints as the semantics for a sign, so in effect such a rule is semantically equivale...

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

... Another point to be mentioned is a delicate semantic difference between the meaning of these nouns in other constructions and in combination with prepositions. For example “dalil” in following ... incorporated to a P o constructing a compound preposition. In this way tagging prepositions and parsing texts in Natural Language Processing is defined in a proper manner....

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

... generation, but is in fact essential in any intelligent system. General tools for acquiring such knowledge are emerging; we are employing KREME [1] for ac- quiring and maintaining the domain knowledge. ... debugging aids nor in- tegration with tools for acquiring and maintaining the 38 domain model. We intend to integrate the various acquisition, consistency, editing, and m...

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

... concepts of the ontology 4 Semantic tagging The purpose of the semantic tagging process is to an- notate words with domain-specific informations. In our case, domain-specific informations are the con- cepts ... using domain related infor- mations such as airplane names, locations, organi- zations, detection means (radar search, div- ing), status of a SAR mission (completed, con- tinuing,...

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

... ex- tensive review). For instance, Rada et al. (1989) traverse MeSH, a term hierarchy for indexing ar- ticles in Medline, and compute semantic related- ness straightforwardly in terms of the number ... 2005), information retrieval (Finkelstein et al., 2002), information extraction pattern induc- tion (Stevenson & Greenwood, 2005), interpretation of noun compounds (Kim & Bald...

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

... participate in any optimal bracketing. 248 5 Postprocessing 5.1 A Singleton-Rebalancing Algorithm We now introduce an algorithm for further improving the bracketing accuracy in cases of singletons. ... numbers of words in the two languages, creating potential difficulties for word alignment; what is a single word in English may be realized as a compound in Chinese. Since...

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

... context-free one -for- one matching of indivldual characters, its cognation decisions are bettered by a trained linguist using more information only in cases of wordllsts sharing less than 40% ... This is not surprlsing, since there is Do significant difference in the degrees of certainty corresponding to z scores of 4 and beyond. The last improvement in the performance of the...

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

... systems, Frail distinguishes for- ward and backward-chaining use of modus-ponens. All of our semantic interpretation rules are forward-chaining rules'. ( (word-inst ?instance ?part-of-speech ... 87 Let us start by giving an informal semantics for the spe- cial predicates and terms used by the system. Since we are doing semantic interpretation, we are translating be- twee...

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

... putational point of view: if our processed tree-bank has semantic determinacy, we do not need to involve the semantic rules in the parsing process. Instead, the parser yields parses containing information ... T, with type-information at every node, is semantically determinate, iff we can determine a unique, correct semantic rule for every CFG rule R 3 occurring in T. Semant...

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

... Proceedings of the Sixth International Workshop on Constraint Modelling and Reformulation (ModRef’07), Provi- dence, Rhode Island, USA. David Weininger, Arthur Weininger, and Joseph L. Weininger. ... prop-2-yn-1-imine After modeling a CSP according to the semantic represenation of the input name, the next step in processing is to run a constraint solver. This will be described in the fo...

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