This course will become read-only in the near future. Tell us at community.p2pu.org if that is a problem.
Everyone from Google to Microsoft is looking for a way to a way to make computers more communative with humans. After a successful demonstration of IBM's computer named Watson beating out two of Jeopardy's most successful competitors much attention has been given to NLP. This course discusses the challenges and successes in NLP.
This is a little mathematical but you can do it. There are several algorithms involved in NLP and Markov Chains are the most common.
A Markov chain is a way of countable possible states
A stochastic process is one that is a collection of random variables.
A stochastic matrix is a square matrix where each of its rows is a probability vector
A http://academicearth.org/lectures/markov-chain-example
