Approximation-Aware Dependency Parsing by Belief Propagation
Trans. Assoc. Comput. Linguistics, pp. 489-501, 2015.
We show how to train the fast dependency parser of Smith and Eisner (2008) for improved accuracy. This parser can consider higher-order interactions among edges while retaining O(n^3) runtime. It outputs the parse with maximum expected recall -- but for speed, this expectation is taken under a posterior distribution that is constructed ...More
PPT (Upload PPT)