We prove an analog of Parikh's theorem for weighted context-free
grammars over commutative, idempotent semirings, and exhibit a
stochastic context-free grammar with behavior that cannot be realized
by any stochastic right-linear context-free grammar. Finally, we show
that every unary stochastic context-free grammar with
polynomially-bounded ambiguity has an equivalent stochastic
right-linear context-free grammar.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
