Information Access Through Web-Scale Question-Answer Pair Finding, Ranking and Matching

Grant number: FT120100658 | Funding period: 2012 - 2016

Completed

Abstract

This project will aim to take web search to a new level of sophistication in accepting queries in the form of complex natural language questions, and returning a ranked list of natural language answers automatically extracted from a broad range of web user forums.

Related publications (3)

Scholarly works icon

Learning Robust Representations of Text

Y Li, T Cohn, T Baldwin

2016-01-01

Deep neural networks have achieved remarkable results across many language processing tasks, however these methods are highly sens..

Scholarly works icon

Quit while ahead: Evaluating truncated rankings

F Liu, A Moffat, T Baldwin, X Zhang

2016-01-01

© 2016 ACM. Many types of search tasks are answered through the computation of a ranked list of suggested answers. We re-examine t..

Scholarly works icon

Word sense and semantic relations in noun compounds

SN Kim, T Baldwin

2013-07-01

In this article, we investigate word sense distributions in noun compounds (NCs). Our primary goal is to disambiguate the word sen..

University of Melbourne Researchers