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

Marion Zalk

dblp:34/10503 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1

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%
Artificial intelligence
1 paper
Speech recognition and synthesis · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › query processing
early termination
0.212013
Simulating Early-Termination Search for Verbose Spoken Queries · EMNLP 2013
Information retrieval › document retrieval
spoken document retrieval
0.212013
Simulating Early-Termination Search for Verbose Spoken Queries · EMNLP 2013

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

query difficulty prediction · 0.3automatic speech recognition · 0.3
YearPublicationVenuePosition
2013 Simulating Early-Termination Search for Verbose Spoken Queries
abstract
Building search engines that can respond to spoken queries with spoken content requires that the system not just be able to find useful responses, but also that it know when it has heard enough about what the user wants to be able to do so.This paper describes a simulation study with queries spoken by non-native speakers that suggests that indicates that finding relevant content is often possible within a half minute, and that combining features based on automatically recognized words with features designed for automated prediction of query difficulty can serve as a useful basis for predicting when that useful content has been found.
Jerome White, Douglas W. Oard, Nitendra Rajput, Marion Zalk
EMNLP4