Abstract
It is a common feature of many case marking languages that some, but not all objects are case marked.1 However, it is usually not entirely random which objects are marked and which aren’t. Rather, case marking only applies to a morphologically or semantically well-defined class of NPs. Take Hebrew as an example. In this language, definite objects carry an accusative morpheme while indefinite objects are unmarked.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Copyright information
© 2004 Palgrave Macmillan, a division of Macmillan Publishers Limited
About this chapter
Cite this chapter
Jäger, G. (2004). Learning Constraint Subhierarchies: The Bidirectional Gradual Learning Algorithm. In: Blutner, R., Zeevat, H. (eds) Optimality Theory and Pragmatics. Palgrave Studies in Pragmatics, Language and Cognition. Palgrave Macmillan, London. https://doi.org/10.1057/9780230501409_11
Download citation
DOI: https://doi.org/10.1057/9780230501409_11
Publisher Name: Palgrave Macmillan, London
Print ISBN: 978-1-349-50764-1
Online ISBN: 978-0-230-50140-9
eBook Packages: Palgrave Language & Linguistics CollectionEducation (R0)