:j.ddlZddlmZGddeZy)N)StemmerIc$eZdZdZddZdZdZy) 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 cbt|dstj|}||_||_y)Npattern)hasattrrecompile_regexp_min)selfregexpmins e/home/mcse/projects/srt_converter/srt-converter-venv/lib/python3.12/site-packages/nltk/stem/regexp.py__init__zRegexpStemmer.__init__*s(vy)ZZ'F  cnt||jkr|S|jjd|S)N)lenr r sub)r words rstemzRegexpStemmer.stem0s. t9tyy K<<##B- -rc6d|jjdS)Nz)r r)r s r__repr__zRegexpStemmer.__repr__6s!$,,"6"6!9;;rN)r)__name__ __module__ __qualname____doc__rrrrrrrs6 . r"s ")