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

Boris Chen

dblp:207/0283 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Artificial 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.

Artificial intelligence
1 paper
Machine translation · 50% Language models and text generation · 50%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation › monolingual data augmentation
back-translation
0.412020
Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020
Natural language and speech › Machine translation
low-resource machine translation
0.412020
Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020
Natural language and speech › Language models and text generation › text generation
paraphrase generation
0.412020
Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020
Natural language and speech › Language models and text generation › text generation › text simplification
sentence simplification
0.412020
Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020
Natural language and speech › Language models and text generation › text evaluation
human evaluation
0.112020
Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020
Natural language and speech › Machine translation
machine translation evaluation
0.112020
Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020

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

sequence-to-sequence paraphrase model · 0.4back-translation · 0.4
YearPublicationVenuePosition
2023 Match Cutting: Finding Cuts with Smooth Visual Transitions
abstract
A match cut is a transition between a pair of shots that uses similar framing, composition, or action to fluidly bring the viewer from one scene to the next. Match cuts are frequently used in film, television, and advertising. However, finding shots that work together is a highly manual and time-consuming process that can take days. We propose a modular and flexible system to efficiently find high-quality match cut candidates starting from millions of shot pairs. We annotate and release a dataset of approximately 20k labeled pairs that we use to evaluate our system, using both classification and metric learning approaches that leverage a variety of image, video, audio, and audio-visual feature extractors. In addition, we release code and embeddings for reproducing our experiments at github.com/netflix/matchcut.
Boris Chen, Amir Ziai, Rebecca S. Tucker
WACV1
2020 Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation
abstract
Black-box machine translation systems have proven incredibly useful for a variety of applications yet by design are hard to adapt, tune to a specific domain, or build on top of. In this work, we introduce a method to improve such systems via automatic pre-processing (APP) using sentence simplification. We first propose a method to automatically generate a large in-domain paraphrase corpus through back-translation with a black-box MT system, which is used to train a paraphrase model that “simplifies” the original sentence to be more conducive for translation. The model is used to preprocess source sentences of multiple low-resource language pairs. We show that this preprocessing leads to better translation performance as compared to non-preprocessed source sentences. We further perform side-by-side human evaluation to verify that translations of the simplified sentences are better than the original ones. Finally, we provide some guidance on recommended language pairs for generating the simplification model corpora by investigating the relationship between ease of translation of a language pair (as measured by BLEU) and quality of the resulting simplification model from back-translations of this language pair (as measured by SARI), and tie this into the downstream task of low-resource translation.
Sneha Mehta, Bahareh Azarnoush, Boris Chen, Avneesh Saluja, Vinith Misra, Ballav Bihani, Ritwik Kumar
AAAI3