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.
N-gram is a contiguous sequence of n items from a given sequence of text or speech. The items in question can be phonemes, syllables, letters, words orbase pairs according to the application. n-grams are collected from a text or speech corpus. Please see http://googleresearch.blogspot.com/2006/08/all-our-n-gram-are-belong-to-you.html
