Which describes the Monge$-$Elkan similarity measure?

a$.$ Effective in matching names, since names are often spelled in different ways that sound the same

b$.$ Retrieves only the strings in Y whose size makes them match candidates

c$.$Limits the set of candidate matches by deriving an upper bound on the size of the overlap between a pair of strings

d $.$Effective for domains in which more control is needed over the similarity measure