An Anytime Algorithm for Interpreting Arguments | SpringerLink
Skip to main content

An Anytime Algorithm for Interpreting Arguments

  • Conference paper
PRICAI 2004: Trends in Artificial Intelligence (PRICAI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3157))

Included in the following conference series:

  • 1626 Accesses

Abstract

The problem of interpreting Natural Language (NL) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dean, T., Boddy, M.S.: An analysis of time-dependent planning. In: AAAI 1988 – Proceedings of the 7th National Conference on Artificial Intelligence, pp. 49–54. St. Paul, Minnesota (1988)

    Google Scholar 

  2. Horvitz, E., Suermondt, H., Cooper, G.: Bounded conditioning: flexible inference for decision under scarce resources. In: UAI 1989 – Proceedings of the 1989 Workshop on Uncertainty in Artificial Intelligence, Windsor, Canada, pp. 182–193 (1989)

    Google Scholar 

  3. Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann Pub., San Mateo (1988)

    Google Scholar 

  4. Raskutti, B., Zukerman, I.: Generation and selection of likely interpretations during plan recognition. User Modeling and User Adapted Interaction 1, 323–353 (1991)

    Article  Google Scholar 

  5. Carberry, S., Lambert, L.: A process model for recognizing communicative acts and modeling negotiation subdialogues. Computational Linguistics 25, 1–53 (1999)

    Google Scholar 

  6. Zilberstein, S., Russell, S.: Approximate reasoning using anytime algorithms. In: Natarajan, S. (ed.) Imprecise and Approximate Computation, pp. 43–62. Kluwer Academic Pub., Dordrecht (1995)

    Chapter  Google Scholar 

  7. Haenni, R.: Anytime argumentative and abductive reasoning. Soft Computing Journal 8 (2003)

    Google Scholar 

  8. Jokinen, K., Wilcock, G.: Confidence-based adaptivity in response generation for a spoken dialogue system. In: Proceedings of the Second SIGdial Workshop on Discourse and Dialogue, Aalborg, Denmark (2001)

    Google Scholar 

  9. Fischer, J., Haas, J., Nöth, E., Niemann, H., Deinzer, F.: Empowering knowledge based speech understanding through statistics. In: ICSLP 1998 – Proceedings of International Conference on Spoken Language Processing, Sydney, Australia, vol. 5, pp. 2231–2235 (1998)

    Google Scholar 

  10. Salton, G., McGill, M.: An Introduction to Modern Information Retrieval. McGraw-Hill, New York (1983)

    Google Scholar 

  11. Zukerman, I., George, S., Wen, Y.: Lexical paraphrasing for document retrieval and node identification. In: IWP 2003 – Proceedings of the Second International Workshop on Paraphrasing: Paraphrase Acquisition and Applications, Sapporo, Japan, pp. 94–101 (2003)

    Google Scholar 

  12. Zukerman, I., George, S.: A probabilistic approach for argument interpretation. To appear in User Modeling and User-Adapted Interaction, Special Issue on Language-Based Interaction: User Modeling and Adaptation (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

George, S., Zukerman, I., Niemann, M. (2004). An Anytime Algorithm for Interpreting Arguments. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28633-2_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22817-2

  • Online ISBN: 978-3-540-28633-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics