home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.speech
- Path: sparky!uunet!caen!sol.ctr.columbia.edu!sol.ctr.columbia.edu!mhall
- From: mhall@occs.cs.oberlin.edu (Matthew Hall)
- Subject: Very simple speech recognition Alg. wanted.
- Sender: nobody@ctr.columbia.edu
- Organization: Oberlin College Computer Science
- Date: Mon, 9 Nov 1992 20:24:32 GMT
- Message-ID: <MHALL.92Nov9152432@occs.cs.oberlin.edu>
- Distribution: comp.speech
- X-Posted-From: occs.cs.oberlin.edu
- NNTP-Posting-Host: sol.ctr.columbia.edu
- Lines: 30
-
- Hello-
- I asked this question before, and recieved no replies.
- However I did recieve at least five requests to pass information on.
- If you can help, please do. Many people want to know.
-
- Simply the question is this - How does one implement a speaker
- dependant, discrete recognition system? For my purposes, the
- vocabulary can be very small (<100 commands), but others have shown
- interest in larger vocabularies.
-
- Specifically, what data should one store - what patterns are unique to
- different words. How does one search a "dictionary" for a specific
- word, and how does one quickly and somewhat accurately match a word
- spoken to it's saved (pattern?) The sound, at least in my case, is
- stored in a raw waveform. I am using pascal on a Macintosh, but I am
- pretty flexible.
-
- If you can help me and the other querents out, either by source code
- or pointers to information, please do. There seems to be a great
- interest in this.
-
- Thank you,
- -matt hall
- --
- -------------------------------------------------------------------------------
- Matt Hall. mhall@occs.oberlin.edu OR SMH9666@OBERLIN.BITNET
- (216)-775-6613 (That's a Cleveland Area code. Lucky Me)
-
- "Life's good, but not fair at all" -Lou Reed
-
-