The problem of interpreting Natural Language (ML) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time, an exhaustive search is not a practical option. In this paper, we present an anytime algorithm that generates "good enough" interpretations of probabilistic NL arguments in the context of a Bayesian network (BN). These interpretations consist of: BN nodes that match the sentences in a given argument, assumptions that justify the beliefs in the argument, and a reasoning structure that adds detail to the argument. We evaluated our algorithm using automatically generated arguments and hand-generated arguments. In both cases, our algorithm generated good interpretations (and often the best interpretation) in real time. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
George, S., Zukerman, I., & Niemann, M. (2004). An anytime algorithm for interpreting arguments. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 311–321). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_34
Mendeley helps you to discover research relevant for your work.