2014 Volume 21 Issue 1 Pages 3-25
In general, arguments are located near the predicate. A previous study has exploited this characteristic to group candidates by positional relations between a predicate and its candidate arguments and then searched for the final candidate using a predetermined priority list of the groups. However, in such an analysis, candidates in different groups cannot be compared. Therefore, we propose a Japanese predicate argument structure analysis model that gathers the most likely candidates from all the groups and then selects the final candidate amongst them. We can account for candidates with less priority before making a final decision to perform global optimization. Experimental results show that our model outperforms deterministic models.