menu
{ "item_title" : "Connectionist Approaches to Language Learning", "item_author" : [" David Touretzky "], "item_description" : "arise automatically as a result of the recursive structure of the task and the continuous nature of the SRN's state space. Elman also introduces a new graphical technique for study- ing network behavior based on principal components analysis. He shows that sentences with multiple levels of embedding produce state space trajectories with an intriguing self- similar structure. The development and shape of a recurrent network's state space is the subject of Pollack's paper, the most provocative in this collection. Pollack looks more closely at a connectionist network as a continuous dynamical system. He describes a new type of machine learning phenomenon: induction by phase transition. He then shows that under certain conditions, the state space created by these machines can have a fractal or chaotic structure, with a potentially infinite number of states. This is graphically illustrated using a higher-order recurrent network trained to recognize various regular languages over binary strings. Finally, Pollack suggests that it might be possible to exploit the fractal dynamics of these systems to achieve a generative capacity beyond that of finite-state machines.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/46/136/792/1461367921_b.jpg", "price_data" : { "retail_price" : "109.99", "online_price" : "109.99", "our_price" : "109.99", "club_price" : "109.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Connectionist Approaches to Language Learning|David Touretzky

Connectionist Approaches to Language Learning

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

arise automatically as a result of the recursive structure of the task and the continuous nature of the SRN's state space. Elman also introduces a new graphical technique for study- ing network behavior based on principal components analysis. He shows that sentences with multiple levels of embedding produce state space trajectories with an intriguing self- similar structure. The development and shape of a recurrent network's state space is the subject of Pollack's paper, the most provocative in this collection. Pollack looks more closely at a connectionist network as a continuous dynamical system. He describes a new type of machine learning phenomenon: induction by phase transition. He then shows that under certain conditions, the state space created by these machines can have a fractal or chaotic structure, with a potentially infinite number of states. This is graphically illustrated using a higher-order recurrent network trained to recognize various regular languages over binary strings. Finally, Pollack suggests that it might be possible to exploit the fractal dynamics of these systems to achieve a generative capacity beyond that of finite-state machines.

This item is Non-Returnable

Details

  • ISBN-13: 9781461367925
  • ISBN-10: 1461367921
  • Publisher: Springer
  • Publish Date: October 2012
  • Dimensions: 9.21 x 6.14 x 0.33 inches
  • Shipping Weight: 0.5 pounds
  • Page Count: 149

Related Categories

You May Also Like...

    1

BAM Customer Reviews