Each a i can take any value in the reals.
the ranking function for a parse tree x implied by a parameter vectorā a is defined as Given a new test sentence s, with parses x j for j = 1, : : : , N, the output of the model is the highest-scoring tree under the ranking function arg max Fðx,ā aÞ Fðx,ā aÞ can be interpreted as a measure of how plausible a parse x is, with higher scores meaning that x is more plausible.