Can I read Notes on Computational Phonology on EtoBox?

Notes on Computational Phonology by Stabler E. is a nonfiction available to read on EtoBox.

What is Notes on Computational Phonology about?

University of California, Los Angeles, 1999, -128 pp. These notes were prepared for a UCLA seminar on computational proposals in recent phonology. Very many corrections and contributions were made by the seminar participants, especially Adam Albright, Dan Albro, Marco Baroni, Leston Buell, Bruce Hayes, Gianluca Storto, Siri Tuttle. Thanks also to Ed Keenan for some corrections and suggestions. The notes are still rough (many typos are left, I’m sure). I hope to improve them! They are intended to be an accompaniment to the literature, not a replacement; they presuppose an acquaintance with the original sources that are discussed. One of the main traditions in computational phonology is based on finite state models of phonological constraints. This is perhaps surprising, since finite state models, at least at first blush, seem to be too strong and too weak. They seem too strong because phonological relations seem to be local for the most part, in a way that dependencies in finite state languages are not. (For example, it is easy to define a finite state language with strings that have either a single a or b followed by any number of c’s, followed by a repetition of the first symbol:

Who reads Notes on Computational Phonology?

Author

Stabler E.

Language

EN

Category

nonfiction

Subjects

Computer Science, Cybernetics, Stem