skip to main content
10.1145/2611040.2611071acmotherconferencesArticle/Chapter ViewAbstractPublication PageswimsConference Proceedingsconference-collections
research-article

Web Searching with Multiple Correct Answers

Authors Info & Claims
Published:02 June 2014Publication History

ABSTRACT

Most web search engines today are geared towards providing a list of relevant websites, along with snippets of text from each website that are relevant to the user's search text. Some of them may also provide specific answers to the user's question. This paper explores techniques for combining many candidate answers into a small set of answers, when it is likely that there is more than one correct answer. We describe and test new algorithms that collect and consolidate candidate answers from many different websites using paired support, reinforcing the ranking factor of those candidate answers that co-occur as pairs across multiple website domains.

References

  1. X. Yin, W. Tan and C. Liu, "FACTO: A Fact Lookup Engine Based on Web Tables," in World Wide Web Conference (WWW), Hyderabad, India, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Wu and A. Marian, "Corroborating Answers from Multiple Web Sources," in The 10th International Workshop on Web and Databases, Beijing, China, 2007.Google ScholarGoogle Scholar
  3. J. G. Kooij, "Ambiguity in Natural Language: an Investigation of Certain Problems in its Linguistic Description," North Holland Linguistic Series, Amsterdam, 1971.Google ScholarGoogle Scholar
  4. R. Kass and T. Finin, "Modeling the User in Natural Language Systems," Computational Linguistics, vol. 14, no. 3, pp. 5--22, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. O'Hara and T. Bylander, "Numeric Query Answering on the Web," International Journal on Semantic Web and Information Systems, pp. 1--17, January-March 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. O'Hara and T. Bylander, "Predicting Website Correctness from Consensus Analysis," in Research in Applied Computation Symposium, San Antonio, TX, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Radev, W. Fan, H. Qi, H. We and A. Grewal, "Probabilistic question answering on the Web," Journal of the American Society for Information Science and Technology, vol. 566, pp. 571--583, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. D. Cohn, "State Population Estimates and Census 2010 Counts: Did They Match?" Pew Research, 12 January 2011. {Online}. Available: http://www.pewsocialtrends.org/2011/01/12/state-population-estimates-and-census-2010-countsdid-they-match/. {Accessed 28 August 2013}.Google ScholarGoogle Scholar
  9. M. Barcala, J. Vilares, M. A. Alonso, J. Grana and M. Vilares, "Tokenization and Proper Noun Recognition for Information Retrieval," Departamento de Computacion, Universidade da Coruna, La Coruna, Spain, 2002.Google ScholarGoogle Scholar
  10. V. I. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions and Reversals," Cybernetics and Control Theory, pp. 845--848, 1965.Google ScholarGoogle Scholar
  11. Slavlov-Daniel, "Top 500 Must-See Movies," 13 February 2011. {Online}. Available: http://www.imdb.com/list/nA5Lm3rUIxs/. {Accessed 12 May 2013}.Google ScholarGoogle Scholar
  12. "United States - 2013, CIA World Fact Book," 2013. {Online}. Available: http://www.theodora.com/wfbcurrent/united_states/index.html. {Accessed 28 August 2013}.Google ScholarGoogle Scholar

Index Terms

  1. Web Searching with Multiple Correct Answers

    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 ACM Other conferences
      WIMS '14: Proceedings of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS14)
      June 2014
      506 pages
      ISBN:9781450325387
      DOI:10.1145/2611040

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 2 June 2014

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

      Acceptance Rates

      WIMS '14 Paper Acceptance Rate41of90submissions,46%Overall Acceptance Rate140of278submissions,50%
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader