Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matthew W. Bilotti

dblp:79/1236 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
question answering
0.112007
Structured retrieval for question answering · SIGIR 2007
Information retrieval › document retrieval
structured document retrieval
0.112007
Structured retrieval for question answering · SIGIR 2007
Information retrieval › document retrieval › passage retrieval
sentence retrieval
0.012007
Structured retrieval for question answering · SIGIR 2007

Methods — techniques the papers use, named apart from their topics

structured retrieval · 0.1bag-of-words retrieval · 0.1
YearPublicationVenuePosition
2010 Rank learning for factoid question answering with linguistic and semantic constraints
abstract
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query-time checking of complex linguistic and semantic constraints over keywords. Constraints are composed of a mixture of keyword and named entity features, as well as features derived from semantic role labeling. The framework supports the checking of constraints of arbitrary length relating any number of keywords. We show that a trained ranking model using this rich feature set achieves greater than a 20% improvement in Mean Average Precision over baseline keyword retrieval models. We also show that constraints based on semantic role labeling features are particularly effective for passage retrieval; when they can be leveraged, an 40% improvement in MAP over the baseline can be realized.
Matthew W. Bilotti, Jonathan L. Elsas, Jaime G. Carbonell, Eric Nyberg
CIKM1
2007 Structured retrieval for question answering
abstract
Bag-of-words retrieval is popular among Question Answering (QA) system developers, but it does not support constraint checking and ranking on the linguistic and semantic information of interest to the QA system. We present anapproach to retrieval for QA, applying structured retrieval techniques to the types of text annotations that QA systems use. We demonstrate that the structured approach can retrieve more relevant results, more highly ranked, compared with bag-of-words, on a sentence retrieval task. We also characterize the extent to which structured retrieval effectiveness depends on the quality of the annotations.
Matthew W. Bilotti, Paul Ogilvie, Jamie Callan, Eric Nyberg
SIGIR1
2006 Evaluation for Scenario Question Answering Systems
Matthew W. Bilotti, Eric Nyberg
LREC1