Transcribing speech in properly formatted written language presents some challenges for automatic speech recognition systems. The difficulty arises from the conversion ambiguity between verbal and written language in both directions. Non-lexical vocabulary items such as numeric entities, dates, times, abbreviations and acronyms are particularly ambiguous. This paper describes a finite-state trans-ducer based approach that improves proper transcription of these entities. The approach involves training a language model in the written language domain, and integrating verbal expansions of vo-cabulary items as a finite-state model into the decoding graph con-struction. We build an inverted finite-state transducer to map written vocabulary items ...
We propose a general lexicalization model which accounts for how lexical units are selected and intr...
We show that an elaborate linguistic model of a natural lan-guage can be a valuable knowledge source...
This paper presents a finite-state transducer (FST) for tokenizing and normalizing natural texts tha...
This paper describes a new approach to language model adaptation for speech recognition based on the...
This paper presents a method for reducing the effort of transcribing user utterances to develop lang...
The MIT SUMMIT speech recognition system models pronunciation using a phonemic baseform dictionary a...
In speech recognition systems language model (LMs) are often constructed by training and combining m...
Introduction At the current state of the art, high-accuracy speech recognition with moderate to lar...
This paper addresses issues in part of speech disambiguation using finite-state transducers and pres...
Abstract. The problem of machine translation can be viewed as consisting of two subproblems (a) lexi...
Recognizing speech in noisy environments is a difficult task. One way to simplify the solution is to...
We introduce Named Entity (NE) Language Modelling, a stochastic finite state machine approach to ide...
State-of-the-art computer-assisted transla-tion engines are based on a statistical pre-diction engin...
An adequate approach to speech translation for small to medium sized tasks is the use of subsequenti...
It seems obvious that a successful model of natural language would incorporate a great deal of both ...
We propose a general lexicalization model which accounts for how lexical units are selected and intr...
We show that an elaborate linguistic model of a natural lan-guage can be a valuable knowledge source...
This paper presents a finite-state transducer (FST) for tokenizing and normalizing natural texts tha...
This paper describes a new approach to language model adaptation for speech recognition based on the...
This paper presents a method for reducing the effort of transcribing user utterances to develop lang...
The MIT SUMMIT speech recognition system models pronunciation using a phonemic baseform dictionary a...
In speech recognition systems language model (LMs) are often constructed by training and combining m...
Introduction At the current state of the art, high-accuracy speech recognition with moderate to lar...
This paper addresses issues in part of speech disambiguation using finite-state transducers and pres...
Abstract. The problem of machine translation can be viewed as consisting of two subproblems (a) lexi...
Recognizing speech in noisy environments is a difficult task. One way to simplify the solution is to...
We introduce Named Entity (NE) Language Modelling, a stochastic finite state machine approach to ide...
State-of-the-art computer-assisted transla-tion engines are based on a statistical pre-diction engin...
An adequate approach to speech translation for small to medium sized tasks is the use of subsequenti...
It seems obvious that a successful model of natural language would incorporate a great deal of both ...
We propose a general lexicalization model which accounts for how lexical units are selected and intr...
We show that an elaborate linguistic model of a natural lan-guage can be a valuable knowledge source...
This paper presents a finite-state transducer (FST) for tokenizing and normalizing natural texts tha...