Delete proj4_2_label.csv
Browse files- proj4_2_label.csv +0 -50
proj4_2_label.csv
DELETED
|
@@ -1,50 +0,0 @@
|
|
| 1 |
-
sentence,label
|
| 2 |
-
" perms = all_permutations_substrings(string)\n return set(''.join(perm) for word in words for perm in perms if word == perm)",0
|
| 3 |
-
" perms = all_permutations_substrings(string)\n out = set()\n for w in words:\n for s in perms:\n if w == s:\n out.add(w)\n return out",0
|
| 4 |
-
" perms = all_permutations_substrings(string)\n return set(word for word in words if word in perms)",0
|
| 5 |
-
" perms = all_permutations_substrings(string)\n return {word for word in words if word in perms}",0
|
| 6 |
-
" perms = all_permutations_substrings(string)\n return {word for word in words for perm in perms if word in perm}",0
|
| 7 |
-
" perms = all_permutations_substrings(string)\n return {perm for perm in words if perm in perms}",0
|
| 8 |
-
" perms = all_permutations_substrings(string)\n return {word for word in words if word in set(perms)}",0
|
| 9 |
-
" perms = all_permutations_substrings(string)\n return set(x for x in words if x in perms)",0
|
| 10 |
-
" perms = all_permutations_substrings(string)\n return set(perm for perm in perms if perm in words)",0
|
| 11 |
-
" perms = all_permutations_substrings(string)\n return {x for x in words if x in perms}",0
|
| 12 |
-
" perms = all_permutations_substrings(string)\n return {w for w in words if w in perms}",0
|
| 13 |
-
" perms = all_permutations_substrings(string)\n return {i for i in perms if (i in words)",0
|
| 14 |
-
" perms = all_permutations_substrings(string)\n return {item for item in perms if item in words}",0
|
| 15 |
-
" perms = all_permutations_substrings(string)\n return {x for x in perms for y in words if x == y}",0
|
| 16 |
-
" perms = all_permutations_substrings(string)\n return set([perm for perm in perms if perm in words])",0
|
| 17 |
-
" perms = all_permutations_substrings(string)\n set = {} \n set = {i for i in perms if i in words}",0
|
| 18 |
-
" perms = all_permutations_substrings(string)\n p = {items for items in words if items in perms}\n return p",0
|
| 19 |
-
" perms = all_permutations_substrings(string)\n return set([x for x in list(perms) + words if x in list(perms) and x in words])",0
|
| 20 |
-
" perms = all_permutations_substrings(string)\n all_permutations_list = []\n [all_permutations_list.append(permutation) for permutation in perms if permutation in words]\n return set(all_permutations_list)",0
|
| 21 |
-
" perms = all_permutations_substrings(string)\n return set([perm for perm in perms for word in words if perm == word])",0
|
| 22 |
-
" perms = all_permutations_substrings(string)\n out = set()\n for w in words:\n for s in perms:\n if w == s :\n out.add(w)\n return out",0
|
| 23 |
-
" perms = all_permutations_substrings(string)\n match_words = []\n for i in words:\n for j in perms:\n if i==j:\n match_words.append(i)\n return set(match_words)",0
|
| 24 |
-
" perms = all_permutations_substrings(string)\n to_return = []\n for w in words:\n if w in perms:\n to_return.append(w)\n to_return = set(to_return)\n return to_return",0
|
| 25 |
-
" perms = all_permutations_substrings(string)\n list1 = []\n for p in perms:\n if p not in list1:\n if p in words:\n list1.append(p)\n return set(list1)",0
|
| 26 |
-
" perms = all_permutations_substrings(string)\n items = set()\n for word in words:\n if hash(word) in {hash(item) for item in perms}:\n items.add(word)\n return items",0
|
| 27 |
-
" perms = all_permutations_substrings(string)\n return {word for word in words if hash(word) in {hash(looking) for looking in perms}}",0
|
| 28 |
-
" perms = all_permutations_substrings(string)\n return {letters for letters in words if hash(letters) in {hash(find) for find in perms}}",0
|
| 29 |
-
" perms = all_permutations_substrings(string)\n return {each for each in words if hash(each) in {hash(find) for find in perms }}",0
|
| 30 |
-
" perms = all_permutations_substrings(string)\n return set({item:None for item in perms if item in words}.keys()) ",0
|
| 31 |
-
" perms = all_permutations_substrings(string)\n return set(filter(lambda x: x in perms, words))",0
|
| 32 |
-
" counter = defaultdict(int)\n for character in string:\n counter[character] += 1\n result = set()\n for word in words:\n word_counter = defaultdict(int)\n for character in word:\n word_counter[character] += 1\n for key, count in word_counter.items():\n if counter[key] < count:\n break\n else:\n result.add(word)\n return result",0
|
| 33 |
-
" perms = all_permutations_substrings(string)\n matching_words = set()\n for i in range(1, len(string)+1):\n for perm in permutations(string, i):\n if ''.join(perm) in words:\n matching_words.add(''.join(perm))\n return matching_words",0
|
| 34 |
-
" perms = all_permutations_substrings(string)\n return set(list(set(perms) & set(words)))",0
|
| 35 |
-
" perms = all_permutations_substrings(string)\n for x in perms:\n words.append(x)\n dupes = [x for n, x in enumerate(words) if x in words[:n]] \n return set(dupes)",0
|
| 36 |
-
" perms = all_permutations_substrings(string)\n result = perms & set(words)\n return set(i for i in words if i in perms)",0
|
| 37 |
-
" perms = all_permutations_substrings(string)\n return perms.intersection(words)",1
|
| 38 |
-
" perms = all_permutations_substrings(string)\n return set.intersection(perms,words)",1
|
| 39 |
-
" perms = all_permutations_substrings(string)\n return set(perms).intersection(words)",1
|
| 40 |
-
" perms = all_permutations_substrings(string)\n return set(words) & set(perms)",1
|
| 41 |
-
" perms = all_permutations_substrings(string)\n return set(perms) & set(words)",1
|
| 42 |
-
" perms = all_permutations_substrings(string)\n if set(words) & set(perms):\n res = (set(words) & set(perms))\n return res",1
|
| 43 |
-
" perms = all_permutations_substrings(string)\n return set(words)&perms",1
|
| 44 |
-
" perms = all_permutations_substrings(string)\n return set( perms.intersection(words))",1
|
| 45 |
-
" perms = all_permutations_substrings(string)\n combined = set(perms)&set(words)\n return combined",1
|
| 46 |
-
" perms = all_permutations_substrings(string)\n p2 = set(words)\n p1 = all_permutations_substrings(string)\n return p1.intersection(p2)",1
|
| 47 |
-
" perms = all_permutations_substrings(string)\n return perms.intersection(set(words))",1
|
| 48 |
-
" perms = all_permutations_substrings(string)\n return set(set(perms).intersection(words)) ",1
|
| 49 |
-
" perms = all_permutations_substrings(string)\n x2 = set(words)\n x1 = all_permutations_substrings(string)\n return x1.intersection(x2)",1
|
| 50 |
-
" perms = all_permutations_substrings(string)\n list = []\n return set(words).intersection(perms)",1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|