In this paper, we use maximum entropy models normalized for each predicate to each case.
the identifier directly selects the best phrase that   where n, c, and v denote a noun phrase of an argument, the case, and the target predicate, respectively, N denotes a set of candidate arguments, d(n) is a function that returns 1 iff the phrase n becomes the argument, and M c denotes the model of the case c. In addition, f k (d(n j ) = 1, X j ) is a feature function, λ c k denotes a weight parameter of the feature function, and A denotes an article in which all sentences are parsed.