A simple computational model for classifying small string sets

Yoshihiko Suhara, Akito Sakurai

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Recent research hypothesizes that the capacity for syntactic recursions forms the computational core of a uniquely human language faculty. Contrary to this hypothesis, Gentner et al. claimed that the capacity to classify sequences from recursive, center-embedded grammar is not uniquely human. We show in this paper that the patterns Gentner used are classified by a Bayesian classifier, a simple and fundamental classifier in machine learning, and consequently we claim that their argument is flawed.

Original languageEnglish
Pages (from-to)270-273
Number of pages4
JournalInternational Congress Series
Publication statusPublished - 2007 Jul 1


  • Bayesian classification
  • Cognitive language
  • Grammar learning

ASJC Scopus subject areas

  • Medicine(all)


Dive into the research topics of 'A simple computational model for classifying small string sets'. Together they form a unique fingerprint.

Cite this