Non-Adjacent Transitional Probabilities and the Induction of Grammatical Regularities
@inproceedings{Garzn2005NonAdjacentTP, title={Non-Adjacent Transitional Probabilities and the Induction of Grammatical Regularities}, author={Francisco Calvo Garz{\'o}n}, year={2005} }
Non-adjacent Transitional Probabilities and the Induction of Grammatical Regularities Francisco Calvo Garzon (fjcalvo@um.es) Departamento de Filosofia, Campus de Espinardo Murcia, 30100 SPAIN familiarization. The results reported show that subjects favour words over part-words (P < 0.0005; see Pena et al., 2002, for details). This behaviour backs up the hypothesis that statistics alone suffice to segment a linguistic stream, since what counts as a word is defined as a function of the higher… CONTINUE READING
2 Citations
References
SHOWING 1-6 OF 6 REFERENCES
Context-free and context-sensitive dynamics in recurrent neural networks
- Computer Science
- Connect. Sci.
- 2000
- 72
- PDF
Incremental training of first order recurrent neural networks to predict a context-sensitive language
- Computer Science, Medicine
- Neural Networks
- 2003
- 35
- PDF
Statistical Learning by 8-Month-Old Infants
- Medicine, Computer Science
- Science
- 1996
- 2,833
- Highly Influential
- PDF
Incremental training
- 2003