Computer Speech & Language, Volume 11 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Computer Speech & Language

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 11, Number 1, January 1997

• 
  • 
  • 
  • 
  • 
    Jianying Hu, William Turin, Michael K. Brown:
    Language modeling using stochastic automata with variable length contexts. 1-16
• 
  • 
  • 
  • 
  • 
    Mari Ostendorf, Harald Singer:
    HMM topology design using maximum likelihood successive state splitting. 17-41
• 
  • 
  • 
  • 
  • 
    Stefan Ortmanns, Hermann Ney, Xavier L. Aubert:
    A word graph algorithm for large vocabulary continuous speech recognition. 43-72
• 
  • 
  • 
  • 
  • 
    Steve J. Young, Martine Adda-Decker, Xavier L. Aubert, Christian Dugast, Jean-Luc Gauvain, Dan J. Kershaw, Lori Lamel, David A. van Leeuwen, David Pye, Anthony J. Robinson, Herman J. M. Steeneken, Philip C. Woodland:
    Multilingual large vocabulary speech recognition: the European SQALE project. 73-89

Volume 11, Number 2, April 1997

• 
  • 
  • 
  • 
  • 
    Michael S. Brandstein, Harvey F. Silverman:
    A practical methodology for speech source localization with microphone arrays. 91-126
• 
  • 
  • 
  • 
  • 
    Jun-ichi Takahashi, Shigeki Sagayama:
    Vector-field-smoothed Bayesian learning for fast and incremental speaker/telephone-channel adaptation. 127-146
• 
  • 
  • 
  • 
  • 
    Mazin G. Rahim, Chin-Hui Lee:
    String-based minimum verification error (SB-MVE) training for speech recognition. 147-160

Volume 11, Number 3, July 1997

• 
  • 
  • 
  • 
  • 
    Ara Samouelian:
    Frame-level phoneme classification using inductive inference. 161-186
• 
  • 
  • 
  • 
  • 
    S. M. Ahadi, Philip C. Woodland:
    Combined Bayesian and predictive techniques for rapid speaker adaptation of continuous density hidden Markov models. 187-206
• 
  • 
  • 
  • 
  • 
    J. T. Foote, Steve J. Young, Gareth J. F. Jones, Karen Sparck Jones:
    Unconstrained keyword spotting using phone lattices with application to spoken document retrieval. 207-224
• 
  • 
  • 
  • 
  • 
    Erwin W. Drenth, Bernhard Rüber:
    Context-dependent probability adaptation in speech understanding. 225-252
• 
  • 
  • 
  • 
  • 
    R. Singh, K. Davis, P. V. S. Rao:
    Hidden Markov model-based speech recognition with intermediate wavelet transform domains. 253-273

Volume 11, Number 4, October 1997

• 
  • 
  • 
  • 
  • 
    Philip N. Garner:
    On topic identification and dialogue move recognition. 275-306
• 
  • 
  • 
  • 
  • 
    Jun Gao, XiXian Chen:
    Probabilistic word classification based on a context-sensitive binary tree method. 307-320
• 
  • 
  • 
  • 
  • 
    Mikko Kurimo:
    Training mixture density HMMs with SOM and LVQ. 321-343

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: