Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rene Hollan

dblp:63/7166 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5Artificial intelligence and machine learning · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Speech recognition and synthesis · 56% Planning, search and constraint satisfaction · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search › best-first search
a* search
0.011993
A*-admissible heuristics for rapid lexical access · IEEE Trans. Speech Audio Process. 1993
Natural language and speech › Speech recognition and synthesis
lexical access
0.011993
A*-admissible heuristics for rapid lexical access · IEEE Trans. Speech Audio Process. 1993
Natural language and speech › Speech recognition and synthesis › search and decoding
viterbi decoding
0.011993
A*-admissible heuristics for rapid lexical access · IEEE Trans. Speech Audio Process. 1993

Methods — techniques the papers use, named apart from their topics

a* admissible heuristics · 0.0
YearPublicationVenuePosition
1994 Experiments in continuous speech recognition using books on tape
Patrick Kenny, Gilles Boulianne, Harinath Garudadri, S. Trudelle, Rene Hollan, Matthew Lennig, Douglas D. O'Shaughnessy
Speech Commun.5
1993 A new fast match for very large vocabulary continuous speech recognition
Patrick Kenny, Paul Labute, Zhishun Li, Rene Hollan, Matthew Lennig, Douglas D. O'Shaughnessy
ICASSP (2)4
1993 A very fast method for scoring phonetic transcriptions
Patrick Kenny, Paul Labute, Zhishun Li, Rene Hollan, Matthew Lennig, Douglas D. O'Shaughnessy
EUROSPEECH4
1993 A*-admissible heuristics for rapid lexical access
abstract
A new class of A* algorithms for Viterbi phonetic decoding subject to lexical constraints is presented. This type of algorithm can be made to run substantially faster than the Viterbi algorithm in an isolated word recognizer having a vocabulary of 1600 words. In addition, multiple recognition hypotheses can be generated on demand and the search can be constrained in respect conditions on phone durations in such a way that computational requirements are substantially reduced. Results are presented on a 60000-word recognition task.>
Patrick Kenny, Rene Hollan, Vishwa Gupta, Matthew Lennig, Paul Mermelstein, Douglas D. O'Shaughnessy
IEEE Trans. Speech Audio Process.2
1992 Experiments in continuous speech recognition with a 60, 000 word vocabulary
Patrick Kenny, Rene Hollan, Gilles Boulianne, Harinath Garudadri, Yan Ming Cheng, Matthew Lennig, Douglas D. O'Shaughnessy
ICSLP2
1991 A*-admissible heuristics for rapid lexical access
abstract
The authors present a new class of A* algorithms for Viterbi phonetic decoding subject to lexical constraints. They show that this type of algorithm can be made to run substantially faster than the Viterbi algorithm in an isolated word recognizer having a vocabulary of 1600 words and that it runs very quickly on a 60000-word recognition task. In addition, multiple recognition hypotheses can be generated on demand and the search can be constrained to respect conditions on phone durations in such a way that computational requirements are substantially reduced.>
Patrick Kenny, Rene Hollan, Vishwa Gupta, Matthew Lennig, Paul Mermelstein, Douglas D. O'Shaughnessy
ICASSP2