Question Answering Passage Retrieval Using Dependency Parsing

August 17, 2005

12/28

Measuring Path Match Degree

•Employ a variation of IBM Translation Model 1

–Path match degree (similarity) as translation probability

•MatchScore (PQ, PS) → Prob (PS | PQ )

•Relations as words

–

•Why IBM Model 1?

–No “word order” – bag of undirected relations

–No need to estimate “target sentence length”

•Relation paths are determined by the parsing tree


	Similarity  asymmetric  match degree