|
|
|
|
|
|
|
|
|
|
|
|
• |
We adopt two
methods to compute path
|
|
|
similarity using
different relation alignment
|
|
|
methods.
|
|
|
• |
Option 1: ignore
the words of those relations
|
|
|
along the given
paths – Total Path Matching.
|
|
|
|
– |
A path consists
of only a list of relations.
|
|
|
|
– |
Relation
alignment by permutation of all possibilities.
|
|
|
– |
Adopt IBM’s Model
1 for statistical translation:
|
|