i want to take the intersection of:

(('e', 13.02338360095244), ('a', 11.820318700775383), ('o', 9.20172171683253), ('s', 7.635081506807498), ('n', 7.547469320471335), ('i', 7.219915745772025), ('r', 6.704927040722877), ('l', 5.650833384211491), ('d', 5.098296599303987), ('t', 4.7109103119848585))

and:

[('e', 1636), ('n', 991), ('a', 930), ('t', 678), ('o', 677), ('r', 612), ('d', 581), ('i', 507), ('l', 405), ('s', 399)]

but these 2 have different types, how do i go about taking the intersection and displaying the amount of elements in the intersection?

You can you the intersection of set. For example:

a = (('e', 13.02338360095244), ('a', 11.820318700775383), ('o', 9.20172171683253), ('s', 7.635081506807498), ('n', 7.547469320471335), ('i', 7.219915745772025), ('r', 6.704927040722877), ('l', 5.650833384211491), ('d', 5.098296599303987), ('t', 4.7109103119848585))
b = [('e', 1636), ('n', 991), ('a', 930), ('t', 678), ('o', 677), ('r', 612), ('d', 581), ('i', 507), ('l', 405), ('s', 399)]set(k for k,_ in a).intersection(k for k,_ in b)

Output will be {'i', 'a', 's', 'n', 'r', 'l', 't', 'o', 'd', 'e'}.