Demo Data from VLDB 2026 / reviewers in the wild / expert
Juri Ganitkevitch
dblp:33/1016
· DBLP profile ↗
8ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 4 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.
| Artificial intelligence
3 papers |
Machine translation · 66% Deep learning architectures and training · 34% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Machine translation
parallel corpora |
0.1 | 1 | 2011 | Learning Sentential Paraphrases from Bilingual Parallel Corpora for Text-to-Text Generation · EMNLP 2011 |
Machine learning › Deep learning architectures and training › sequence modeling › sequence generation
sequence-to-sequence generation |
0.1 | 1 | 2011 | Learning Sentential Paraphrases from Bilingual Parallel Corpora for Text-to-Text Generation · EMNLP 2011 |
Natural language and speech › Machine translation
statistical machine translation |
0.1 | 2 | 2011 | Triplet Lexicon Models for Statistical Machine Translation · EMNLP 2008 Watermarking the Outputs of Structured Prediction with an application in Statistical Machine Translation · EMNLP 2011 |
Methods — techniques the papers use, named apart from their topics
watermarking · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | PARADIGM: Paraphrase Diagnostics through Grammar MatchingabstractParaphrase evaluation is typically done either manually or through indirect, taskbased evaluation.We introduce an intrinsic evaluation PARADIGM which measures the goodness of paraphrase collections that are represented using synchronous grammars.We formulate two measures that evaluate these paraphrase grammars using gold standard sentential paraphrases drawn from a monolingual parallel corpus.The first measure calculates how often a paraphrase grammar is able to synchronously parse the sentence pairs in the corpus.The second measure enumerates paraphrase rules from the monolingual parallel corpus and calculates the overlap between this reference paraphrase collection and the paraphrase resource being evaluated.We demonstrate the use of these evaluation metrics on paraphrase collections derived from three different data types: multiple translations of classic French novels, comparable sentence pairs drawn from different newspapers, and bilingual parallel corpora.We show that PARADIGM correlates with human judgments more strongly than BLEU on a task-based evaluation of paraphrase quality. Jonathan Weese, Juri Ganitkevitch, Chris Callison-Burch |
EACL | 2 |
| 2014 | The Multilingual Paraphrase Database
Juri Ganitkevitch, Chris Callison-Burch |
LREC | 1 |
| 2013 | Large-Scale Paraphrasing for Natural Language Understanding
Juri Ganitkevitch |
HLT-NAACL | 1 |
| 2013 | PPDB: The Paraphrase Database
Juri Ganitkevitch, Benjamin Van Durme, Chris Callison-Burch |
HLT-NAACL | 1 |
| 2013 | Learning to translate with products of novices: a suite of open-ended challenge problems for teaching MTabstractMachine translation (MT) draws from several different disciplines, making it a complex subject to teach. There are excellent pedagogical texts, but problems in MT and current algorithms for solving them are best learned by doing. As a centerpiece of our MT course, we devised a series of open-ended challenges for students in which the goal was to improve performance on carefully constrained instances of four key MT tasks: alignment, decoding, evaluation, and reranking. Students brought a diverse set of techniques to the problems, including some novel solutions which performed remarkably well. A surprising and exciting outcome was that student solutions or their combinations fared competitively on some tasks, demonstrating that even newcomers to the field can help improve the state-of-the-art on hard NLP problems while simultaneously learning a great deal. The problems, baseline code, and results are freely available. Adam Lopez, Matt Post, Chris Callison-Burch, Jonathan Weese, Juri Ganitkevitch, Narges Ahmidi, Olivia Buzek, Leah Hanson, Beaniesh Jamil, Matthias A. Lee, Ya-Ting Lin, Henry Pao, Fatima Rivera, Leili Shahriyari, Debu Sinha, Adam R. Teichert, Stephen Wampler, Michael Weinberger, Daguang Xu, Lin Yang 0002, Shang Zhao 0002 |
Trans. Assoc. Comput. Linguistics | 5 |
| 2011 | Learning Sentential Paraphrases from Bilingual Parallel Corpora for Text-to-Text Generation
Juri Ganitkevitch, Chris Callison-Burch, Courtney Napoles, Benjamin Van Durme |
EMNLP | 1 |
| 2011 | Watermarking the Outputs of Structured Prediction with an application in Statistical Machine Translation
Ashish Venugopal, Jakob Uszkoreit, David Talbot, Franz Josef Och, Juri Ganitkevitch |
EMNLP | 5 |
| 2008 | Triplet Lexicon Models for Statistical Machine Translation
Sasa Hasan, Juri Ganitkevitch, Hermann Ney, Jesús Andrés-Ferrer |
EMNLP | 2 |