Báo cáo khoa học: "A Unification Method for Disjunctive Feature Descriptions" pot
... take advantage of fast unification algorithms for non -disjunctive directed graph structures. 2 Data Structures The most common unification methods for non -disjunctive feature structures use ... A Unification Method for Disjunctive Feature Descriptions Robert T. Kasper USC/Information Sciences Institute 4676 Admiralty Way, Suite ... Figure 3: Unification algori...
Ngày tải lên: 31/03/2014, 17:20
... incu- bated for 4 days with each of the peptides (10 lm), and cells were fixed and used for immunocytochemical analyses. Immunocytochemistry Neurons were fixed in 4% paraformaldehyde for 20 min at ... than required for thioflavin T (ThT)-based fibrillation assays (typical concentrations used are 3–10 lm), but is not sufficient for other biophysical studies. We therefore examined a number...
Ngày tải lên: 18/02/2014, 13:20
... and information-based methods, e.g. pointwise mutual information (Church & Hanks 1990). Several studies of the performance of lexical association metrics suggest significant room for improvement, ... Arbor, June 2005. c 2005 Association for Computational Linguistics A Nonparametric Method for Extraction of Candidate Phrasal Terms Paul Deane Center for Assessment, Design...
Ngày tải lên: 08/03/2014, 04:22
Báo cáo khoa học: "A Bayesian Method for Robust Estimation of Distributional Similarities" pot
... similarity measure. As for BC b and BC a , the results for the tuned and several other values for α are shown. Figure 1 shows the parameter tuning for BC b with MAP as the y-axis (results for BC a are ... As a smoothing method, it also outperformed a naive absolute discounting. Of course, we can- not say that the proposed method is better than any other sophisticated smoothing m...
Ngày tải lên: 30/03/2014, 21:20
Tài liệu Báo cáo khoa học: "A COMMON FRAMEWORK FOR ANALYSIS AND GENERATION" potx
... compo- nent describing their functional structure. For the rule for S, for instance, we add an ele- ment describing what the SUBJECT and PRED are for. We could say that the SUBJECT is the theme ... complete formal paraphrase of (1) must include at least as much information as we have given above. In particular, the logical structure of our para- phrases contains essential inform...
Ngày tải lên: 22/02/2014, 10:20
Báo cáo khoa học: "A STOCHASTIC PROCESS FOR WORD FREQUENCY DISTRIBUTIONS" pot
... (1975), have been put forward, all of which have Zipf's law as some special or limiting form. Unrelated to Zipf's law is the lognormal hypothesis, advanced for word fre- quency ... matrix 7 ) defines a uniform distribu- tion (all pi# equal), we immediately have that the expected neighborhood density for length rnl is identical for all targets Yt, while for length m~...
Ngày tải lên: 08/03/2014, 07:20
Báo cáo khoa học: "A Connectionist Architecture for Learning to Parse" potx
... computed. However the link weights that perform this computation are the same for all the positions in the sequence. Therefore the infor- mation that was learned for an input and context in one sequence ... pattern for the gestalt inputs is straightforward, since these inputs per- tain to information about the sentence as a whole. Whenever a tag is input to the network, the activ...
Ngày tải lên: 23/03/2014, 19:20
Tài liệu Báo cáo khoa học: "A CONNECTIONIST PARSER FOR STRUCTURE UNIFICATION GRAMMAR" docx
... a word for the value of its head feature. The unification of the two NP's feature structures will cause the equation of the two head terminals. In this way the struc- ture for "ate" ... grouping of information, thus expressing the information in- terdependencies. The language which SUG pro- vides for specifying these descriptions allows par- tiality both i...
Ngày tải lên: 20/02/2014, 21:20
Tài liệu Báo cáo khoa học: "A UNIFICATION-BASED PARSER FOR RELATIONAL GRAMMAR" doc
... system is S-graph unification (S -unification) : This is essentially ordinary feature- structure unification augmented with an operation of label unification to build the stratified features characteristic ... Kasper-Rounds (KR) style logic-based formalism [5] for RG, called Stratified Feature Grammar (S FG), has demonstrated that even RG's multiple strata are amenable...
Ngày tải lên: 20/02/2014, 21:20
Tài liệu Báo cáo khoa học: "A rich environment for experimentation unification grammars" potx
... resemblances to all the well-known unification grammar formalisms, it offers a wider range of features than any single alternative, plus powerful facilities for nota- tional abstraction which ... into discussion of the under- lying complexity, for which we unfortunately do not have space here, we give an exter- nal form of a lexical entry for some of the senses of the Germ...
Ngày tải lên: 22/02/2014, 10:20