An action of a group G is highly transitive if acts transitively on k-tuples distinct points for all k?1. Many examples groups with rich geometric or dynamical admit actions. We prove that admits such does not contain the subgroup finitary alternating permutations, and H confined G, then remains transitive, possibly after discarding finitely many points.

Our system treats coreference resolution as an integer linear programming (ILP) problem. Extending Denis and Baldridge (2007) and Finkel andManning (2008)’s work, we exploit loose transitivity constraints on coreference pairs. Instead of enforcing transitivity closure constraints, which brings O(n3) complexity, we employ a strategy to reduce the number of constraints without large performance d...