Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 18 November 2019

Abstract and Keywords

The purpose of modelling inflectional structure computationally is addressed. It is a good way of checking analyses, and it provides external evidence for their validity. The development of a computational analysis can lead to the discovery of new generalizations about a language’s morphology. Finite state morphology and default inheritance methods are discussed. One question is whether morphological entities such as inflectional classes should be treated in terms of morphological features or whether they should be seen as emerging from the structure of the hierarchy or network. Both inflectional classes and stem classes can be treated as inheritance hierarchies. The issue of the different types of feature involved is raised again when deponency and syncretism are considered. Because it raises these issues, computational modelling allows for subtle distinctions in the treatment of a particular typological phenomenon, as well as providing a better understanding of the basic connections between related phenomena.

Keywords: autonomous morphology, computational morphology, default inheritance, deponency, syncretism, DATR, finite state morphology

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.