Supervised Grapheme-to-Phoneme Conversion of Orthographic Schwas in Hindi and Punjabi (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods to predict schwa deletion in Hindi are based on prosodic or phonetic analysis. |
| Approach: | They propose to use Hindi grapheme-to-phoneme (G2P) conversion to predict whether a schwa represented in the orthography is pronounced or unpronounced (deleted). |
| Outcome: | The proposed model outperforms existing models on a newly-compiled pronunciation lexicon extracted from various online dictionaries. |
Similar Papers
Multimodal, Multilingual Grapheme-to-Phoneme Conversion for Low-Resource Languages (D19-61)
Copied to clipboard
| Challenge: | Grapheme-to-phoneme conversion (g2p) is a task of predicting the pronunciation of words from their orthographic representation. |
| Approach: | They propose to leverage audio data as an auxiliary modality in a multi-task training process to learn a more optimal grapheme representation. |
| Outcome: | The proposed model reduces phoneme error rate to 2.46% on in-domain test set compared to unimodal spelling- pronunciation model. |
Customizing Grapheme-to-Phoneme System for Non-Trivial Transcription Problems in Bangla Language (N19-1)
Copied to clipboard
Sudipta Saha Shubha, Nafis Sadeq, Shafayat Ahmed, Md. Nahidul Islam, Muhammad Abdullah Adnan, Md. Yasin Ali Khan, Mohammad Zuberul Islam
| Challenge: | Existing methods for Grapheme to phoneme conversion in Bangla language are mostly rule-based. |
| Approach: | They propose to use a lexicon to train a robust Grapheme to phoneme conversion system in Bangla language. |
| Outcome: | The proposed method outperforms other state-of-the-art approaches for G2P conversion in Bangla language. |
GE2PE: Persian End-to-End Grapheme-to-Phoneme Conversion (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing text-to-speech systems struggle to produce natural speech from grapheme sequences . Grapheme-to phoneme conversion (G2P) systems face limitations when dealing with Persian texts due to the complexity of Persian transcription. |
| Approach: | They propose to use phonetic information to enhance the input sequence for Persian translations. |
| Outcome: | The proposed model surpasses state-of-the-art models by 1.86% in word error rate and 3.42% in homograph disambiguation accuracy. |
Zero-shot Learning for Grapheme to Phoneme Conversion with Language Ensemble (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing work focuses on low-resource and endangered languages with limited training sets. |
| Approach: | They propose a hypothesis set for any unseen target language and combine it with a confusion network to propose 'the most likely hypothesis' they test the approach on over 600 unseened languages and demonstrate it significantly outperforms baselines. |
| Outcome: | The proposed model outperforms baselines on over 600 unseen languages. |
A Benchmark for Hindi Verb-Argument Structure Alternations (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Pretrained large language models (LLMs) can infer the frame-selectional properties of Hindi verbs. |
| Approach: | They propose a benchmark to test whether pretrained large language models can infer the frame-selectional properties of Hindi verbs. |
| Outcome: | The proposed model performs best when masked monolingual models fare poorly when compared to causal models. |
Grapheme-to-Phoneme Conversion for Thai using Neural Regression Models (2022.naacl-main)
Copied to clipboard
| Challenge: | Grapheme-to-phoneme conversion is a task of converting grapheme sequences into phoneme sequence. |
| Approach: | They propose a Thai grapheme-to-phoneme conversion method that uses neural networks to predict the similarity between a candidate and the correct pronunciation. |
| Outcome: | The proposed method can be applied to other languages than Thai . it is comparable to encoder-decoder models in accuracy and accuracy, it shows . |
Universal Dependency Parsing for Hindi-English Code-Switching (N18-1)
Copied to clipboard
| Challenge: | Code-switching data often need additional processes such as language identification, normalization and/or back-transliteration to be processed. |
| Approach: | They propose a neural stacking model that leverages part-of-speech tags and syntactic tree annotations in tweets to parse code-switching data. |
| Outcome: | The proposed model is 1.5% better than the augmented model and 3.8% better than one which uses first-best normalization and/or back-transliteration. |
COMI-LINGUA: Expert Annotated Large-Scale Dataset for Multitask NLP in Hindi-English Code-Mixing (2025.findings-emnlp)
Copied to clipboard
| Challenge: | COMI-LINGUA is the largest manually annotated Hindi-English code-mixed dataset . 125K+ high-quality instances across five core NLP tasks are annotating by three bilingual annotators . |
| Approach: | COMI-LINGUA is the largest manually annotated Hindi-English code-mixed dataset . 125K+ high-quality instances are annotating by three bilingual annotators . |
| Outcome: | The dataset covers five core NLP tasks, including Token-level Language Identification, Matrix Language Identification and Named Entity Recognition. |
hinglishNorm - A Corpus of Hindi-English Code Mixed Sentences for Text Normalization (2020.coling-industry)
Copied to clipboard
| Challenge: | hinglishNorm is a human annotated corpus of Hindi-English code-mixed sentences for text normalization task. |
| Approach: | They propose to annotate sentences in Hindi-English code-mixed sentences using a human annotated normalized form. |
| Outcome: | The proposed corpus contains 13494 segments annotated for text normalization. |
Towards Automated Semantic Role Labelling of Hindi-English Code-Mixed Tweets (D19-55)
Copied to clipboard
| Challenge: | a new system for semantic role labelling of Hindi-English code-mixed tweets is proposed . code-mixing is a largely observed phenomenon in colloquial usage and on social media . |
| Approach: | They propose a system for automating Semantic Role Labelling of Hindi-English code-mixed tweets. |
| Outcome: | The proposed system gives an overall accuracy of 84% for Argument Classification, a 10% increase over the existing rule-based model. |