báo cáo khoa học:" Endoscopic sinus surgery for maxillary sinus mucoceles" doc

Tài liệu Báo cáo khoa học: "Web-Scale Features for Full-Scale Parsing" doc

Tài liệu Báo cáo khoa học: "Web-Scale Features for Full-Scale Parsing" doc

... leave, in have NN IN time, for some NN IN money, for annual NNS IN reports, on Table 8: The highest-weight features (thresholded at a count of 400) of the before-word schema for a noun head and preposition argument ... error reduction. Results are for dependency parsing on the dev set for iters:5,training-k:1. tal errors break down by gold head. For example, the 12.1% total error...

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

10 450 0
Tài liệu Báo cáo khoa học: "A CONNECTIONIST PARSER FOR STRUCTURE UNIFICATION GRAMMAR" docx

Tài liệu Báo cáo khoa học: "A CONNECTIONIST PARSER FOR STRUCTURE UNIFICATION GRAMMAR" docx

... grouping of information, thus expressing the information in- terdependencies. The language which SUG pro- vides for specifying these descriptions allows par- tiality both in the information about ... predications for one node to the phase of the other node, then forgetting the first node. The for- getting operation is implemented with links which suppress all predications stored...

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

8 427 0
Tài liệu Báo cáo khoa học: "Incremental Parsing Models for Dialog Task Structure" doc

Tài liệu Báo cáo khoa học: "Incremental Parsing Models for Dialog Task Structure" doc

... to improved performance for any method. One utterance of context is best for shift-reduce and start-join; three is best for the connection path method. The shift- reduce method performs the best. ... history Nbest F start!complete connection!paths shift!reduce Figure 5: Performance of parse-based methods for subtask tree building Figure 5 shows the performance of the different methods...

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

9 467 0
Báo cáo khoa học: "SVD and Clustering for Unsupervised POS Tagging" docx

Báo cáo khoa học: "SVD and Clustering for Unsupervised POS Tagging" docx

... Combining distributional and morphological information for part of speech in- duction. In 10th Conference of the European Chap- ter of the Association for Computational Linguis- tics, pages 59–66. ... map-free information- theoretic criterion—see Gao and Johnson (2008) for details. Although we find M-to-1 to be the most reliable criterion of the three, we include the other two criter...

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

5 269 0
Báo cáo khoa học: "Stochastic Iterative Alignment for Machine Translation Evaluation" doc

Báo cáo khoa học: "Stochastic Iterative Alignment for Machine Translation Evaluation" doc

... N for i = 1; i ≤ M; i = i +1 do for j = 1; j ≤ N; j = j +1 do for k = 1; k ≤ i; k = k +1 do for m = 1; m ≤ j; m = m +1 do score i,j,k,m = max{score i−1,j,k,m ,score i,j−1,k,m } ; end for end for score i,j,i,j = max n=1,M;p=1,N {score i,j,i,j , ... |ref|; for i = 1; i ≤ M; i = i +1 do for j = 1; j ≤ N; j = j +1 do for k = 1; k ≤ i; k = k +1 do for m = 1; m ≤ j; m = m +1 do...

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

8 265 0
Báo cáo khoa học: "A Debug Tool for Practical Grammar Development" doc

Báo cáo khoa học: "A Debug Tool for Practical Grammar Development" doc

... example. 1 Introduction There is an increasing need for syntactical parsers for practical usages, such as information extrac- tion. For example, Yakushiji et al. (2001) extracted argument structures from ... to produce only results consistent with the information. An example is shown in Figure 1 (<su> is a senten- tial tag and <np> is a tag for noun phrases). I saw a girl...

Ngày tải lên: 08/03/2014, 04:22

4 361 0
Báo cáo khoa học: "Randomised Language Modelling for Statistical Machine Translation" doc

Báo cáo khoa học: "Randomised Language Modelling for Statistical Machine Translation" doc

... hash of event {x, j} under h i BF[h i (x)] ← 1 end for end for end for return BF 3.1 Log-frequency Bloom filter The efficiency of our scheme for storing n-gram statistics within a BF relies on ... bound on qc(x) ∈ S train for j = 1 to M AXQCOUNT do for i = 1 to k do h i (x) ← hash of event {x, j} under h i if BF[h i (x)] = 0 then return j − 1 end if end for end for The probabili...

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

8 268 0
Báo cáo khoa học: "THE TEXT SYSTEM FOR NATURAL LANGUAGE GENERATION" doc

Báo cáo khoa học: "THE TEXT SYSTEM FOR NATURAL LANGUAGE GENERATION" doc

... used for TEXT i. 2. 3. 4. identification -requests for definitions attributive -requests for available information constituency -requests for definitions -requests for available information ... detailed attributive information is included. For entities that are very different, only generic class information is included. A combination of this information is included...

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

8 273 0
Báo cáo khoa học: "Improving Pronoun Translation for Statistical Machine Translation" docx

Báo cáo khoa học: "Improving Pronoun Translation for Statistical Machine Translation" docx

... appro- priately dropped, compared with 17 for the An- notated system. Of those pronouns, the meaning could still be understood for 7/12 for the Baseline system compared with 8/14 for the Annotated sys- tem. ... the overall quality of pronoun translation for both sys- tems. These results for the “Development” and “Final” test sets (see Table 3) suggest that the per- formance of the...

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

10 347 0
Báo cáo khoa học: "A Revised Design for an Understanding Machine" doc

Báo cáo khoa học: "A Revised Design for an Understanding Machine" doc

... has been proposed would appear to be really beyond the reach of a concerted effort. For information retrieval, and for social science, the implications of having a computer program able to reproduce ... all of it—becomes transformed into “meaningful” informa- tion before or as it reaches the person’s action direc- tion center. We may ask: What is the nature of the transformation i...

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

13 267 0
w