In this section we will describe an entropy based algorithm, which aims at learning the simplest grammar fitting the data.
we take a "supertagging" perspective (Bangalore and Joshi, 1999) and aim at reducing the uncertainty about which elementary tree (supertag) to assign to a given lexical item.