Our initial idea was to define i-complexity as bits per form, H(M ) / |s|, where |s| is the enumerative complexity-the number of distinct forms in the paradigm.
h(M ) reflects not only the language's morphological complexity, but also its 8 Where the weight of the tree is taken to include the weight of the special edge empty → σ to the root node σ.