Báo cáo khoa học:Nonexistence results for Hadamard-like matrices pot

Tài liệu Báo cáo khoa học: "Tabular Algorithms for TAG Parsing" potx

Tài liệu Báo cáo khoa học: "Tabular Algorithms for TAG Parsing" potx

... parsing system for a grammar G and string al a,~ is a triple (2:, 7-/, D), with :2 a set of items which represent intermediate parse results, 7-/ an initial set of items called hypothesis that ... (Shieber et al., 1995), where items are called formula schemata, deduc- tion steps are inference rules, hypothesis are ax- ioms and final items are goal formulas. A parsing schema can be g...

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

8 292 0
Báo cáo khoa học: "Unsupervised Analysis for Decipherment Problems" pot

Báo cáo khoa học: "Unsupervised Analysis for Decipherment Problems" pot

... with downloadable fonts for viewing. However, they are difficult to handle by computer, for example, to build a full-coverage Hindi web-search engine, or to pool Hindi corpora for training machine ... 499–506, Sydney, July 2006. c 2006 Association for Computational Linguistics Unsupervised Analysis for Decipherment Problems Kevin Knight, Anish Nair, Nishit Rathod Information Science...

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

8 432 0
Báo cáo khoa học: "Unsupervised Methods for Head Assignments" potx

Báo cáo khoa học: "Unsupervised Methods for Head Assignments" potx

... de- pendencies for the PARC and Tiger dependency banks, we find that the FAMILIARITY algorithm when run with POStags and Spine conversion ob- tains around 74% recall for English and 69% for German. ... different scores of the RANDOM as- signment for the two languages can be explained 5 This procedure is not reported here for reasons of space, but it is available for other researche...

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

9 262 0
Báo cáo khoa học: "Morphological Cues for Lexical Semantics" pot

Báo cáo khoa học: "Morphological Cues for Lexical Semantics" pot

... semantic informa- tion. Word sense disambiguation for the bases and derived forms that could not be resolved using part- of-speech tags was not performed. However, there exist systems for such ... the morphological analyzer. For example, -Nize could not be stripped from hypoth- esize because Alvey failed to reconstruct hypothesis from hypothes. However, for the affixes d...

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

7 371 0
Báo cáo khoa học: "Discriminative Reranking for Semantic Parsing" pot

Báo cáo khoa học: "Discriminative Reranking for Semantic Parsing" pot

... any of them are correct. Results are shown for increasing values of n. The trends for CLANG and GEOQUERY are different: small values of n show significant im- provements for CLANG, while a larger ... precision, which is important for semantic parsing, it also limits its recall. To generate plenty of candidate SAPTs for reranking, we extended the back-off levels for the parameters...

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

8 276 0
Báo cáo khoa học: "LR Parsers For Natural Languages" pot

Báo cáo khoa học: "LR Parsers For Natural Languages" pot

... tree. This fact is desirable for progralnming languages. For natural languages, however, it is sometimes necessary for a parser to produce more than one parse tree. For example, consider the ... rule-schema and meta-rules for natural language in systems such as GPSG [7]. Acknowledgements I would like to thank Takehiro Tokuda, Osamu Watanabe, Jaime Carbonell and Herb Simon fo...

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

4 299 0
Báo cáo khoa học: "A FOUNDATION FOR SEMANTIC INTERPRETATION " pot

Báo cáo khoa học: "A FOUNDATION FOR SEMANTIC INTERPRETATION " pot

... before inten- sional logic or other flavors of logical forms could sup- port the type of inference and problem solving that AI requires of its semantic representations; see Moore 1981 for ... compositionaiity by design. This fol- lows from the uniform typing; the correspondence bet- ween syntactic and semantic rules that maintains this uniformity; and there being a unique semantic ob...

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

10 390 0
Báo cáo khoa học: "Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization" doc

Báo cáo khoa học: "Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization" doc

... (Sipser, 2006): Problem 2. 3-SAT Input: A formula φ =  m i=1 (a i ∨ b i ∨ c i ) in con- junctive normal form, such that each clause has 3 1503 1. For any r, an appearance of both rules of the form V Y r → 0 and V Y r → ... the grammar we use for all of our results is not recursive. Therefore, we can encode this grammar as a hidden Markov model, strength- ening our result from PCFGs to...

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

10 413 0
Báo cáo khoa học: "Medical treatment for the terminally ill: the ‘risk of unacceptable badness’"

Báo cáo khoa học: "Medical treatment for the terminally ill: the ‘risk of unacceptable badness’"

... pain, suffering, and discomfort. The fundamental maxim for these patients should be comfort. Extraordinary life support for patients predicted to die does not equal comfort care. Competing interests The ... uncommon for physicians to ask loaded questions in their quest for end-of-life decisions. For example, ‘This is your grandmother’s 17th transfer from a skilled nursing facility i...

Ngày tải lên: 25/10/2012, 10:45

2 463 0
Tài liệu Báo cáo khoa học: A strategy for discovery of cancer glyco-biomarkers in serum using newly developed technologies for glycoproteomics ppt

Tài liệu Báo cáo khoa học: A strategy for discovery of cancer glyco-biomarkers in serum using newly developed technologies for glycoproteomics ppt

... known [8], but our results highlighted the potential issues of false-neg- ative results. In contrast to DNA microarray analysis, qPCR provides both sensitivity and accuracy for studying glycogenes. ... From the results of the qPCR measurements, we can further explore glycan alteration during malignant transformation. Lectin microarray – a powerful technology for selection of lectins...

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

11 854 0
w