Báo cáo khoa học: "A Connectionist Architecture for Learning to Parse" potx

... adequate for learning the complexities of real natural language (e.g. (Fodor and Pylyshyn, 1988), (Hender- son, 1996)). Work on extending connectionist architectures for application to complex ... 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 acti...

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

... and from the need to have a unique re- sulting tree. This flexibility is crucial to allow the parser to compensate for the connectionist archi- tecture's limitations and to parse efficiently. ... structure. Once a node is forgotten it can no longer be equated with, so nodes which must be equated with in order for the total descrip- tion to be complete can not be for...

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

... describes an architecture for performing anaphora resolution in a flexible way. Systems which con- form to these guidelines are well- encapsulated and portable, and can be used to compare ... inter alia, to compare anaphora resolution tech- niques for a given application, to compare new techniques to published baselines, or to compare a particular technique's pe...

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

... allowing the user to ‘glue’ together references to multiple actors or directors in order to constrain the search. For example, they can say “movies with THIS actor and THIS direc- tor” and point ... and directors are presented as but- tons. Pointing at (i.e., clicking on) these buttons results in a search for all of the movies with that particular actor or director, allowing us...

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

... intended to be read as subscripts. Three other special symbols are used: + stands for the unifica- tion operator * stands for top, the underdefined element. # stands for bottom, the overdefined ... in addition to the normal feature structures i. Introduction. The development of ud arose out of the need to have avail- able a full set of prototyping and development to...

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

... information. 2 GENERATION Suppose we have the formula given above as a for- mal paraphrase of (1), and we want to generate an English sentence which corresponds to it. We might hope to ... used for characterising an item being referred to by an NP, which we ex- pect the application program to deal with. The responsibility for deciding whether to pronomi- nalise some...

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

... sense. As a result, before deciding attachment, it is first nec- essary to determine the correct sense for each word. 3 None of the preceding methods used classes for verbs. 4 For reasons of complexity, ... approach to prepositional phrase attachment disam- biguation for real world texts. Although the use of semantic classes in this task seems intuitively to be adequate,...

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

... anion- exchange chromatography in batch format, and finally any aggregates removed using SEC. The advantage of this protocol is that it relies on affordable tools and can be scaled up to any production ... 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 fo...

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

... alignment-based string similarity for transliteration mining. These methods model the conditional probability distribu- tion and require supervised/semi-supervised infor- mation for learning. We propose a ... Au- tomata (Noeman and Madkour, 2010) and Bayesian learning (Kahki et al., 2011) to learn transliteration pairs from labelled data. Our method is different from theirs as our ge...

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

... Figure 4. The update equations are analogous to those used for the Split/Join operator in Figure 3. In order for this operator to be effective we need to allow greater than binary branching nodes, ... sampler for derivations Markov chain Monte Carlo sampling allows us to perform inference for the model described in 4.1 without restricting the infinite space of possible translat...

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