@inbook{ Selman1,
  author    = {Bart Selman and Graeme Hirst and Geert Adriaens and Udo Hahn},
  title     = {Parallel natural language processing}, 
  abstract   = {<P> We show how parsing can be formulated as an energy minimization problem. We describe our model in terms of a connectionist network. In this network we use a parallel computation scheme similar to the one used in the Boltzmann machine and apply simulated annealing, a stochastic optimization method. We show that at low temperatures the time average of the visited states at thermal equilibrium represents the correct parse of the input sentence.</p> <P> Our treatment of parsing as an energy minimization problem enables us to formulate general rules for the setting of weights and thresholds in the network. We also consider an alternative to the commonly used energy function. Using this new function, one can choose a provably correct set of weights and thresholds for the network and still have an acceptable rate of convergence in the annealing process.</p> <P> The parsing scheme is built from a small set of <I>connectionist primitives</I> that represent the grammar rules. These primitives are linked together using pairs of computing units that behave like discrete switches. These units are used as binders between concepts represented in the network. They can be linked in such a way that individual rules can be selected from a collection of rules, and are very useful in the construction of connectionist schemes for any form of rule-based processing.</p>},
  pages   = {238--254} ,
  year   = {1994}
}

{"_id":{"_str":"534282740e946d920a001b01"},"__v":12,"authorIDs":["545761622abc8e9f3700033e","5457d8d22abc8e9f370007f7","5457f6082abc8e9f37000923"],"author_short":["Selman, B.","Hirst, G.","Adriaens, G.","Hahn, U."],"bibbaseid":"selman-hirst-adriaens-hahn-parallelnaturallanguageprocessing-1994","bibdata":{"bibtype":"inbook","type":"inbook","author":[{"firstnames":["Bart"],"propositions":[],"lastnames":["Selman"],"suffixes":[]},{"firstnames":["Graeme"],"propositions":[],"lastnames":["Hirst"],"suffixes":[]},{"firstnames":["Geert"],"propositions":[],"lastnames":["Adriaens"],"suffixes":[]},{"firstnames":["Udo"],"propositions":[],"lastnames":["Hahn"],"suffixes":[]}],"title":"Parallel natural language processing","abstract":"<P> We show how parsing can be formulated as an energy minimization problem. We describe our model in terms of a connectionist network. In this network we use a parallel computation scheme similar to the one used in the Boltzmann machine and apply simulated annealing, a stochastic optimization method. We show that at low temperatures the time average of the visited states at thermal equilibrium represents the correct parse of the input sentence.</p> <P> Our treatment of parsing as an energy minimization problem enables us to formulate general rules for the setting of weights and thresholds in the network. We also consider an alternative to the commonly used energy function. Using this new function, one can choose a provably correct set of weights and thresholds for the network and still have an acceptable rate of convergence in the annealing process.</p> <P> The parsing scheme is built from a small set of <I>connectionist primitives</I> that represent the grammar rules. These primitives are linked together using pairs of computing units that behave like discrete switches. These units are used as binders between concepts represented in the network. They can be linked in such a way that individual rules can be selected from a collection of rules, and are very useful in the construction of connectionist schemes for any form of rule-based processing.</p>","pages":"238--254","year":"1994","bibtex":"@inbook{ Selman1,\n author = {Bart Selman and Graeme Hirst and Geert Adriaens and Udo Hahn},\n title = {Parallel natural language processing}, \n abstract = {<P> We show how parsing can be formulated as an energy minimization problem. We describe our model in terms of a connectionist network. In this network we use a parallel computation scheme similar to the one used in the Boltzmann machine and apply simulated annealing, a stochastic optimization method. We show that at low temperatures the time average of the visited states at thermal equilibrium represents the correct parse of the input sentence.</p> <P> Our treatment of parsing as an energy minimization problem enables us to formulate general rules for the setting of weights and thresholds in the network. We also consider an alternative to the commonly used energy function. Using this new function, one can choose a provably correct set of weights and thresholds for the network and still have an acceptable rate of convergence in the annealing process.</p> <P> The parsing scheme is built from a small set of <I>connectionist primitives</I> that represent the grammar rules. These primitives are linked together using pairs of computing units that behave like discrete switches. These units are used as binders between concepts represented in the network. They can be linked in such a way that individual rules can be selected from a collection of rules, and are very useful in the construction of connectionist schemes for any form of rule-based processing.</p>},\n pages = {238--254} ,\n year = {1994}\n}\n\n\n","author_short":["Selman, B.","Hirst, G.","Adriaens, G.","Hahn, U."],"key":"Selman1","id":"Selman1","bibbaseid":"selman-hirst-adriaens-hahn-parallelnaturallanguageprocessing-1994","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"inbook","biburl":"http://data.bibbase.org/provenance/httpwwwcstorontoedufritztmpcomplingbib/?format=bibtex","downloads":0,"keywords":[],"search_terms":["parallel","natural","language","processing","selman","hirst","adriaens","hahn"],"title":"Parallel natural language processing","year":1994,"dataSources":["jHKwXrZF6NZqXnQQo"]}