For each such lexical entry i , we can map its free variables v to objects in e i in an exponential number of ways.
for each i we only consider the logical form ( i , ξ i ) where the mapping ξ i obtains the highest score under the current model: ξ i = arg max ξ φ(c i , z i−1 , ( i , ξ ), e i ) • θ.