Given two lists of words, dictionary
and sentence
,
I'm trying to create a binary representation based on the inclusion of words of dictionary
in the sentence
such as
[1,0,0,0,0,0,1,...,0]
where 1 indicates that the ith word in the dictionary shows up in the sentence.
What's the fastest way I can do this?
Example data:
dictionary = ['aardvark', 'apple','eat','I','like','maize','man','to','zebra', 'zed']
sentence = ['I', 'like', 'to', 'eat', 'apples']
result = [0,0,1,1,1,0,0,1,0,0]
Is there something faster than the following considering that I'm working with very large lists of approximately 56'000 elements in size?
x = [int(i in sentence) for i in dictionary]
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…