o rZh@s(ddlZddlmZGdddeZdS)N)StemmerIc@s*eZdZdZd ddZddZddZd 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|ds t|}||_||_dS)Npattern)hasattrrecompile_regexp_min)selfregexpminr ?/var/www/auris/lib/python3.10/site-packages/nltk/stem/regexp.py__init__*s   zRegexpStemmer.__init__cCs t||jkr |S|jd|S)N)lenr rsub)r wordr r rstem0szRegexpStemmer.stemcCsd|jjdS)Nz)rr)r r r r__repr__6szRegexpStemmer.__repr__N)r)__name__ __module__ __qualname____doc__rrrr r r rrs   r)rZ nltk.stem.apirrr r r rs