Skip to main content
SpringerLink
Log in

Question Answering Using Unification-Based Grammar

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2001)

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

Abstract

The problem of Question Answering (QA) as used in TREC [13] can be formulated as follows:

Given a collection of natural-language (NL) documents find an answer to given NL query that is a short substring of one of the documents, and it is found in a relevant context.

We present a novel approach to the problem based on unification-based grammars for NL.

This work is supported by NSERC and OGS.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Askjeeves. WWW, 2000. http://askjeeves.com/.

  2. R. Burke, Hammond K., V. Kulyukin, S. Lytinen, Tomuro N., and S. Schoenberg. Question answering from frequently asked quest. files. AI Mag., 18(2):57–66, 1997.

    Google Scholar 

  3. B. Carpenter. The Logic of Typed Feature Structures, volume 32 of Cambridge Tracts in Theor. Comp. Sci. Cambridge Univ. Press, 1992.

    Google Scholar 

  4. G. Cormack, C. Clarke, C. Palmer, and D. Kisman. Fast automatic passage ranking (MultiText experiments for TREC-8). In Proc. of TREC-8, 1999.

    Google Scholar 

  5. V. Kešelj. Stefy. WWW. http://www.cs.uwaterloo.ca/~vkeselj/stefy.html.

  6. V. Kešelj. Stefy: Java parser for HPSGs, version 0.1. Technical Report CS-99-26, Dept. of Comp. Sci., Univ. of Waterloo, 2000.

    Google Scholar 

  7. A. Kim. Graded unification: A framework for interactive processing. In Proc. ACL-32, pages 313–315, 1994.

    Google Scholar 

  8. D. Mollá, J. Berri, and M. Hess. A real world implementation of answer extraction. In Proc. of 9th Int. Conf. and Workshop on Database and Expert Sys. NLIS’98.

    Google Scholar 

  9. D. Radev, J. Prager, and V. Samn. Ranking suspected answers to natural language questions using predictive annotation. In Procäf the 6th Conf. on ANLP, 2000.

    Google Scholar 

  10. I. Sag and T. Wasow. Syntactic Theory: A Formal Introduction. CSLI, 1999.

    Google Scholar 

  11. R. Schwitter, D. Mollá, R. Fournier, and M. Hess. Answer extraction: Towards better evaluations of NLP systems. In Wshp. on Reading Comprehension Tests as Eval. for Comp.-Based Lang. Underst. Sys., ANLP-NAACL, pages 20–27, 2000.

    Google Scholar 

  12. S. Shieber. An Introduction to Unification-Based Approaches to Grammar. Number 4 in CSLI Lecture Notes. CSLI, Stanford, CA, 1986.

    Google Scholar 

  13. E.M. Voorhees and D.M. Tice. The TREC-8 question answering track evaluation. In Proc. of TREC-8, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Vlado Kešelj

Authors
  1. Vlado Kešelj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Alberta, Edmonton, AB, Canada, T6G 2E8

    Eleni Stroulia

  2. School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada, K1N 6N5

    Stan Matwin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kešelj, V. (2001). Question Answering Using Unification-Based Grammar. In: Stroulia, E., Matwin, S. (eds) Advances in Artificial Intelligence. Canadian AI 2001. Lecture Notes in Computer Science(), vol 2056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45153-6_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45153-6_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42144-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation