DE eng

Search in the Catalogues and Directories

Hits 1 – 9 of 9

1
Effect of tuned parameters on an LSA multiple choice questions answering model [<Journal>]
Lifchitz, Alain [Verfasser]; Jhean-Larose, Sandra [Verfasser]; Denhière, Guy [Verfasser]
DNB Subject Category Language
Show details
2
Effect of Tuned Parameters on a LSA Multiple Choice Questions Answering Model
In: ISSN: 1554-351X ; EISSN: 1554-3528 ; Behavior Research Methods ; https://hal.archives-ouvertes.fr/hal-00336126 ; Behavior Research Methods, Psychonomic Society, Inc, 2009, 41 (4), pp.1201--1209. &#x27E8;10.3758/BRM.41.4.1201&#x27E9; (2009)
BASE
Show details
3
Fast Lexically Constrained Viterbi Algorithm (FLCVA): Simultaneous Optimization of Speed and Memory
In: https://hal.archives-ouvertes.fr/hal-00018116 ; 2006 (2006)
BASE
Show details
4
An Optimal Path Coding System for DAWG Lexicon-HMM
In: EUSIPCO 2006 - Fourteenth European Signal Processing Conference ; https://hal.archives-ouvertes.fr/hal-00067960 ; EUSIPCO 2006 - Fourteenth European Signal Processing Conference, Sep 2006, Florence, Italy. pp.53-57 (2006)
BASE
Show details
5
An Optimal Path Coding System For Dawg Lexicon-Hmm ...
BASE
Show details
6
Fast Lexically Constrained Viterbi Algorithm (FLCVA): Simultaneous Optimization of Speed and Memory ...
BASE
Show details
7
An Optimal Path Coding System For Dawg Lexicon-Hmm ...
BASE
Show details
8
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
In: 16th Australian Joint Conference on Artificial Intelligence (AI'03) ; https://hal.archives-ouvertes.fr/hal-00012623 ; 16th Australian Joint Conference on Artificial Intelligence (AI'03), Dec 2003, Perth, Australia. pp.466-476, &#x27E8;10.1007/978-3-540-24581-0_39&#x27E9; (2003)
Abstract: International audience ; Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie (automaton whose underlying graph is a tree). In a previous paper, we showed that non-deterministic automata were computationally more efficient than tries. In this paper, we propose a new method for constructing incrementally small non-deterministic automata from lexicons. We present experimental results demonstrating a significant reduction in the number of labels in the automata. This reduction yields a proportional speed-up in HMM based lexically constrained pattern recognition systems.
Keyword: [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]; [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]; [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]; compact DAWG; Handwriting Recognition; HMM; Large Vocabularies
URL: https://hal.archives-ouvertes.fr/hal-00012623
https://doi.org/10.1007/978-3-540-24581-0_39
https://hal.archives-ouvertes.fr/hal-00012623/document
https://hal.archives-ouvertes.fr/hal-00012623/file/2003ai03.pdf
BASE
Hide details
9
A Fast Lexically Constrained Viterbi Algorithm for On-line Handwriting Recognition
In: Seventh International Wokshop on Frontiers in Handwriting Recognition - IWFHR-7 ; https://hal.archives-ouvertes.fr/hal-00012559 ; Seventh International Wokshop on Frontiers in Handwriting Recognition - IWFHR-7, 2000, Amsterdam, Netherlands. pp.313-322 (2000)
BASE
Show details

Catalogues
0
0
0
0
1
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
8
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern