这道题感觉很像SQL。要把三个dic转换成output。然后每个俩俩之间互相计算文字重合率。谢谢老师解答。
values being the ids for each tag to be found in the dct_keys.
Score is defined as the intersection / union for each set of words in any given two lists.
This can be solved using a double for loop, using the below syntax, which will let us iterate each list of words for each list of words, or iterate through each permutation of word lists.
Hint, zip the tags and the corpus so you can iterate both at the same time, referencing the tag and corresponding list of words.