Jon Rawski
Jon Rawski
Events
Projects
Contact
Light
Dark
Automatic
computational phonology
Phonological Complexity is Subregular: Evidence from Sign Language
I show the complexity of several signed processes is subregular across speech and sign using string representations.
Jon Rawski
PDF
Cite
Slides
«
Cite
×
