Báo cáo khoa học: "COMPUTATIONAL COMPLEXITY OF CURRENT GPSG

Báo cáo khoa học: "COMPUTATIONAL COMPLEXITY OF CURRENT GPSG THEORY" docx

... property of GPSGs is straightforwardly inter- esting to GPSG linguists. As outlined by GKPS, "an important goal of the GPSG approach to linguistics [is! the construction of theories of the ... paper pinpoints sources of complexity in the current GPSG theory and concludes with some linguistically and computationally motivated restrictions. 2 Complexity of G...

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

10
376
0

Báo cáo khoa học: "Computational Complexity of Statistical Machine Translation" doc

... decade, a variety of SM T algorithms have been built and empiri- cally tested whereas little is known about the computational complexity of some of the fundamental problems of SMT. Our work aims ... a translation of a given French sentence f with probability P r (f |e). Therefore, the problem of translating f can be viewed as a problem of ﬁnding the most probable translation...

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

8
345
0

Báo cáo khoa học: "Computational properties of environment-based disambiguation" docx

... number of ele- ments in each of the composed sets (assuming the sets are sorted in advance and remain so), the cal- culation of referent sets only adds a factor of to the size complexity of the ... representation of the potential referents of a quantiﬁer such as ‘at least one’ would contain every pair of non-empty sub- sets of the set of all entities, with a cardinal- it...

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

8
313
0

Báo cáo khoa học: "COMPUTATIONAL COMPLEXITY IN TWO-LEVEL MORPHOLOGY" pot

... change the fundamental complexity of the algorithms. Recall that the main ingredients of Kimmo runtime complexity are the mechanical operation of the automata, the difficulty of finding the right ... Ignoring the problem of choosing among alternative lexicons, it is easy to see that the use of finite-state ma- chinery helps control only one of the two remaining sources...

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

7
269
0

Báo cáo khoa học: "The Complexity of Phrase Alignment Problems" doc

... sentence pair consists of two word sequences, e and f. A set of phrases {e ij } contains all spans e ij from between-word positions i to j of e. A link is an aligned pair of phrases, denoted (e ij , ... practice, however, the space of align- ments has to be pruned severely using word align- ments to control the running time of EM. Notably, neither of these inference approaches...

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

4
231
0

Báo cáo khoa học: "Computational Modeling of Human Language Acquisition" ppt

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

1
424
0

Báo cáo khoa học: "The Complexity of Recognition of Linguistically Adequate Dependency Grammars" potx

... investigate various variants of DG and identify the sep- aration of dominance and precedence as a major part of current DG theorizing. Thus, no current variant of DG (not even Tesni~re's ... viewed as an ordered tree of depth one with node labels. Trees are combined through the identification of the root of one tree with a leaf of identical category of another...

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

7
114
0

Báo cáo khoa học: "Computational Aspects of M-grammars" potx

... set of possible S-trees and F~ is a collection of relations of type T m × T, m > 0. F~ contains all relations defined by the M-rules of subgrammar i. s The set of production rules of ... part of the translation system an S-tree of the source language is mapped onto a set of semantic derivation trees. Next, each semantic derivation tree is mapped onto a set of...

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

6
219
0

Báo cáo khoa học: "Computational Analysis of Move Structures in Academic Abstracts" docx

... subset S = {L 1 ,…, L k } of A, where each abstract L i consists of a sequence of sentence and move {t 1 , t 2 ,…, t k }. The moves t i take out of a value from a set of possible move M = {m 1 ,m 2 ,…,m n }. ... large number of unlabeled data. Meanwhile, we set some parameters of the proposed model, such as, the threshold of the number of collocation occurring in a...

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

4
300
0

Báo cáo khoa học: "Computational structure of generative phonology and its relation to language comprehension." pdf

... form," a string of phonetic units. The derivation consists of a series of cycles. On each cycle, the ordered sequence of rules is ap- plied to every maximal string of units containing ... (Chapter 9 of Kenstowicz and Kisseberth (1979) contains a less technical sum- maty of the SPE system and a discussion of sub- sequent modifications and emendations to it.) 3.1 Co...

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

8
429
0