Báo cáo khoa học: "DEFAULTS IN UNIFICATION GRAMMAR" pdf

... _Z in this case). Thus, the seemingly space consuming procedure of bringing a formula into FML* NF and transforming the output of (9d) into FML* is avoided completely. The actual default unification ... formula's involved. Since default unification is a non-monotonic operation, however, in which parts of the default information may disappear, and since there are in gene...

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

... another unification using the result- ing constraint depends on which form of constraint the transformation process has returned. Obtaining compact constraints corresponds to avoiding unnecessary ... equivalent to obtaining all instances of X that satisfy {p(X), q(X)}. In order to be able to use the result of one unification in another unification, it would be useful to output re...

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

... This kind of sparsity bias avoids inducing competition between depen- dent types for each head type. We can achieve the desired bias with a constraint on model posteri- ors during learning, using ... Learning Approaches In our experiments, we compare PR learning to standard expectation maximization (EM) and to Bayesian learning with a sparsity-inducing prior. The EM algorithm optimizes marg...

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

... (in all around 5 million words), with the MT system automatically supplying the correct terminology (from a terminology pool of more than 350.000 German-English entries). In the following ... in a real MT application are pre- sented. Above this, means of linguistic engineering like weighting mechanisms are proposed. INTRODUCTION It has been proposed by a number of authors (cf....

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

... edge in the referring graph and an edge in the referent graph. It is defined in Table 3. This constraint indicates that the temporal relationship between two referring expressions (in one ... described in (Chai et al. 2004a). 2 Each node from the conversation context is linked to every node corresponding to the first pointing and the second point- ing. Graph-matching Proce...

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

... only be predicted if the grammar contains a matching functor category A~S. Finally, since we are working with the instantiated rules, morphosyntactic information can effectively be predicted ... procedure can in principle lead to an instanti- ated grammar that is considerably larger than the input grammar. For instance, given a grammar which distin- guishes between plural and singul...

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

... below). Since Determiners in English, German, and ~ch make such incomplete nominals complete, the Determiner definition inherits (i.e. includes) the definition of Complete. Lexical items in these ... mechanism for MEROINO grammatical asse~ous. The linguistic description should define certain string-combination operations (defined on siring I"YI~) associated with information s...

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

... the (non- )constituency information. This use of weighting factors in EM learning follows the approach dis- cussed in (Nigam et al., 2000). Since we are mainly interested in comparative ex- periments ... based on the NN tag in the C/D-trained PCFG by word alignment as an indication for (mainly) im- possible string spans. Applying this information in order to impose weighting factors...

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

... Figure 4: Using typed ~atures Typedeelarat~ns: (define-constituent determiner (definite distance demonstrative possessive)) InputFDd~cr~ingadeterminer: (determiner ((definite yes) (distance ... value in the FD resulting from the unification. [label:ANY] indicates that label ~- must have a ground value in the resulting FD. Note that NONE is best viewed as imposing constrai...

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

... parsing and generating lies in the nature of the input. The text, as a string of words, traditionally establishes the starting point of parsing; whether the processing is top-down or bottom-up, ... non-chaining roles. Rules that apply between the root and the pivot are, by definition, chaining rules; further, any rule which can be attached below the pivot is, by definition, a non...

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