Gia H. Ngo

Gia H. Ngo

Auto-generated profile, based on publicly available information

Gia H. Ngo

Cornell University

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
28 May 2021 in Science Advances
Verified
Journal Article
Open access
PDF file
MKMeenakshi Khosla
Meenakshi Khosla
GNGia H. Ngo
Gia H. Ngo
KJKeith Jamison
Keith Jamison
AKAmy Kuceyeski
Amy Kuceyeski
MSMert R. Sabuncu
Mert R. Sabuncu
Naturalistic stimuli induce a brain response shared across individuals that is largely predictable with deep learning.

22 November 2019 in IEEE/ACM Transactions on Audio, Speech, and Language Processing
Verified
Journal Article
Closed access
MNMinh Nguyen
Minh Nguyen
GNGia H. Ngo
Gia H. Ngo
NCNancy F. Chen
Nancy F. Chen
HNHoang Gia Ngo
Hoang Gia Ngo
Logographs (Chinese characters) have recursive structures (i.e. hierarchies of sub-units in logographs) that contain phonological and semantic information, as developmental psychology literature suggests that native speakers leverage on the structures to learn how to read. Exploiting these structures could potentially lead to better embeddings that can benefit many downstream tasks. We propose building hierarchical logograph (character) embeddings from logograph recursive structures using treeLSTM, a recursive neural network. Using recursive neural network imposes a prior on the mapping from logographs to embeddings since the network must read in the sub-units in logographs according to the order specified by the recursive structures. Based on human behavior in language learning and reading, we hypothesize that modeling logographs‚ structures using recursive neural network should be beneficial. To verify this claim, we consider two tasks (1) predicting logographs‚ Cantonese pronunciation from logographic structures and (2) language modeling. Empirical results show that the proposed hierarchical embeddings outperform baseline approaches. Diagnostic analysis suggests that hierarchical embeddings constructed using treeLSTM is less sensitive to distractors, thus is more robust, especially on complex logographs.

1 May 2014
Verified
Conference Paper
Closed access
NCNancy F. Chen
Nancy F. Chen
SSSunil Sivadas
Sunil Sivadas
BLBoon Pang Lim
Boon Pang Lim
HNHoang Gia Ngo
Hoang Gia Ngo
HXHaihua Xu
Haihua Xu
HLHaizhou Li
Haizhou Li
We propose strategies for a state-of-the-art Vietnamese keyword search (KWS) system developed at the Institute for Infocomm Research (I 2 R). The KWS system exploits acoustic features characterizing creaky voice quality peculiar to lexical tones in Vietnamese, a minimal-resource transliteration framework to alleviate out-of-vocabulary issues from foreign loan words, and a proposed system combination scheme FusionX. We show that the proposed creaky voice quality features complement pitch-related features, reaching fusion gains of 17.7% relative (6.9% absolute). To the best of our knowledge, the proposed transliteration framework is the first reported rule-based system for Vietnamese; it outperforms statistical-approach baselines up to 14.93-36.73% relative on foreign loan word search tasks. Using FusionX to combine 3 sub-systems, the actual term-weighted value (ATWV) reaches 0.4742, exceeding the ATWV=0.3 benchmark for IARPA Babel participants in the NIST OpenKWSB Evaluation.

25 May 2021 in IEEE/ACM Transactions on Audio, Speech, and Language Processing
Verified
Journal Article
Closed access
MNMinh Nguyen
Minh Nguyen
GNGia H. Ngo
Gia H. Ngo
NCNancy F. Chen
Nancy F. Chen
HNHoang Gia Ngo
Hoang Gia Ngo
Spell check is a useful application which processes noisy human-generated text. Spell check for Chinese poses unresolved problems due to the large number of characters, the sparse distribution of errors, and the dearth of resources with sufficient coverage of heterogeneous and shifting error domains. For Chinese spell check, filtering using confusion sets narrows the search space and makes finding corrections easier. However, most, if not all, confusion sets used to date are fixed and thus do not include new, shifting error domains. We propose a scalable adaptable filter that exploits hierarchical character embeddings to (1) obviate the need to handcraft confusion sets, and (2) resolve sparsity problems related to infrequent errors. Our approach compares favorably with competitive baselines and obtains SOTA results on the 2014 and 2015 Chinese Spelling Check Bake-off datasets.

19 July 2022 in Medical Image Analysis
Verified
Journal Article
Closed access
GNGia H. Ngo
Gia H. Ngo
MNMinh Nguyen
Minh Nguyen
NCNancy F. Chen
Nancy F. Chen
MSMert R. Sabuncu
Mert R. Sabuncu

21 September 2021
Verified
Book Chapter
Closed access
PDF file
GNGia H. Ngo
Gia H. Ngo
MNMinh Nguyen
Minh Nguyen
NCNancy F. Chen
Nancy F. Chen
MSMert R. Sabuncu
Mert R. Sabuncu