Associative Networks:
Associative networks are directed graph with labeled node and arc or arrows. It is introduced by Quilllian to model the semantics of English sentences and words. The graphical portrayal of knowledge can also be somewhat more expressive than other representation schemes.
Example:
CAN(Bird, Fly)
COLOR(Tweety, Yellow)
A_KIND_OF (Tweety, Bird)
Has_PARTS(Bird, Wings)
 |
| Associative Network |
Predicate Calculus:
i) All man are mortal and Socretis is a man.
∀x (man(x) → mortal(x))
man(Socretis)
----------------------------
man(Scoretis) → mortal (Scoretis)
ii) if wishes were horses , beggers would ride.
equal(wishes,horses)→ ride(beggers)
Conceptual Graph:
i) One array relation (unary)
 |
| Fly is a 1-array relation |
ii) Two array relation
 |
| Color is 2-array relation |
iii) Three array relation
 |
| Parents is a 3-array relation |
Problem:
1) Marry gave john a book
2) A dog name Emms is brown.
3) Dog eats bone with color brown a dog named Emma is brown in porch
g1:
g2:
Join of g1 and g2
Transition Network:
Used to represent natural language structure , there based on the application of the redirected graph and finite state Automata.t
A transition network consists of number of nodes label are where nodes represent different states in traversing where nodes represented different state and arc`s represent rule requires to make the transition from one state to next.
A path through transition network corresponds to a permissible sequence of work types for a given grammar. If a Transition Network can be successfully traversed if will have a recognised a permissible sentence structure .
Example:
The Child runs.
Noun phrase seqment of a Transition Network:
Comments
Post a Comment