Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Join a Berkeley seminar lecture exploring the semantic foundations of polarity tagging in computational linguistics and natural language processing. Delve into the theoretical aspects of identifying upward-entailing and downward-entailing positions of words within sentences, focusing on mathematical foundations rather than practical applications. Examine how previous approaches using categorial grammar and Lambek Calculus can be extended to accommodate more sophisticated grammatical formalisms with flexible type systems. Learn about working with type hierarchies constructed from preorders and monotone/antitone functions, and discover how higher-order combinators like type raising, composition, and argument raising can be adapted to ordered settings. Gain clarity on subtle mathematical concepts that often lead to misunderstandings in this complex subject area.
