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

Fabienne Braune

dblp:06/9282 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 10 · 4 first-author · 1 since 2021

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
5 papers
Machine translation · 47% Information extraction and text analysis · 25% Learning paradigms · 17%
Theoretical computer science
2 papers
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
weakly supervised learning
0.512021
KnowMAN: Weakly Supervised Multinomial Adversarial Networks · EMNLP (1) 2021
Natural language and speech › Machine translation
statistical machine translation
0.422015
Rule Selection with Soft Syntactic Features for String-to-Tree Statistical Machine Translation · EMNLP 2015
Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation · ACL (1) 2013
Natural language and speech › Machine translation
bilingual lexicon induction
0.312018
Two Methods for Domain Adaptation of Bilingual Tasks: Delightfully Simple and Broadly Applicable · ACL (1) 2018
Natural language and speech › Information extraction and text analysis › multilingual NLP
cross-lingual classification
0.312018
Two Methods for Domain Adaptation of Bilingual Tasks: Delightfully Simple and Broadly Applicable · ACL (1) 2018
Natural language and speech › Information extraction and text analysis › sentiment analysis › sentiment classification
cross-lingual sentiment classification
0.312018
Two Methods for Domain Adaptation of Bilingual Tasks: Delightfully Simple and Broadly Applicable · ACL (1) 2018
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.312018
Two Methods for Domain Adaptation of Bilingual Tasks: Delightfully Simple and Broadly Applicable · ACL (1) 2018
Automata and formal languages
tree transducers
0.222015
Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation · ACL (1) 2013
String-to-Tree Multi Bottom-up Tree Transducers · ACL (1) 2015
Natural language and speech › Machine translation › syntax-based machine translation
string-to-tree translation
0.212015
Rule Selection with Soft Syntactic Features for String-to-Tree Statistical Machine Translation · EMNLP 2015
Natural language and speech › Machine translation
syntax-based machine translation
0.212015
String-to-Tree Multi Bottom-up Tree Transducers · ACL (1) 2015
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.112015
Rule Selection with Soft Syntactic Features for String-to-Tree Statistical Machine Translation · EMNLP 2015

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

transformer language model · 0.5multinomial adversarial networks · 0.5adversarial training · 0.5semi-supervised classification · 0.3multi-bottom-up tree transducer · 0.3bilingual word embeddings · 0.3soft syntactic features · 0.2discriminative rule selection · 0.2
YearPublicationVenuePosition
2021 KnowMAN: Weakly Supervised Multinomial Adversarial Networks
abstract
The absence of labeled data for training neural models is often addressed by leveraging knowledge about the specific task, resulting in heuristic but noisy labels.The knowledge is captured in labeling functions, which detect certain regularities or patterns in the training samples and annotate corresponding labels for training.This process of weakly supervised training may result in an over-reliance on the signals captured by the labeling functions and hinder models to exploit other signals or to generalize well.We propose KnowMAN, an adversarial scheme that enables to control influence of signals associated with specific labeling functions.KnowMAN forces the network to learn representations that are invariant to those signals and to pick up other signals that are more generally associated with an output label.KnowMAN strongly improves results compared to direct weakly supervised learning with a pre-trained transformer language model and a feature-based baseline.
Luisa März, Ehsaneddin Asgari, Fabienne Braune, Franziska Zimmermann, Benjamin Roth 0001
EMNLP (1)3
2020 UniSent: Universal Adaptable Sentiment Lexica for 1000+ Languages
abstract
In this paper, we introduce UniSent universal sentiment lexica for 1000+ languages. Sentiment lexica are vital for sentiment analysis in absence of document-level annotations, a very common scenario for low-resource languages. To the best of our knowledge, UniSent is the largest sentiment resource to date in terms of the number of covered languages, including many low resource ones. In this work, we use a massively parallel Bible corpus to project sentiment information from English to other languages for sentiment analysis on Twitter data. We introduce a method called DomDrift to mitigate the huge domain mismatch between Bible and Twitter by a confidence weighting scheme that uses domain-specific embeddings to compare the nearest neighbors for a candidate sentiment word in the source (Bible) and target (Twitter) domain. We evaluate the quality of UniSent in a subset of languages for which manually created ground truth was available, Macedonian, Czech, German, Spanish, and French. We show that the quality of UniSent is comparable to manually created sentiment resources when it is used as the sentiment seed for the task of word sentiment prediction on top of embedding representations. In addition, we show that emoticon sentiments could be reliably predicted in the Twitter domain using only UniSent and monolingual embeddings in German, Spanish, French, and Italian. With the publication of this paper, we release the UniSent sentiment lexica at http://language-lab.info/unisent.
Ehsaneddin Asgari, Fabienne Braune, Benjamin Roth 0001, Christoph Ringlstetter, Mohammad R. K. Mofrad
LREC2
2018 Two Methods for Domain Adaptation of Bilingual Tasks: Delightfully Simple and Broadly Applicable
abstract
Bilingual tasks, such as bilingual lexicon induction and cross-lingual classification, are crucial for overcoming data sparsity in the target language.Resources required for such tasks are often out-of-domain, thus domain adaptation is an important problem here.We make two contributions.First, we test a delightfully simple method for domain adaptation of bilingual word embeddings.We evaluate these embeddings on two bilingual tasks involving different domains: cross-lingual twitter sentiment classification and medical bilingual lexicon induction.Second, we tailor a broadly applicable semi-supervised classification method from computer vision to these tasks.We show that this method also helps in low-resource setups.Using both methods together we achieve large improvements over our baselines, by using only additional unlabeled data.
Viktor Hangya, Fabienne Braune, Alexander Fraser 0001, Hinrich Schütze
ACL (1)2
2015 String-to-Tree Multi Bottom-up Tree Transducers
abstract
Nina Seemann, Fabienne Braune, Andreas Maletti. Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2015.
Nina Seemann, Fabienne Braune, Andreas Maletti
ACL (1)2
2015 Rule Selection with Soft Syntactic Features for String-to-Tree Statistical Machine Translation
abstract
In syntax-based machine translation, rule selection is the task of choosing the correct target side of a translation rule among rules with the same source side.We define a discriminative rule selection model for systems that have syntactic annotation on the target language side (stringto-tree).This is a new and clean way to integrate soft source syntactic constraints into string-to-tree systems as features of the rule selection model.We release our implementation as part of Moses.
Fabienne Braune, Nina Seemann, Alexander Fraser 0001
EMNLP1
2015 A systematic evaluation of MBOT in statistical machine translation
Nina Seemann, Fabienne Braune, Andreas Maletti
MTSummit2
2014 Mapping Between English Strings and Reentrant Semantic Graphs
Fabienne Braune, Daniel Bauer 0002, Kevin Knight
LREC1
2013 Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation
Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti
ACL (1)1
2012 Composing extended top-down tree transducers
Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti
EACL2
2012 Long-distance reordering during search for hierarchical phrase-based SMT
Fabienne Braune, Anita Gojun, Alexander Fraser 0001
EAMT1