Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-state approximations. Further upper and lower bounds can be computed by reduced-state methods. © 2006 IEEE.
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Rolf Clauberg
IBM J. Res. Dev
B. Wagle
EJOR