Tongfei Chen

Tongfei Chen

Auto-generated profile, based on publicly available information

Tongfei Chen

Johns Hopkins University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2019 in arXiv
Verified
Preprint
Open access
PDF file
PRPushpendre Rastogi
Pushpendre Rastogi
AGArpit Gupta
Arpit Gupta
TCTongfei Chen
Tongfei Chen
LMLambert Mathias
Lambert Mathias
We present a novel approach to dialogue state tracking and referring expression resolution tasks. Successful contextual understanding of multi-turn spoken dialogues requires resolving referring expressions across turns and tracking the entities relevant to the conversation across turns. Tracking conversational state is particularly challenging in a multi-domain scenario when there exist multiple spoken language understanding (SLU) sub-systems, and each SLU sub-system operates on its domain-specific meaning representation. While previous approaches have addressed the disparate schema issue by learning candidate transformations of the meaning representation, in this paper, we instead model the reference resolution as a dialogue context-aware user query reformulation task -- the dialog state is serialized to a sequence of natural language tokens representing the conversation. We develop our model for query reformulation using a pointer-generator network and a novel multi-task learning setup. In our experiments, we show a significant improvement in absolute F1 on an internal as well as a, soon to be released, public benchmark respectively.

23 October 2020 in arXiv
Verified
Preprint
Open access
PDF file
YCYunmo Chen
Yunmo Chen
TCTongfei Chen
Tongfei Chen
SESeth Ebner
Seth Ebner
AWAaron Steven White
Aaron Steven White
BDBenjamin Van Durme
Benjamin Van Durme
We ask whether text understanding has progressed to where we may extract event information through incremental refinement of bleached statements derived from annotation manuals. Such a capability would allow for the trivial construction and extension of an extraction framework by intended end-users through declarations such as, "Some person was born in some location at some time." We introduce an example of a model that employs such statements, with experiments illustrating we can extract events under closed ontologies and generalize to unseen event types simply by reading new definitions.

27 January 2015 in arXiv
Verified
Preprint
Open access
PDF file
JZJunhao Zhang
Junhao Zhang
TCTongfei Chen
Tongfei Chen
JHJunfeng Hu
Junfeng Hu
The problem of community detection receives great attention in recent years. Many methods have been proposed to discover communities in networks. In this paper, we propose a Gaussian stochastic blockmodel that uses Gaussian distributions to fit weight of edges in networks for non-overlapping community detection. The maximum likelihood estimation of this model has the same objective function as general label propagation with node preference. The node preference of a specific vertex turns out to be a value proportional to the intra-community eigenvector centrality (the corresponding entry in principal eigenvector of the adjacency matrix of the subgraph inside that vertex's community) under maximum likelihood estimation. Additionally, the maximum likelihood estimation of a constrained version of our model is highly related to another extension of label propagation algorithm, namely, the label propagation algorithm under constraint. Experiments show that the proposed Gaussian stochastic blockmodel performs well on various benchmark networks.

5 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
TCTongfei Chen
Tongfei Chen
ZJZhengping Jiang
Zhengping Jiang
APAdam Poliak
Adam Poliak
KSKeisuke Sakaguchi
Keisuke Sakaguchi
BDBenjamin Van Durme
Benjamin Van Durme
We introduce Uncertain Natural Language Inference (UNLI), a refinement of Natural Language Inference (NLI) that shifts away from categorical labels, targeting instead the direct prediction of subjective probability assessments. We demonstrate the feasibility of collecting annotations for UNLI by relabeling a portion of the SNLI dataset under a probabilistic scale, where items even with the same categorical label differ in how likely people judge them to be true given a premise. We describe a direct scalar regression modeling approach, and find that existing categorically labeled NLI data can be used in pre-training. Our best models approach human performance, demonstrating models may be capable of more subtle inferences than the categorical bin assignment employed in current NLI tasks.

15 October 2019 in arXiv
Verified
Preprint
Open access
PDF file
YWYiming Wang
Yiming Wang
TCTongfei Chen
Tongfei Chen
HXHainan Xu
Hainan Xu
SDShuoyang Ding
Shuoyang Ding
HLHang Lv
Hang Lv
SKSanjeev Khudanpur
Sanjeev Khudanpur
We present Espresso, an open-source, modular, extensible end-to-end neural automatic speech recognition (ASR) toolkit based on the deep learning library PyTorch and the popular neural machine translation toolkit fairseq. Espresso supports distributed training across GPUs and computing nodes, and features various decoding approaches commonly employed in ASR, including look-ahead word-based language model fusion, for which a fast, parallelized decoder is implemented. Espresso achieves state-of-the-art ASR performance on the WSJ, LibriSpeech, and Switchboard data sets among other end-to-end systems without data augmentation, and is 4--11x faster for decoding than similar systems (e.g. ESPnet).