In contrast-partly due to the lack of a strong type system-dependency structures are easy to annotate and have become a widely used form of syntactic analysis for many languages.
an important constraint on the lambda calculus system is as follows: all natural language con-stituents have a lambda-calculus expression of type Ind × Event → Bool.