U BŒeõã@s(ddlZddlmZGdd„deƒZdS)éN)ÚStemmerIc@s*eZdZdZd dd„Zdd„Zdd„Zd S) Ú RegexpStemmeraä A stemmer that uses regular expressions to identify morphological affixes. Any substrings that match the regular expressions will be removed. >>> from nltk.stem import RegexpStemmer >>> st = RegexpStemmer('ing$|s$|e$|able$', min=4) >>> st.stem('cars') 'car' >>> st.stem('mass') 'mas' >>> st.stem('was') 'was' >>> st.stem('bee') 'bee' >>> st.stem('compute') 'comput' >>> st.stem('advisable') 'advis' :type regexp: str or regexp :param regexp: The regular expression that should be used to identify morphological affixes. :type min: int :param min: The minimum length of string to stem rcCs$t|dƒst |¡}||_||_dS)NÚpattern)ÚhasattrÚreÚcompileÚ_regexpÚ_min)ÚselfÚregexpÚmin©r úl/var/www/nmhs-web.org.in/public_html/infoladakh/backend/venv/lib/python3.8/site-packages/nltk/stem/regexp.pyÚ__init__*s  zRegexpStemmer.__init__cCs$t|ƒ|jkr|S|j d|¡SdS)NÚ)Úlenr rÚsub)r Úwordr r rÚstem1szRegexpStemmer.stemcCsd |jj¡S)Nz)Úformatrr)r r r rÚ__repr__7szRegexpStemmer.__repr__N)r)Ú__name__Ú __module__Ú __qualname__Ú__doc__rrrr r r rrs r)rZ nltk.stem.apirrr r r rÚ s