|shrinking FSA for speech recognition firstname.lastname@example.org (Francis Picard) (2001-05-18)|
|From:||Francis Picard <email@example.com>|
|Date:||18 May 2001 23:53:24 -0400|
|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,
DIRO, University of Montréal
Return to the
Search the comp.compilers archives again.