Created
October 4, 2019 03:24
-
-
Save kohlishivam/986ec33a3b1d8c12926e7bbb91957122 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import re | |
def remove_special_characters(text): | |
pattern = r'[^a-zA-z\s]' | |
text = re.sub(pattern, '', text) | |
return text |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import re | |
appos = { | |
"aren't" : "are not", | |
"can't" : "cannot", | |
"couldn't" : "could not", | |
"didn't" : "did not", | |
"doesn't" : "does not", | |
"don't" : "do not", | |
"hadn't" : "had not", | |
"hasn't" : "has not", | |
"haven't" : "have not", | |
"he'd" : "he would", | |
"he'll" : "he will", | |
"he's" : "he is", | |
"i'd" : "I would", | |
"i'd" : "I had", | |
"i'll" : "I will", | |
"i'm" : "I am", | |
"isn't" : "is not", | |
"it's" : "it is", | |
"it'll":"it will", | |
"i've" : "I have", | |
"let's" : "let us", | |
"mightn't" : "might not", | |
"mustn't" : "must not", | |
"shan't" : "shall not", | |
"she'd" : "she would", | |
"she'll" : "she will", | |
"she's" : "she is", | |
"shouldn't" : "should not", | |
"that's" : "that is", | |
"there's" : "there is", | |
"they'd" : "they would", | |
"they'll" : "they will", | |
"they're" : "they are", | |
"they've" : "they have", | |
"we'd" : "we would", | |
"we're" : "we are", | |
"weren't" : "were not", | |
"we've" : "we have", | |
"what'll" : "what will", | |
"what're" : "what are", | |
"what's" : "what is", | |
"what've" : "what have", | |
"where's" : "where is", | |
"who'd" : "who would", | |
"who'll" : "who will", | |
"who're" : "who are", | |
"who's" : "who is", | |
"who've" : "who have", | |
"won't" : "will not", | |
"wouldn't" : "would not", | |
"you'd" : "you would", | |
"you'll" : "you will", | |
"you're" : "you are", | |
"you've" : "you have", | |
"'re": " are", | |
"wasn't": "was not", | |
"we'll":" will", | |
"didn't": "did not", | |
"aren't": "are not", | |
"can't": "cannot", | |
"'cause": "because", | |
"could've": "could have", | |
"couldn't": "could not", | |
"didn't": "did not", | |
"doesn't": "does not", | |
"don't": "do not", | |
"hadn't": "had not", | |
"hasn't": "has not", | |
"haven't": "have not", | |
"he'd": "he would", | |
"he'll": "he will", | |
"he's": "he is", | |
"how'd": "how did", | |
"how'd'y": "how do you", | |
"how'll": "how will", | |
"how's": "how is", | |
"I'd": "I would", | |
"I'd've": "I would have", | |
"I'll": "I will", | |
"I'll've": "I will have", | |
"I'm": "I am", | |
"I've": "I have", | |
"i'd": "i would", | |
"i'd've": "i would have", | |
"i'll": "i will", | |
"i'll've": "i will have", | |
"i'm": "i am", | |
"i've": "i have", | |
"isn't": "is not", | |
"it'd": "it would", | |
"it'd've": "it would have", | |
"it'll": "it will", | |
"it'll've": "it will have", | |
"it's": "it is", | |
"let's": "let us", | |
"ma'am": "madam", | |
"mayn't": "may not", | |
"might've": "might have", | |
"mightn't": "might not", | |
"mightn't've": "might not have", | |
"must've": "must have", | |
"mustn't": "must not", | |
"mustn't've": "must not have", | |
"needn't": "need not", | |
"needn't've": "need not have", | |
"o'clock": "of the clock", | |
"oughtn't": "ought not", | |
"oughtn't've": "ought not have", | |
"shan't": "shall not", | |
"sha'n't": "shall not", | |
"shan't've": "shall not have", | |
"she'd": "she would", | |
"she'd've": "she would have", | |
"she'll": "she will", | |
"she'll've": "she will have", | |
"she's": "she is", | |
"should've": "should have", | |
"shouldn't": "should not", | |
"shouldn't've": "should not have", | |
"so've": "so have","so's": "so as", | |
"this's": "this is", | |
"that'd": "that would", | |
"that'd've": "that would have", | |
"that's": "that is", | |
"there'd": "there would", | |
"there'd've": "there would have", | |
"there's": "there is", | |
"here's": "here is", | |
"they'd": "they would", | |
"they'd've": "they would have", | |
"they'll": "they will", | |
"they'll've": "they will have", | |
"they're": "they are", | |
"they've": "they have", | |
"to've": "to have", | |
"wasn't": "was not", | |
"we'd": "we would", | |
"we'd've": "we would have", | |
"we'll": "we will", | |
"we'll've": "we will have", | |
"we're": "we are", | |
"we've": "we have", | |
"weren't": "were not", | |
"what'll": "what will", | |
"what'll've": "what will have", | |
"what're": "what are", | |
"what's": "what is", | |
"what've": "what have", | |
"when's": "when is", | |
"when've": "when have", | |
"where'd": "where did", | |
"where's": "where is", | |
"where've": "where have", | |
"who'll": "who will", | |
"who'll've": "who will have", | |
"who's": "who is", | |
"who've": "who have", | |
"why's": "why is", | |
"why've": "why have", | |
"will've": "will have", | |
"won't": "will not", | |
"won't've": "will not have", | |
"would've": "would have", | |
"wouldn't": "would not", | |
"wouldn't've": "would not have", | |
"y'all": "you all", | |
"y'all'd": "you all would", | |
"y'all'd've": "you all would have", | |
"y'all're": "you all are", | |
"y'all've": "you all have", | |
"you'd": "you would", | |
"you'd've": "you would have", | |
"you'll": "you will", | |
"you'll've": | |
"you will have", | |
"you're": "you are", | |
"you've": "you have" | |
} | |
def expand_contract(text): | |
data=text.lower() | |
tokens=data.split() | |
contract=[appos[word] if word in appos else word for word in tokens] | |
return ' '.join(contract) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from nltk.stem import WordNetLemmatizer | |
def simple_lemma(data): | |
filtered = [] | |
lemmatizer = WordNetLemmatizer() | |
filtered=[lemmatizer.lemmatize(word) for word in data.split()] | |
text = ' '.join(filtered) | |
return text |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def lower_case(text): | |
return text.lower() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from nltk.stem import PorterStemmer | |
def stemmer(text): | |
porter = PorterStemmer() | |
filtered=[porter.stem(word) for word in text.split()] | |
text = ' '.join(filtered) | |
return text |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from nltk.corpus import stopwords | |
from nltk.tokenize import word_tokenize | |
stop_words = set(stopwords.words("english")) | |
def tokenize_word(data): | |
return word_tokenize(data) | |
def stopwords_removal(data): | |
filtered_sentence = [] | |
word_tokens = word_tokenize(data) | |
filtered_sentence = [w for w in word_tokens if not w in stop_words] | |
final=' '.join(filtered_sentence) | |
return final |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from nltk.tokenize import word_tokenize | |
def tokenize_word(data): | |
return word_tokenize(data) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment