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 linguisti- cally and computationally motivated restrictions. 2 Complexity of GPSG Components A generalized ... inherent in the GPSG framework. SOur goal is to identify sources of complexity in GPSG theory. The gen- eralization to arbitrary sets allows a fine-grained study of one component of GPSG theory...

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

... decade, a variety of SM Talgorithms have been built and empiri-cally tested whereas little is known aboutthe computational complexity of some of the fundamental problems of SMT. Ourwork aims ... a translation of a given French sentence f withprobability P r (f |e). Therefore, the problem of translating f can be viewed as a problem of ﬁndingthe most probable translation of f :e∗= ... l)-COUNT-3 is in #P.Proof: Similar to the proof of Lemma 5.Theorem 3 (j, i, m, l)-COUNT-3 is #P-Complete.293.5 (φ, e)-COUNT-3Lemma 8 PERMANENT ≤T(φ, e)-COUNT-3.Proof: Let e = e1. . ....

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 thesets 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 thepotential referents of a quantiﬁer such as ‘at leastone’ would contain every pair of non-empty sub-sets of the set of all entities, with a cardinal-ity on the order of . If ... the forest and the time complexity of processing it, where is the num-ber of objects and events in the run-time environ-ment. Thus, the total space and time complexity of the above algorithm...

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 of complexity. Stepping ... quence of compiling [the grammar rules into au- tomata] is that the complexity of the linguistic de- scription of a language has no significant effect on the speed at which the forms of that...

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

... sentence pair consists of two word sequences, eand f. A set of phrases {eij} contains all spans eijfrom between-word positions i to j of e. A link is analigned pair of phrases, denoted (eij, ... 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 of- fers any test to know ... the left of the ﬁrst word. In this paper,we assume all phrases have length at least one: j > i and l > k.25Both the conditional model of DeNero et al.(2006) and the joint model of Marcu...

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

...

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 tree. This formalization ... 4 The complexity of DG Recognition Lombardo & Lesmo (1996, p.728) convey their hope that increasing the flexibility of their conception of DG will " imply the restructuring of some...

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

... set of possi- ble 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 S-trees of the ... gram- mar consists of ~ set of subgrammars. Each of the sub- grammars contains a set of M-rules and a regular ex- pression over the alphabet of rule names. The set of M-rules is subdivided into...

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

... subset S = {L1,…, Lk} of A, where each abstract Li consists of a sequence of sentence and move {t1, t2,…, tk}. The moves ti take out of a value from a set of possible move M = {m1,m2,…,mn}. ... 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 given abstract, the weight of move sequence ... development of globalization, English for Academic Purposes has drawn researchers' attention and become the mainstream of English for Specific Purposes, particularly in the field of English of...

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 Complexity of segmental ... Computational structure of generative phonology The structure of a computation may be described at many levels of abstraction, principally includ- ing: (i) the goal of the computation; (ii)...

Xem thêm