Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #!/usr/local/bin/python3
- #
- # Paul Evans (pevans@sandiego.edu)
- # 24 November 2018
- # 8 December 2018
- # 9 December 2018
- # 10 December 2018
- #
- import Levenshtein
- import re
- #
- def main():
- list_Sg = listify(re.split('\W', open('./Sg.txt', 'r').read()))
- list_edF = listify(re.split('\W', open('./edF.txt', 'r').read()))
- dedup(list_Sg, list_edF)
- #
- for Sg_word in list_Sg:
- for edF_word in list_edF:
- if (len(Sg_word) == len(edF_word)):
- if (Levenshtein.hamming(Sg_word, edF_word) == 1):
- print(Sg_word, edF_word)
- #
- def listify(words):
- list = []
- for word in words:
- if word:
- word = word.lower()
- if word not in list: # add it
- list.append(word)
- else:
- pass
- list.sort()
- return(list)
- #
- def dedup(list_A, list_B):
- dups = []
- for word in list_A:
- if word in list_B:
- dups.append(word)
- else:
- pass
- for dup in dups:
- list_A.remove(dup)
- list_B.remove(dup)
- #
- if __name__ == '__main__':
- main()
Add Comment
Please, Sign In to add comment