Unit 11

Understanding
 Contents
• What is understanding?
• What makes it hard? As constraint
satisfaction
 1. What is understanding?
• Understanding is a psychological process
related to an abstract or physical object, such
as a person, situation, or message whereby
one is able to think about it and use concepts
to deal adequately with that object.
Understanding is a relation between the
knower and an object of understanding.
• Natural language understanding (NLU) is a
branch of artificial intelligence (AI) that uses
computer software to understand input made
in the form of sentences in text or speech
format.
• NLU directly enables human-computer
interaction (HCI). NLU understanding of
natural human languages enables computers
to understand commands without the
formalized syntax of computer languages and
for computers to communicate back to
humans in their own languages.
• The field of NLU is an important and
challenging subset of natural language
processing (NLP). While both understand
human language, NLU is tasked with
communicating with untrained individuals and
understanding their intent, meaning that NLU
goes beyond understanding words and
interprets meaning. NLU is even programmed
with the ability to understand meaning in
spite of common human errors like
mispronunciations or transposed letters or
words.
• NLU uses algorithms to reduce human speech
into a structured ontology. AI fishes out such
things as intent, timing, locations and
sentiments.
• The main drive behind NLU is to create chat
and speech enabled bots that can interact
effectively with the public without
supervision. NLU is a pursuit of many start up
and major IT companies. Companies working
on NLU include Medium's Lola, Amazon's with
Alexis and Lex, Apple's Siri, Google's Assistant
and Microsoft's Cortana
 2. CSP
• A constraint satisfaction problem (CSP) is a
problem that requires its solution within some
limitations/conditions also known as constraints.
It consists of the following:
=>A finite set of variables which stores the solution.
(V = {V1, V2, V3,....., Vn} )
=>A set of discrete values known as domain from
which the solution is picked. (D = {D1, D2,
D3,.....,Dn} )
=>A finite set of constraints. (C = {C1, C2, C3,......,
Cn} )
Given a CSP, there are a number of tasks that can be
performed:
• Determine whether or not there is a model.
• Find a model.
• Find all of the models or enumerate the models.
• Count the number of models.
• Find the best model, given a measure of how
good models are;
• Determine whether some statement holds in all
models.
 Popular Problems if CSP
• CryptArithmetic (Coding alphabets to numbers.)
• n-Queen (In an n-queen problem, n queens should be
placed in a nXn matrix such that no queen shares the
same row, column or diagonal.)
• Map Coloring (Coloring different regions of map
ensuring no adjacent regions have the same color.)
• Crossword (Everyday puzzles appearing in
newspapers.)
• Sudoku (A number grid.)
• Latin Square Problem
 Converting problems into CSP
• A problem to be converted to CSP requires the
following steps:
Step 1: Create a variable set.
Step 2: Create a domain set.
Step 3: Create a constraint set with variables
and domains (if possible) after considering the
constraints.
Step 4: Find an optimal solution.
 Example Problem (Map Coloring)
• Consider a map coloring problem below. A
map is given to you and you have to fill it with
only three colors : Blue, Green and Red. But
no two adjacent locations should have the
same color.
• Declare Variable Set, Domain Set and
Constraint set