R O A
 VIEW ROA 544 
GO

544-0902 
Learning constraint sub-hierarchies. The Bidirectional Gradual Learning Algorithm
Author 
Gerhard Jäger <jaeger@ling.uni-potsdam.de> [Details]
Length 
34 pp.
Files 
 PDF 5kb
Abstract 


The paper proposes a variant of Boersma's Gradual Learning Algorithm for Stochastic Optimality Theory. While in the original version the learner is always (or tries to become) a speaker, I assume that the learner is both speaker and hearer. This learning theory is applied to the OT system from Aissen (2000), which was developed to explain the typology of differential case marking. It can be shown that the constraint sub-hierarchies that Aissen assumes to be universal follow from the statistical patterns of language use that have been uncovered in several corpus studies, if one adopts the bidirectional learning approach. The paper finally reports some tentative considerations on the repercussions of this learning theory for typology and diachrony.
Keywords 
 learning, Stochastic OT, differential object marking, diachrony
Area 
 Learnability, Semantics, Computation
Type 
 Manuscript
 JUMP TO GO  
 Item Display:



R O A