Dictionary
Dictionary provides
ID3 algorithm with fixed set of examples based on which
algorithm builds a decision tree.
Input dictionary is in form of LHS<Blank><Blank>RHS,
with each character (more
than one characters may be used to represent single
character of object language) in
RHS seperated by a single blank.Dictionary can be classified
as
1) Letter: conating
map of single characters.
Example:
A a
AA aa
I i
EE ii
II ii
U u
OO uu
AU au
2) Names : containing
names of people and people historical importance.
Example:
ANAND aa na M
da
SHYAM sh ya aa ma
UDAY u da ya
TARA ta aa ra aa
3) City: containg
names of regional cities.
Example:
BANGALORE ba M
ga la o ra
CHANDRAGIRI cha M d ra aa ga i ra i
DEHRADOON da e ha ra aa da uu na
DILLI da i l la ii
4) English: containg
english words used in naming regional roads.
ID3
Algorithm
|