default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Ortmanns
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[c13]Friedemann Kiedaisch, Martin Pohl, Joachim Weisbrod, Siegfried Bauer, Stefan Ortmanns:
Requirements Archaeology: From Unstructured Information to High Quality Specifications. RE 2001: 304-305- 2000
- [j5]Stefan Ortmanns, Hermann Ney:
Look-ahead techniques for fast beam search. Comput. Speech Lang. 14(1): 15-32 (2000) - [j4]Hermann Ney, Stefan Ortmanns:
Progress in dynamic programming search for LVCSR. Proc. IEEE 88(8): 1224-1240 (2000) - [j3]Stefan Ortmanns, Hermann Ney:
The time-conditioned approach in dynamic programming search for LVCSR. IEEE Trans. Speech Audio Process. 8(6): 676-687 (2000)
1990 – 1999
- 1999
- [j2]Hermann Ney, Stefan Ortmanns:
Dynamic programming search for continuous speech recognition. IEEE Signal Process. Mag. 16(5): 64-83 (1999) - [c12]Achim Sixtus, Stefan Ortmanns:
High quality word graphs using forward-backward pruning. ICASSP 1999: 593-596 - [c11]Klaus Beulen, Stefan Ortmanns, Christian Elting:
Dynamic programming search techniques for across-word modelling in speech recognition. ICASSP 1999: 609-612 - [c10]Stefan Ortmanns, Wolfgang Reichl, Wu Chou:
An efficient decoding method for real time speech recognition. EUROSPEECH 1999: 499-502 - 1998
- [b1]Stefan Ortmanns:
Effiziente Suchverfahren zur Erkennung kontinuierlich gesprochener Sprache. RWTH Aachen University, Germany, 1998, pp. 1-154 - [c9]Stefan Ortmanns, Andreas Eiden, Hermann Ney:
Improved lexical tree search for large vocabulary speech recognition. ICASSP 1998: 817-820 - [c8]Hermann Ney, Lutz Welling, Stefan Ortmanns, Klaus Beulen, Frank Wessel:
The RWTH large vocabulary continuous speech recognition system. ICASSP 1998: 853-856 - 1997
- [j1]Stefan Ortmanns, Hermann Ney, Xavier L. Aubert:
A word graph algorithm for large vocabulary continuous speech recognition. Comput. Speech Lang. 11(1): 43-72 (1997) - [c7]Stefan Ortmanns, Lutz Welling, Klaus Beulen, Frank Wessel, Hermann Ney:
Architecture and Search Organization for Large Vocabulary Continuous Speech Recognition. GI Jahrestagung 1997: 456-465 - [c6]Stefan Ortmanns, Andreas Eiden, Hermann Ney, Norbert Coenen:
Look-ahead techniques for fast beam search. ICASSP 1997: 1783-1786 - [c5]Hermann Ney, Stefan Ortmanns, Ingo Lindam:
Extensions to the word graph method for large vocabulary continuous speech recognition. ICASSP 1997: 1791-1794 - [c4]Stefan Ortmanns, Thorsten Firzlaff, Hermann Ney:
Fast likelihood computation methods for continuous mixture densities in large vocabulary speech recognition. EUROSPEECH 1997: 139-142 - 1996
- [c3]Stefan Ortmanns, Hermann Ney, Frank Seide, Ingo Lindam:
A comparison of time conditioned and word conditioned search techniques for large vocabulary speech recognition. ICSLP 1996: 2091-2094 - [c2]Stefan Ortmanns, Hermann Ney, Andreas Eiden:
Language-model look-ahead for large vocabulary speech recognition. ICSLP 1996: 2095-2098 - 1995
- [c1]Stefan Ortmanns, Hermann Ney:
Experimental analysis of the search space for 20 000-word speech recognition. EUROSPEECH 1995: 901-904
Coauthor Index
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).
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).
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 
.
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.
last updated on 2024-09-20 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
