Escolar Documentos
Profissional Documentos
Cultura Documentos
What is understanding ? Inference about speakers goals and assumptions and context of interaction NLU program requires Large amount of knowledge Reason effectively with knowledge
1
Perception
Communication
through sight, hearing, touch smell, taste and generating words. Ability to communicate effectively is an intelligent behaviour
2
3.
Speech understanding
Stages of NLU
INPUT : MOTHER PATTED CHILD
PARSING PARSE TREE : NOUN PHARSE NOUN MOTHER PATTED CHILD VERB SENTENCE VERB PHRASE NOUN PHARSE NOUN
SEMANTIC INTERPRETATION
Next 10
Next
11
EXPERIENCER
LOVE
OBJECT
PERSON : CHILD OBJECT HAND To Question answerer data base query handler, translator etc.
LOCATION
HOME
LOCATION
12
Stages of NLU
1. Parsing : - Verifies syntactic correctness - Creates parse tree - Employs knowledge of language syntax, morphology Semantic Interpretation : - Represents meaning of text - Frames, or other logic-based representations are used - Performing semantic consistency checks. World Knowledge Interpretation : - Produces expanded representation - uses necessary world knowledge for complete understanding.
13
2.
3.
Parsing Techniques
Grammars and Languages V = { A,B,..,Z, a,b,..z } String is constructed from concatenating elements of V L = { S/ S is a string } A language is a set of strings of finite length Well formed sentences are constructed using set of rules called grammar L(G) Denotes the Language Generated by grammar
14
16
17
21
Context-Sensitive Grammar
Type - 1 grammar Also called context-sensitive grammar Restrictions Length of string on R.H.S. in a rule >= length of string on L.H.S. in rewrite rule xyz x w z, y must be a non-terminal w { e
22
Context Sensitive Grammar(Contd..) Typical grammar rules Capitals - non-terminals Small letters - terminals S S AB aA aA aS aAB BA ab aa
23
Context-Free Grammar
Type 2 grammar Also called context-free grammar Typical form A xyz A single non terminal Production Rules S aS S a Sb S aB S a AB A a B a
24
Regular grammar
Type 3 grammar Most restrictive Also called finite state or regular grammar Production Rules A aB A a
25
26
Lexicon
28
The Lexicon
Lexicon : A dictionary of words containing syntactic, semantic and pragmatic information. The entries of a lexicon may not be the same.
29
Transition Networks
Used to represent natural language structures Consists of a number of nodes and labeled arcs. Nodes represent different states in a sentence Arcs represent rules or test conditions to make the transition from state to state
33
noun N2 N3
verb N4
36
38
Note : POP is used to signal the successful completion of the sub network.
39
Dog