Unambiguous Triggers  

Oleh:

Fodor, Janet Dean

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Linguistic Inquiry (ada di JSTOR) vol. 29 no. 1 (1998), page 1-36.
Fulltext: 4179006.pdf (4.58MB)

Ketersediaan

Perpustakaan PKBB Nomor Panggil: 405/LII/29 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Triggers for parameter setting may be ambiguous. Strategies for dealing with ambiguity include guessing, parallel processing, and waiting for unmbiguous input. The Trigger Learning Algorithm of Gibson and Wexler (1994) is a guessing system. Gibson and Wexler show that under some reasonable assumptions it may never attain the target grammar. I propose instead a determine device that waits for unbiguous triggers to set parameters. This learner must be able to detect parametric ambiguity. This iws not possible on the classical conception of triggers as sentences that flip parameter switches. It is possible if a trigger (and the parameter value it triggers) is a piece of tree structure, perhaps a single feature, made avaible by Universal Grammar, and adopted into the learner's grammar if input sentences cannot be parsed without it.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali