【发布时间】:2017-01-06 22:51:08
【问题描述】:
在 Pandas 数据框中有超过 15 条 MM 记录的列表,并且正在尝试确定该字段中包含的唯一有效英文单词的数量。
我怎样才能加快速度?比较。我正在使用 set.intersect(..),但它需要一个多小时。代码和示例数据如下。
df.info()
sys_id float64
grp_id float64
set_id float64
desc object
unique_set object
这些记录的唯一键是“*id”字段。 Desc 是用户定义的描述
我使用下面的代码创建了 unique_set:
df['unique_set'] = df.data_desc.apply(lambda x: detSet(x))
detSet 的定义位置:
def detSet(strDesc):
if len(str(strDesc)) <= 1:
# Return an empty set
return set()
else:
# Remove all punctation
strDesc = strDesc.translate(replace_punctuation).lower()
# Remove all Non Alphabetic Characters (including Numbers)
strDesc = re.sub(r'[^a-zA-Z ]', ' ', strDesc)
# Remove all words less than 4 characters long
strDesc = re.sub(r'\b\w{1,3}\b','', strDesc)
# Remove all the extra spaces
strDesc = ' '.join(strDesc.split())
#
return set(strDesc.split())
然后我读了一份来自http://invpy.com/dictionary.txt的英文字典
ENGLISH_WORDS = open('Dictionary.txt').read().splitlines()
ENGLISH_WORDS = [e.lower() for e in ENGLISH_WORDS]
df['num_english'] = df.unique_set.apply(lambda x: detNumEnglish(x)).astype(np.int16)
def detNumEnglish(setDesc):
if len(setDesc) == 0:
return -1
else:
return len(setDesc.intersection(ENGLISH_WORDS))
一些示例数据:
141 9437 13522 {jelly, beans, pudding, cake, fruitc}
787 29575 5915 {ingerbread, sugar, plum, powder, jelly}
842 22909 28065 {pudding, bear, claw, sesame, snaps, m}
484 36065 25069 {isu, cake, candy, canes, ca}
897 54587 48574 {tart, fruitcake, dessert, bisc}
123 48335 36038 {chocolate, icing, marzipan, macaroon, apple}
293 36779 12239 {ars, sugar, plum, cupcake, danish, tiramis}
115 18478 43114 {e, pudding, gummies, chocola}
183 13346 33084 {roll, caramels, candy, fruitcak}
501 94397 47227 {cake, candy, canes, cake}
473 52269 44396 {e, gummi, bears, tiramisu, cake, candy}
【问题讨论】:
-
我开始怀疑这对代码审查是否会更好......
标签: python pandas dictionary set