Symposium on Morphological Complexity

15 Abr

imagen

MorphologyFest: Symposium on Morphological Complexity
Date: 16-Jun-2014 – 20-Jun-2014
Location: Bloomington, IN, USAWeb Site: http://www.indiana.edu/~mrphfest/Linguistic Field(s): Morphology

 

 

Meeting Description:

As linguists are quite aware, language can exist without significant morphological structure. In fact, morphological structure typically contributes to the overall complexity of a language. This symposium will address issues of morphological complexity from four different perspectives: cognitive computation, lexical processing, diversity and evolution, and the theory of grammar.

Invited speakers will each provide a daily lecture over the course of four days (Monday-Thursday) in each of these areas. The fifth day (Friday) will be devoted to poster presentations in each of the four areas, followed by focus group discussion for each area.

 

Abstracts for poster presentations are invited in the following areas:

– Complexity and computation
– Complexity and lexical processing
– Complexity, diversity, and evolution
– Complexity, non-concatenative morphology
– The theory of grammar

Abstracts must be no more than one page in length (not including references), and must include title of presentation.

Abstracts should be submitted through EasyAbstracts (EasyAbs): http://linguistlist.org/easyabs/mrphfest14.

Submissions are limited to one individual and one joint abstract per person.

INFORMACIÓN APARECIDA EN LINGUIST LIST: http://linguistlist.org/issues/25/25-978.html

Responder

Introduce tus datos o haz clic en un icono para iniciar sesión:

Logo de WordPress.com

Estás comentando usando tu cuenta de WordPress.com. Cerrar sesión / Cambiar )

Imagen de Twitter

Estás comentando usando tu cuenta de Twitter. Cerrar sesión / Cambiar )

Foto de Facebook

Estás comentando usando tu cuenta de Facebook. Cerrar sesión / Cambiar )

Google+ photo

Estás comentando usando tu cuenta de Google+. Cerrar sesión / Cambiar )

Conectando a %s

A %d blogueros les gusta esto: