Syntactic stochastic processes: Definitions, models, and related inference problems
We define a Syntactic Stochastic Process (SSP) as a stochastic process valued in the set of terminal symbols of a grammar, and whose realizations are terminal strings generated by some stochastic grammar. and show that any SSP generated by a Stochastic Context Free Grammar (SCFG) can be consistently...
Saved in:
Published in | Information and computation Vol. 281; p. 104667 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.12.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!