Abstract

This paper describes a computational model for analyzing arguments in discourse. In particular, the model describes processes necessary for interpreting one uninterrupted argument from a speaker. The resulting output is a representation for the underlying claim and evidence relations between propositions of the argument. For our processing model we present: (i) a characterization of coherent orderings of propositions, used to limit search for interpretation of each new proposition (ii) a working definition of the evidence relation, used to recognize connections between propositions (iii) a theory of the function and use of clue words — special words and phrases indicating the structure of the argument — then used in the analysis to control search for interpretation and verification of evidence relations.