shrinking FSA for speech recognition

Francis Picard <>
18 May 2001 23:53:24 -0400

          From comp.compilers

Related articles
shrinking FSA for speech recognition (Francis Picard) (2001-05-18)
| List of all articles for this month |

From: Francis Picard <>
Newsgroups: comp.compilers
Date: 18 May 2001 23:53:24 -0400
Organization: UdeM
Keywords: lex, question
Posted-Date: 18 May 2001 23:53:24 EDT


      I'm working on language modelisation for speech recognition. We
want to compile some grammars similar to EBNF into FSA or word graphs
(in which labels appear in nodes instead of on edges).

Unfortunately, this compilation can generate very large FSA. Actually,
medium to large size grammars generate far too large FSA. So we would
like to transform those FSA into much smaller ones, approximating our
language model, without significantly reducing recognition accuracy.

Does someone know of any work that has been done in that direction ?

thanks in advance,

Francis Picard
M.Sc. student
DIRO, University of Montréal

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.