6490
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 .
 algorithm, redundancy elimination problem; underspecified semantic representation -LRB- USR -RRB-, scope ambiguity; equivalent readings, USR
Please list all entity pairs containing a certain relationship in the given options.Output format is "word1, word2; word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
Answer:
 algorithm, redundancy elimination problem; underspecified semantic representation -LRB- USR -RRB-, scope ambiguity; equivalent readings, USR