Search Results for author:
Found 22 papers, 3 papers with code
NeMo Inverse Text Normalization: From Development To Production
Inverse text normalization (ITN) converts spoken-domain automatic speech recognition (ASR) output into written-domain text to improve the readability of the ASR output.
Automatic Speech Recognition
Automatic Speech Recognition (ASR)
+1
The SIGMORPHON 2022 Shared Task on Morpheme Segmentation
The SIGMORPHON 2022 shared task on morpheme segmentation challenged systems to decompose a word into a sequence of morphemes and covered most types of morphology: compounds, derivations, and inflections.
Ranked #8 on
Morpheme Segmentaiton
on UniMorph 4.0
We Need to Talk about Standard Splits
It is standard practice in speech {\&} language technology to rank systems according to their performance on a test set held out for evaluation.
Minimally Supervised Written-to-Spoken Text Normalization
In speech-applications such as text-to-speech (TTS) or automatic speech recognition (ASR), \emph{text normalization} refers to the task of converting from a \emph{written} representation into a representation of how the text is to be \emph{spoken}.
Automatic Speech Recognition
Automatic Speech Recognition (ASR)
+1
Minimally Supervised Number Normalization
We propose two models for verbalizing numbers, a key component in speech recognition and synthesis systems.
Target word prediction and paraphasia classification in spoken discourse
We present a system for automatically detecting and classifying phonologically anomalous productions in the speech of individuals with aphasia.
What Kind of Language Is Hard to Language-Model?
Trying to answer the question of what features difficult languages have in common, we try and fail to reproduce our earlier (Cotterell et al., 2018) observation about morphological complexity and instead reveal far simpler statistics of the data that seem to drive complexity in a much larger sample.
Weird Inflects but OK: Making Sense of Morphological Generation Errors
We conduct a manual error analysis of the CoNLL-SIGMORPHON Shared Task on Morphological Reinflection.
UniMorph 3.0: Universal Morphology
The project comprises two major thrusts: a language-independent feature schema for rich morphological annotation and a type-level resource of annotated data in diverse languages realizing that schema.
Massively Multilingual Pronunciation Modeling with WikiPron
We introduce WikiPron, an open-source command-line tool for extracting pronunciation data from Wiktionary, a collaborative multilingual online dictionary.
The SIGMORPHON 2020 Shared Task on Multilingual Grapheme-to-Phoneme Conversion
We describe the design and findings of the SIGMORPHON 2020 shared task on multilingual grapheme-to-phoneme conversion.
Neural Models of Text Normalization for Speech Applications
One problem that has been somewhat resistant to effective machine learning solutions is text normalization for speech applications such as text-to-speech synthesis (TTS).
Is the Best Better? Bayesian Statistical Model Comparison for Natural Language Processing
Recent work raises concerns about the use of standard splits to compare natural language processing models.
Detecting Objectifying Language in Online Professor Reviews
Student reviews often make reference to professors' physical appearances.
Structured abbreviation expansion in context
Ad hoc abbreviations are commonly found in informal communication channels that favor shorter messages.
Group-matching algorithms for subjects and items
We consider the problem of constructing matched groups such that the resulting groups are statistically similar with respect to their average values for multiple covariates.
Results of the Second SIGMORPHON Shared Task on Multilingual Grapheme-to-Phoneme Conversion
Grapheme-to-phoneme conversion is an important component in many speech technologies, but until recently there were no multilingual benchmarks for this task.
A* shortest string decoding for non-idempotent semirings
We describe an algorithm which finds the shortest string for a weighted non-deterministic automaton over such semirings using the backwards shortest distance of an equivalent deterministic automaton (DFA) as a heuristic for A* search performed over a companion idempotent semiring, which is proven to return the shortest string.
UniMorph 4.0: Universal Morphology
The project comprises two major thrusts: a language-independent feature schema for rich morphological annotation and a type-level resource of annotated data in diverse languages realizing that schema.
