Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Maire, Frederic D., Wathne, Frank, & Lifchitz, Alain (2003) Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications. In AI 2003: Advances in Artificial Intelligence: 16th Australian Conference on AI, Springer, Perth, Australia, pp. 466-476.
![[img]](http://eprints.qut.edu.au/style/images/fileicons/application_pdf.png)
Abstract
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.
Citations:
Citation countsare sourced monthly from Scopus and Web of Science citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science generally from 1980 onwards.
Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.
Full-text downloads:
Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
| ID Code: | 2981 |
|---|---|
| Item Type: | Conference Paper |
| Keywords: | Non, deterministic automata, Hidden Markov Models, lexical constraints, Automata reduction |
| DOI: | 10.1007/b94701 |
| ISBN: | 9783540206460 |
| ISSN: | 1611-3349 |
| Subjects: | Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) |
| Divisions: | Past > QUT Faculties & Divisions > Faculty of Science and Technology |
| Copyright Owner: | Copyright 2003 Springer |
| Copyright Statement: | This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via SpringerLink. http://www.springer.de/comp/lncs/ Lecture Notes in Computer Science |
| Deposited On: | 04 Jan 2006 |
| Last Modified: | 29 Feb 2012 22:59 |
Export: EndNote | Dublin Core | BibTeX
Staff only: HERDC collection form
Repository Staff Only: item control page