* * * * * * * * * * * * * * * * * * * * * * * *
LINGUIST List logo Eastern Michigan University Wayne State University *
* People & Organizations * Jobs * Calls & Conferences * Publications * Language Resources * Text & Computer Tools * Teaching & Learning * Mailing Lists * Search *
* *

LINGUIST List 24.252

Tue Jan 15 2013

Confs: Morphology, Computational Linguistics/France

Editor for this issue: Xiyan Wang <xiyanlinguistlist.org>

Date: 15-Jan-2013
From: Matthew Baerman <m.baermansurrey.ac.uk>
Subject: Computational Approaches to Morphological Complexity
E-mail this message to a friend

Computational Approaches to Morphological Complexity

Date: 22-Feb-2013 - 22-Feb-2013
Location: Paris, France
Contact: Matthew Baerman
Contact Email: < click here to access email >
Meeting URL: http://www.surrey.ac.uk/englishandlanguages/research/smg/researchprojects/morphologicalcomplexity/workshop_2013/

Linguistic Field(s): Computational Linguistics; Morphology

Meeting Description:

The Surrey Morphology Group will be holding a one-day workshop on computational approaches to morphological complexity, hosted by Paris-Sorbonne University, on Friday, February 22, 2013.

Theme of the Workshop:

Inflection often (or even typically) displays formal patterns which cannot be readily derived from the syntactic and semantic categories which it realizes. Phenomena such as inflectional classes, syncretism, defectiveness and deponency manifest what appear to be a purely morphological element in the composition of words and paradigms. Computational treatment of these questions has proved particularly insightful, yielding some of the most interesting contemporary research on morphology. This workshop is devoted to exploring some of the latest trends.

Invited Speakers:

Roger Evans (Brighton)
Olivier Bonami (Paris)

The workshop will be held at the Maison de la recherche of the Université Paris-Sorbonne (28, rue Serpente, 75006 Paris) on Friday, February 22, 2013. It is free and open to all. For planning purposes, if you would like to attend, we request that you send a message by email to morphological.complexity AT gmail.com by February 14th 2013.


Benoît Sagot (INRIA & Université Paris–Diderot)
Tutorial: ‘Comparing complexity measures’


Olivier Bonami (Université Paris‐Sorbonne, LLF, IUF)
‘Towards a robust assessment of implicative relations in inflectional systems’

Roger Evans (NLTG, Brighton)
‘Looking for the wood among the trees - what is the empirical evidence for inheritance?’

Lunch break

Berthold Crysmann (CNRS, LLF)
‘Eliminating rule blocks from realisational morphology’


Gregory Stump (Kentucky)
‘Contrasting modes of representation for inflection-class systems and their implications for computing morphological complexity’

Read more issues|LINGUIST home page|Top of issue

Page Updated: 15-Jan-2013

Supported in part by the National Science Foundation       About LINGUIST    |   Contact Us       ILIT Logo
While the LINGUIST List makes every effort to ensure the linguistic relevance of sites listed on its pages, it cannot vouch for their contents.