skip to main content
10.3115/1119312.1119313dlproceedingsArticle/Chapter ViewAbstractPublication PagesmultisumqaConference Proceedingsconference-collections
Article
Free Access

Question Answering via Bayesian inference on lexical relations

Published:11 July 2003Publication History

ABSTRACT

Many researchers have used lexical networks and ontologies to mitigate synonymy and polysemy problems in Question Answering (QA), systems coupled with taggers, query classifiers, and answer extractors in complex and ad-hoc ways. We seek to make QA systems reproducible with shared and modest human effort, carefully separating knowledge from algorithms. To this end, we propose an aesthetically "clean" Bayesian inference scheme for exploiting lexical relations for passage-scoring for QA. The factors which contribute to the efficacy of Bayesian Inferencing on lexical relations are soft word sense disambiguation, parameter smoothing which ameliorates the data sparsity problem and estimation of joint probability over words which overcomes the deficiency of naive-bayes-like approaches. Our system is superior to vector-space ranking techniques from IR, and its accuracy approaches that of the top contenders at the TREC QA tasks in recent years.

References

  1. Abe, Naoki, and Hang Li. 1996. Learning word association norms using tree cut pair models. In Proceedings of the 13th International Conference on Machine Learning.Google ScholarGoogle Scholar
  2. C. Buckley. 1985. Implementation of the smart information retrieval system. Technical report, Technical Report TR85-686, Department of Computer Science, Cornell University. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. L. A. Clarke, Gordon V. Cormack, and Thomas R. Lynam. 2001. Exploiting redundancy in question answering. In Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, pages 358--365. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Fellbaum, 1998. WordNet: An Electronic Lexical Database, chapter Using WordNet for Text Retrieval, pages 285--303. The MIT Press: Cambridge, MA.Google ScholarGoogle Scholar
  5. Christiane Fellbaum. 1998b. WordNet: An Electronic Lexical Database. The MIT Press.Google ScholarGoogle Scholar
  6. Sanda Harabagiu, Dan Moldovan, Marius Pasca, Rada Mihalcea, Mihai Surdeanu, Razvan Bunescu, Roxana Girju, Vasile Rus, and Paul Morarescu. 2000. Falcon: Boosting knowledge for answer engines. In Proceedings of the ninth text retrieval conference (TREC-9), November.Google ScholarGoogle Scholar
  7. David Heckerman. 1995. A Tutorial on Learning Bayesian Networks. Technical Report MSR-TR-95-06, March.Google ScholarGoogle Scholar
  8. Boris Katz. 1997. From sentence processing to information access on the world wide web. AAAI Spring Symposium on Natural Language Processing for the World Wide Web, Stanford University, Stanford CA.Google ScholarGoogle Scholar
  9. Cody C. T. Kwok, Oren Etzioni, and Daniel S. Weld. 2001. Scaling question answering to the web. In Proceedings of the Tenth International World Wide Web Conference, pages 150--161. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. David D. Lewis and Karen Sparck Jones. 1996. Natural language processing for information retrieval. Communications of the ACM, 39(1):92--101. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Pearl. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Adwait Ratnaparkhi. 1996. A maximum entropy part-of-speech tagger. In Proceedings of the Empirical Methods in Natural Language Processing Conference, May 17-18, 1996. University of Pennsylvania.Google ScholarGoogle Scholar
  13. Mark Sanderson. 1994. Word sense disambiguation and information retrieval. In Proceedings of SIGIR-94, 17th ACM International Conference on Research and Development in Information Retrieval, pages 49--57, Dublin, IE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Ellen Vorhees. 2000. Overview of TREC-9 question answering track. Text REtreival Conference 9.Google ScholarGoogle Scholar
  15. Wiebe, Janyce, O'Hara, Tom, Rebecca Bruce. 1998. Constructing Bayesian networks from WordNet for word sense disambiguation: representation and processing issues. In Proc. COLING-ACL '98 Workshop on the Usage of WordNet in Natural Language Processing Systems.Google ScholarGoogle Scholar
  16. P. Dempster, N. M. Laird and D. B. Rubin. 1977. Maximum Likelihood from Incomplete Data via The EM Algorithm. In Journal of Royal Statistical Society, Vol. 39, pp. 1--38, 1977.Google ScholarGoogle Scholar
  17. Ganesh Ramakrishnan and Pushpak Bhattacharyya. 2003. Text Representation with WordNet Synsets: A Soft Sense Disambiguation Approach. To appear in Proceedings of the 8th International Conference on Natural Language in Information Systems, Springer Verlag.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image DL Hosted proceedings
    MultiSumQA '03: Proceedings of the ACL 2003 workshop on Multilingual summarization and question answering - Volume 12
    July 2003
    97 pages

    Publisher

    Association for Computational Linguistics

    United States

    Publication History

    • Published: 11 July 2003

    Qualifiers

    • Article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader