Yang returns to the problem of referential ambiguity, addressed in the opening paper by Gleitman and Trueswell. Using a computational approach, he argues that “big data” approaches to resolving referential ambiguity are destined to fail, because of the inevitable computational explosion needed to keep track of contextual associations present when a word is uttered. Yang tests several computational models, two of which depend on one‐trial learning, as described in Gleitman and Trueswell’s paper. He concludes that such models outperform cross‐situational learning (...) models, thereby formalizing, reinforcing, and advancing the conclusions offered by Gleitman and Trueswell. (shrink)

Gleitman and Trueswell’s “The easy words” forms a pair with their earlier paper, “Hard words,” completing a circle in which the authors ask how “easy” words (e.g., concrete nouns) are learned. They take up the hypothesis of “cross‐situational learning,” and argue that accumulating observations actually hinders learning if the mechanism requires holding all exemplars in memory over time. They present an alternative hypothesis, “Propose but Verify,” wherein people use one‐trial learning to confirm or disconfirm their current hypothesis—a mechanism distinctly different (...) from cross‐situational learning. (shrink)