EDBT 2026 Demo / reviewers in the wild / expert
Josh Schroeder
dblp:99/4392
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 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
1 paper |
Machine translation · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Machine translation › statistical machine translation
phrase-based translation |
0.1 | 1 | 2005 | Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer Phrases · ACL 2005 |
Natural language and speech › Machine translation
statistical machine translation |
0.1 | 1 | 2005 | Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer Phrases · ACL 2005 |
Algorithms and data structures › sequence algorithms › string algorithms
string data structures |
0.1 | 1 | 2005 | Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer Phrases · ACL 2005 |
Algorithms and data structures › sequence algorithms › string algorithms › string indexing
suffix array |
0.1 | 1 | 2005 | Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer Phrases · ACL 2005 |
Methods — techniques the papers use, named apart from their topics
sampling · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Word Lattices for Multi-Source Translation
Josh Schroeder, Trevor Cohn, Philipp Koehn |
EACL | 1 |
| 2005 | Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer PhrasesabstractIn this paper we describe a novel data structure for phrase-based statistical machine translation which allows for the retrieval of arbitrarily long phrases while simultaneously using less memory than is required by current decoder implementations. We detail the computational complexity and average retrieval times for looking up phrase translations in our suffix array-based data structure. We show how sampling can be used to reduce the retrieval time by orders of magnitude with no loss in translation quality. Chris Callison-Burch, Colin J. Bannard, Josh Schroeder |
ACL | 3 |
| 2005 | A compact data structure for searchable translation memories
Chris Callison-Burch, Colin J. Bannard, Josh Schroeder |
EAMT | 3 |