8857
We present an efficient algorithm for the redundancy elimination problem : Given an underspecified semantic representation -LRB- USR -RRB- of a scope ambiguity , compute an USR with fewer mutually equivalent readings .
 used for: algorithm, redundancy elimination problem; used for: underspecified semantic representation -LRB- USR -RRB-, scope ambiguity; used for: equivalent readings, USR
Given options, please tell me the relationships of all the listed entity pairs.Output format is "relation1: word1, word2; relation2: word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
 Entity Pairs:  algorithm, redundancy elimination problem; underspecified semantic representation -LRB- USR -RRB-, scope ambiguity; equivalent readings, USR 
Answer:
 used for: algorithm, redundancy elimination problem; used for: underspecified semantic representation -LRB- USR -RRB-, scope ambiguity; used for: equivalent readings, USR