Automatic English-to-Chinese Postal Mail Address Translation System
Automatic English-to-Chinese Postal Mail Address Translation System
Automatic English-to-Chinese Postal Mail Address Translation System
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Inexact word matching method<br />
For a string A of length m and a string B of length n, V(i, j) is defined as the similarity<br />
value of the prefixes[a 1 ,a 2 ,…,a i ] and [b 1 ,b 2 ,…,b j ]. The similarity of A and B is precisely<br />
the value V(m,n). The similarity of two strings A and B can be computed by dynamic<br />
programming with recurrence.<br />
The base conditions are:<br />
V(i,j) = 0, 0 ≤<br />
⎧V(i<br />
− 1, j − 1) + σ ( a , b<br />
⎪<br />
V(i, j) = max⎨V(i<br />
− 1, j)<br />
⎪<br />
⎩<br />
V(i, j − 1)<br />
i<br />
≤<br />
i j)<br />
m, 0<br />
The general recurrence relation is: For 1 ≤ i ≤ m,<br />
≤<br />
j<br />
1<br />
≤<br />
≤<br />
n<br />
j ≤<br />
Here, the matching score between the two letters a i and b j is defined as<br />
σ ( a , b<br />
i<br />
j<br />
⎪⎧<br />
2<br />
) = ⎨<br />
⎪⎩ − 2<br />
a<br />
a<br />
i<br />
i<br />
=<br />
≠<br />
b<br />
b<br />
j<br />
j<br />
n<br />
Copyright Reserved
Change language