Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » Curricula » Investigations Other Topics

Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 1
Registered: 11/26/07
Posted: Nov 26, 2007 11:11 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

could anybody suggest a method of building grammar rules for any language.i have trained my HMM with each symbol from alphabet set.i would now like to go ahead building the networks from these HMMs by considering the grammar rules.how to obtain the transition probabilities between the HMMS using the grammar rules.please help me with your expert suggestion.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum 1994-2015. All Rights Reserved.