Mechanisms for Sentence Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets (2015, background): “Some works used recurrent networks with hardwired symbolic structures (Gr¨unwald, 1996; Crocker, 1996; Fanty, 1994).”
Toward a connectionist model of recursion in human linguistic performance (1999, background): “One way of approaching the problem of dealing with recursion in connectionist models is to " hardwire " symbolic structures directly into the architecture of the network (e.g., Fanty, 1985; McClelland & Kawamoto, 1986; Miyata, Smolensky & Legendre, 1993; Small, Cottrell & Shastri, 1982).”
The Bayesian reader: explaining word recognition as an optimal Bayesian decision process. (2006, methodology): “For example, rational analysis has been used to explain errors in reasoning (McKenzie, 1994; Oaksford & Chater, 1994), syntactic parsing (Chater, Crocker, & Pickering, 1998; Crocker, 1999; Jurafsky, 1996), and memory (Anderson & Milson, 1989).”
Argument-Head Distance and Processing Complexity: Explaining both Locality and Antilocality Effects (2006, methodology): “Following the standard assumption in the literature (Johnson-Laird 1983, Crocker 1999), we also assume that parsing is driven by a combination of top-down (predictive) and bottom-up mechanisms.”