Báo cáo khoa học: "Optimal k-arization of Synchronous Tree-Adjoining Grammar" ppt

... The value of the PSD at frequency f, P(f), is proportional to the square of the amplitude of the signal at that frequency. We therefore define the observability of a frequency component of the signal, ... spectrum of a signal) was computed from the time series of the number of substrate molecules (N S ) for each simulation individually [20], and the average PSD was then compute...

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

... the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which generates bags (i.e. multi-sets) of words. Us- ing this new type of rule in ... the design and implementation of a parser for this kind of grammar. Section 5 gives an example of such a grammar designed for the purpose of automatic tagging of queries. Sectio...

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

... this kind of knowledge, insofar as they mark out the most salient aspects of the most frequently evoked concepts. In this pa- per we perform a multilingual exploration of the space of common-place ... Hao School of Computer Science University College Dublin Belfield, Dublin 4, Ireland yanfen.hao@ucd.ie Guofu Li School of Computer Science University College Dublin Belfield, Dublin 4,...

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

... in a number of ways, the simplest of which is the notion of one word preceding or following another. Such information is encoded as a positional predicate in the test of a type of production ... semantic features of "boat s and finds that they match the selectional restrictions required of the subject of "sail'. The action of this request is executed, in s...

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

... type of ambiguity detected by Rule 3. can often be eliminated by instructing the users of the specification system to use modals when possi- ble. In case of the example above, to force one of ... implementation of a knowledge-based approach to natural language understanding. The knowledge PHRAN has of the language is stored in the form of pattern-concept pairs (PCPs). The...

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

... re- strictive form of free order CCG. Both Hoffman and Baldridge ignore morphology and treat the inflected forms as different words. The rest of this section contains an overview of the underlying ... review of the relevant work (1.2). In Section 2, the properties of the data are explained. Section 3 then gives a brief sketch of the algorithm used to induce a CCG lexicon, with some...

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

... viewpoint of getting as far as possible in the interpretation or production process despite missing rules or incompatibilities in the inventories of speaker and hearer, and from the viewpoint of supporting ... trajectory of a ball falling from a tower, we engage in computational simulations and robotic experiments that create (new) artificial phenomena that have some of the character...

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

... Implicational The existence of x implies the existence of y op. - 11: Weakly Implicational The existence of x sometimes implies the existence of y op. - Table 1: List of semantic primitives. In ... (1988) combines a set of nine fairly specific relations (e.g., FOCUS -OF, PRODUCT -OF, SETTING -OF) . The key to determine plausibility is the transitivity charac- teristic of the aspe...

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

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

... a finite set of clauses where and each of is a predicate of the form where is its arity , , and each of , , is an argument . Each occurrence of a predicate in the LHS (resp. RHS) of a clause is ... . The ar- ity of an -clause is arity , and the arity of a grammar (we have a -PRCG) is the max- imum arity of its clauses. The size of a clause is the integer arity and the size...

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