|
|
| Calculating
Translation |
|
| Probability
(Similarity) of Paths |
|
| Given two relation paths
from the question and a candidate sentence |
|
|
| Considering
the most probable alignment (finding |
|
| the most
probable mapped relations) |
|
|
|
| Take
logarithm and ignore the constants (for all |
|
| sentences,
question path length is a constant) |
|
|
|
|
| MatchScores
of paths are |
||
| combined
to give the sentence’s |
||
| relevance
to the question. |
||
| ? |
