On Nov 12, 2011, at 5:12 PM, Kip Murray wrote: > I see from Skip's discussion and rereading Daniel's post that Daniel may > be thinking, choose a word at random from a population list, next choose > a word at random from the first word's successor list, next choose a > word at random from the second word's successor list, and so on, > bypassing finding the probabilities I had put into a transition matrix.
This is correct, actually. > My discussion assumed someone had indexed the n distinct words in the > population with integers 0 to n-1 and found the n^2 probabilities in my > n by n transition matrix. To generate a random sentence: when index k > has been chosen, use the probabilities in row k to choose the next > index; afterwards convert the chosen indices into words. Too much > trouble? You decide. When you know the transition matrix you can > calculate other interesting matrices, see my discussion. I actually found the responses from you and Skip very helpful and informative. I made progress on that front which I'll share when I achieve something closer to being finished. Everything is just so very different here. I'm very grateful for the list and the ample documentation! Thanks! — Daniel Lyons ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
