Corpus ID: 15036471

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}
}
  • Francisco Calvo Garzón
  • Published 2005
  • Mathematics
  • 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
    Learning Nonadjacent Dependencies with a Recurrent Neural Network
    • 2
    • PDF

    References

    SHOWING 1-6 OF 6 REFERENCES
    Context-free and context-sensitive dynamics in recurrent neural networks
    • 72
    • PDF
    Finding Structure in Time
    • 8,913
    • PDF
    Incremental training of first order recurrent neural networks to predict a context-sensitive language
    • 35
    • PDF
    Signal-Driven Computations in Speech Processing
    • 388
    • PDF
    Statistical Learning by 8-Month-Old Infants
    • 2,833
    • Highly Influential
    • PDF
    Incremental training
    • 2003