In this paper we present an algorithm for comma resolution, a task that we define to consist of (1) disambiguating comma type and (2) determining the relations entailed from the sentence given the commas' interpretation.
in (1) we assign each comma to one of five possible types, and in (2) we generate a set of natural language sentences that express the relations, if any, signified by each comma structure.