World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
60
Citations
22475
World Ranking
3174
National Ranking
1538

Research.com Recognitions

  • 1996 - IEEE Fellow For contributions to automatic speech recognition.

Overview

What is he best known for?

The fields of study he is best known for:

  • Artificial intelligence
  • Speech recognition
  • Algorithm

Lalit R. Bahl spends much of his time researching Speech recognition, Artificial intelligence, Markov model, Natural language processing and Word. The various areas that Lalit R. Bahl examines in his Speech recognition study include Natural language, Statistical model and Feature vector. His Maximum-entropy Markov model study in the realm of Markov model interacts with subjects such as Sequence and Pronunciation.

His Language model study, which is part of a larger body of work in Natural language processing, is frequently linked to Alphabet, Simple and Phone, bridging the gap between disciplines. His study explores the link between Word and topics such as Binary decision diagram that cross with problems in Node and Binary tree. As a part of the same scientific study, Lalit R. Bahl usually deals with the Speech processing, concentrating on Estimation theory and frequently concerns with Expectation–maximization algorithm and Hidden semi-Markov model.

His most cited work include:

  • Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) (4485 citations)
  • A Maximum Likelihood Approach to Continuous Speech Recognition (1381 citations)
  • Maximum mutual information estimation of hidden Markov model parameters for speech recognition (745 citations)

What are the main themes of his work throughout his whole career to date?

His scientific interests lie mostly in Speech recognition, Artificial intelligence, Word, Natural language processing and Markov model. His research brings together the fields of Natural language and Speech recognition. His work deals with themes such as Value, Set and Pattern recognition, which intersect with Artificial intelligence.

Lalit R. Bahl focuses mostly in the field of Word, narrowing it down to matters related to String and, in some cases, Speech input. His Natural language processing study combines topics from a wide range of disciplines, such as Tree and Speech synthesis. His Markov model research is multidisciplinary, incorporating elements of Substring and Component.

He most often published in these fields:

  • Speech recognition (72.61%)
  • Artificial intelligence (54.78%)
  • Word (33.12%)

What were the highlights of his more recent work (between 1994-1999)?

  • Speech recognition (72.61%)
  • Artificial intelligence (54.78%)
  • Pattern recognition (21.66%)

In recent papers he was focusing on the following fields of study:

His main research concerns Speech recognition, Artificial intelligence, Pattern recognition, Natural language processing and Speaker recognition. His Speech recognition study typically links adjacent topics like Word. His Decision tree study in the realm of Artificial intelligence connects with subjects such as Transcription.

His work in the fields of Pattern recognition, such as Feature vector and Mutual information, overlaps with other areas such as Gaussian process. The Natural language research he does as part of his general Natural language processing study is frequently linked to other disciplines of science, such as Specific model, therefore creating a link between diverse domains of science. His studies deal with areas such as Feature extraction and Training set as well as Speech processing.

