01-03-2012, 09:11 PM
Code:
Question No.2:
Use the following dynamic programming based recurrence edit distance to find
the possible edit scripts while converting “INVENTION “to “CONVENTION”.
( )
( )
( )
( ) [ ] [ ]
( ) [ ] [ ]
1, 1
, 1 1
, min
1, 1 1
1, 1
E i j
E i j
E i j
E i j if A i B j
E i j if A i B j
- +
- + = - - + ¹
- - =
Solution:
( )
( )
( )
( ) [ ] [ ]
( ) [ ] [ ]
8,10 1
9,9 1
9,10 min
8,9 1 9 10
8,9 9 10
E
E
E
E if A B
E if A B
+
+ = + ¹
=
Final table with all E [I, J] entries computed
C O N V E N T I O N
0 ®1 ®2 ®3 ®4 ®5 ®6 ®7 ®8 ®9 ®10
I ¯
1
]
1
]®
2
]®
3
]®
4
]®
5
]®
6
]®
7
]®
8
]®
9
]®
10
N ¯
2
] ¯
2
]
2
]
2 ®3 ®4 ®5 ®6 ®7 ®8
]
9
V ¯
3
] ¯
3
]
3
] ¯
3
]
2 ®3 ®4 ®5 ®6 ®7 ®8
E ¯
4
] ¯
4
] ¯
4
¯4
¯3
]
2 ®3 ®4 ®5 ®6 ®7
N ¯
5
] ¯
5
] ¯
5
] ¯
5
¯4
¯3
]
2 ®3 ®4 ®5 ®6
T ¯
6
] ¯
6
] ¯
6
¯6
¯5
¯4
¯3
]
2 ®3 ®4 ®5
I ¯
7
] ¯
7
] ¯
7
] ¯
7
¯6
¯5
¯4
¯3
]
2 ®3 ®4
O ¯
8
] ¯
8
] ¯
8
] ¯
8
¯7
¯6
¯5
¯4
¯3
]
2 ®3
N ¯
9
] ¯
9
] ¯
9
] ¯
9
¯8
¯7
¯6
¯5
¯4
¯3
]
2
® shows insertion
¯ shows deletion
] shows match or substitution
SOLUTION PATH:
1+ 1+ 0+ 0+ 0+ 0+ 0+ 0+ 0+ 0+ = 2 MINIMUM DISTANCE
S I M M M M M M M M
I - N V E N T I O N
C O N V E N T I O N0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]
