Learning Constraint Subhierarchies: The Bidirectional Gradual Learning Algorithm
Gerhard Jäger · Palgrave Macmillan UK eBooks · 2004
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. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.