'[f*6ddlZddlmZGddeZdS)N)StemmerIc&eZdZdZddZdZdZdS) 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 rcjt|dstj|}||_||_dS)Npattern)hasattrrecompile_regexp_min)selfregexpmins D/var/www/piapp/venv/lib/python3.11/site-packages/nltk/stem/regexp.py__init__zRegexpStemmer.__init__*s5vy)) (Z''F  clt||jkr|S|jd|S)N)lenr r sub)r words rstemzRegexpStemmer.stem1s2 t99ty K<##B-- -rc"d|jjdS)Nz)r r)r s r__repr__zRegexpStemmer.__repr__7s;$,"6;;;;rN)r)__name__ __module__ __qualname____doc__rrrrrrrsP6... <<<<r"sV """"""*<*<*<*<*