Between 1994 and 1999, his most popular works were:

  • Performance of the IBM large vocabulary continuous speech recognition system on the ARPA Wall Street Journal task (233 citations)
  • Experiments using data augmentation for speaker adaptation (161 citations)
  • Speaker clustering and transformation for speaker adaptation in speech recognition systems (86 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Programming language
  • Algorithm

Lalit R. Bahl mainly focuses on Speech recognition, Artificial intelligence, Natural language processing, Speaker recognition and Speaker diarisation. Lalit R. Bahl is involved in the study of Speech recognition that focuses on Speech processing in particular. When carried out as part of a general Artificial intelligence research project, his work on Decision tree and Feature vector is frequently linked to work in Hierarchical database model, therefore connecting diverse disciplines of study.

In the subject of general Natural language processing, his work in Natural language is often linked to Pronunciation and Space, thereby combining diverse domains of study. His Natural language research integrates issues from Speech corpus and Word. His Speaker recognition research includes elements of Cluster analysis and Word error rate.

Best Publications

  • Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

    L. Bahl;J. Cocke;F. Jelinek;J. Raviv

  • A Maximum Likelihood Approach to Continuous Speech Recognition

    Lalit R. Bahl;Frederick Jelinek;Robert L. Mercer

  • Maximum mutual information estimation of hidden Markov model parameters for speech recognition

    L. Bahl;P. Brown;P. de Souza;R. Mercer

  • Speech recognition system

    Lalit Rai Bahl;Peter Vincent Desouza;Steven Vincent Degennaro;Robert Leroy Mercer

  • A tree-based statistical language model for natural language speech recognition

    L.R. Bahl;P.F. Brown;P.V. de Souza;R.L. Mercer

  • Design of a linguistic statistical decoder for the recognition of continuous speech

    F. Jelinek;L. Bahl;R. Mercer

  • Perplexity—a measure of the difficulty of speech recognition tasks

    F. Jelinek;R. L. Mercer;L. R. Bahl;J. K. Baker

  • Method and apparatus for the automatic determination of phonological rules as for a continuous speech recognition system

    Lalit Rai Bahl;Peter Fitzhugh Brown;Peter Vincent Desouza;Robert Leroy Mercer

  • Design and construction of a binary-tree system for language modelling

    Lalit Rai Bahl;Peter Fitzhugh Brown;Peter Vincent Desouza;Robert Leroy Mercer

  • Constructing Markov model word baseforms from multiple utterances by concatenating model sequences for word segments

    Lalit Rai Bahl;Peter Vincent Desouza;Robert Leroy Mercer;Michael Alan Picheny

  • Speech recognition with continuous-parameter hidden Markov models

    L.R. Bahl;P.F. Brown;P.V. de Souza;R.L. Mercer

  • Speech recognition apparatus having a speech coder outputting acoustic prototype ranks

    Lalit R. Bahl;Peter Vincent De Souza;Ponani S. Gopalakrishnan;Michael Alan Picheny

  • The metamorphic algorithm: a speaker mapping approach to data augmentation

    J.R. Bellegarda;P.V. de Souza;A. Nadas;D. Nahamoo

  • Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition

    L. Bahl;F. Jelinek

  • Speech recognizer having a speech coder for an acoustic match based on context-dependent speech-transition acoustic models

    Lalit R. Bahl;Peter V. De Souza;Ponani S. Gopalakrishnan;Michael A. Picheny

  • Block codes for a class of constrained noiseless channels

    Donald T. Tang;Lalit R. Bahl

  • Multonic Markov word models for large vocabulary continuous speech recognition

    L.R. Bahl;J.R. Bellegarda;P.V. de Souza;P.S. Gopalakrishnan

  • Automatic generation of simple markov model stunted baseforms for words in a vocabulary

    Lalit Rai Bahl;Peter Vincent Desouza;Robert Leroy Mercer;Michael Alan Picheny

  • Large vocabulary natural language continuous speech recognition

    L.R. Bahl;R. Bakis;J. Bellegarda;P.F. Brown

  • Acoustic Markov models used in the Tangora speech recognition system

    L.R. Bahl;P.F. Brown;P.V. de Souza;M.A. Picheny

Frequent Co-Authors

Robert Leroy Mercer
Robert Leroy Mercer Renaissance Technologies
Michael Picheny
Michael Picheny IBM (United States)
David Nahamoo
David Nahamoo Pyron Inc.
Frederick Jelinek
Frederick Jelinek Johns Hopkins University
Ramesh A. Gopinath
Ramesh A. Gopinath IBM (United States)
Hisashi Kobayashi
Hisashi Kobayashi Princeton University
Stephane H. Maes
Stephane H. Maes Hewlett-Packard (United States)
Dimitri Kanevsky
Dimitri Kanevsky Google (United States)
Salim Roukos
Salim Roukos IBM (United States)
Amir Averbuch
Amir Averbuch Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education opens up a variety of flexible and affordable pathways for advancing your career in computer science or related fields. Today, prospective students can choose from a wide range of fully accredited programs tailored to different schedules and budgets.

For those seeking the highest academic credential, reviewing the most affordable online doctoral programs can be an excellent starting point. If you are interested in education leadership, consider researching the cheapest online doctorate in educational leadership to fast-track your professional goals.

If your priority is gaining credentials quickly, you might ask, what degree can I get online in 6 months? These programs are designed for those wishing to enter the workforce or advance their roles in a short timeframe.

Alternatively, if your interests extend to business or management alongside computer science, many recognized business schools online offer affordable programs that complement technical skills with business acumen.

Best Scientists Citing Lalit R. Bahl

Recently Published Articles