Dashboard
PHP:
8.2.30
OS:
Linux
User:
dh_nv8b2m
/
/
usr
/
lib
/
python3
/
dist-packages
/
sphinx
/
util
/
stemmer
/
__pycache__
📤 Upload
📝 New File
📁 New Folder
Close
Editing: porter.cpython-310.pyc
o �$�a�4 � @ s d Z G dd� d�ZdS )a sphinx.util.stemmer.porter ~~~~~~~~~~~~~~~~~~~~~~~~~~ Porter Stemming Algorithm This is the Porter stemming algorithm, ported to Python from the version coded up in ANSI C by the author. It may be be regarded as canonical, in that it follows the algorithm presented in Porter, 1980, An algorithm for suffix stripping, Program, Vol. 14, no. 3, pp 130-137, only differing from it at the points made --DEPARTURE-- below. See also https://tartarus.org/martin/PorterStemmer/ The algorithm as described in the paper could be exactly replicated by adjusting the points of DEPARTURE, but this is barely necessary, because (a) the points of DEPARTURE are definitely improvements, and (b) no encoding of the Porter stemmer I have seen is anything like as exact as this version, even with the points of DEPARTURE! Release 1: January 2001 :copyright: Copyright 2001 by Vivake Gupta <v@nano.com>. :license: Public Domain ("can be used free of charge for any purpose"). c @ s� e Zd Zd'dd�Zdedefdd�Zdefdd �Zdefd d �Zd edefd d�Zdedefdd�Z de defdd�Z de ddfdd�Z de ddfdd�Z d'dd�Zd'dd�Zd'd d �Zd'd d �Zd'd d!�Zd'd"d#�Zd$e ded ede fd%d&�ZdS )(� PorterStemmer�returnNc C s d| _ d| _d| _d| _dS )a� The main part of the stemming algorithm starts here. b is a buffer holding a word to be stemmed. The letters are in b[k0], b[k0+1] ... ending at b[k]. In fact k0 = 0 in this demo program. k is readjusted downwards as the stemming progresses. Zero termination is not in fact used in the algorithm. Note that only lower case sequences are stemmed. Forcing to lower case should be done before stem(...) is called. � � N)�b�k�k0�j��self� r �</usr/lib/python3/dist-packages/sphinx/util/stemmer/porter.py�__init__! s zPorterStemmer.__init__�ic C sz | j | dks#| j | dks#| j | dks#| j | dks#| j | dkr%dS | j | dkr;|| jkr3dS | �|d � S dS ) z(cons(i) is TRUE <=> b[i] is a consonant.�a�er �o�ur �y� )r r �cons�r r r r r r 1 s * zPorterStemmer.consc C s� d}| j } || jkr |S | �|�sn|d }q|d } || jkr%|S | �|�r+n|d }q |d }|d } || jkr@|S | �|�sFn|d }q9|d }q )aF m() measures the number of consonant sequences between k0 and j. if c is a consonant sequence and v a vowel sequence, and <..> indicates arbitrary presence, <c><v> gives 0 <c>vc<v> gives 1 <c>vcvc<v> gives 2 <c>vcvcvc<v> gives 3 .... r r )r r r )r �nr r r r �m= s: � � ��zPorterStemmer.mc C s, t | j| jd �D ] }| �|�s dS q dS )z2vowelinstem() is TRUE <=> k0,...j contains a vowelr r )�ranger r r r r r r � vowelinstemb s �zPorterStemmer.vowelinstemr c C s8 || j d k r dS | j| | j|d krdS | �|�S )z:doublec(j) is TRUE <=> j,(j-1) contain a double consonant.r r )r r r )r r r r r �doubleci s zPorterStemmer.doublecc C sb || j d k s| �|�r| �|d �s| �|d �s dS | j| }|dks-|dks-|dkr/dS dS )a) cvc(i) is TRUE <=> i-2,i-1,i has the form consonant - vowel - consonant and also if the second c is not w,x or y. this is used when trying to restore an e at the end of a short e.g. cav(e), lov(e), hop(e), crim(e), but snow, box, tray. � r r �w�xr )r r r )r r �chr r r �cvcq s & � zPorterStemmer.cvc�sc C sr t |�}||d | j| j krdS || j| j d kr dS | j| j| d | jd � |kr1dS | j| | _dS )z3ends(s) is TRUE <=> k0,...k ends with the string s.r r )�lenr r r r �r r! �lengthr r r �ends� s " zPorterStemmer.endsc C sJ t |�}| jd| jd � | | j| j| d d� | _| j| | _dS )zRsetto(s) sets (j+1),...k to the characters in the string s, readjusting k.Nr )r" r r r r# r r r �setto� s 2zPorterStemmer.settoc C s | � � dkr | �|� dS dS )zr(s) is used further down.r N)r r& )r r! r r r �r� s �zPorterStemmer.rc C sz | j | j dkr/| �d�r| jd | _n| �d�r | �d� n| j | jd dkr/| jd | _| �d�rD| �� dkrB| jd | _dS dS | �d �sN| �d �r�| �� r�| j| _| �d �rb| �d � dS | �d �rn| �d� dS | �d�rz| �d� dS | �| j�r�| jd | _| j | j }|dks�|dks�|dkr�| jd | _dS dS | �� dkr�| �| j�r�| �d� dS dS dS dS dS )a� step1ab() gets rid of plurals and -ed or -ing. e.g. caresses -> caress ponies -> poni ties -> ti caress -> caress cats -> cat feed -> feed agreed -> agree disabled -> disable matting -> mat mating -> mate meeting -> meet milling -> mill messing -> mess meetings -> meet r! �ssesr �iesr r �eedr �ed�ing�at�ate�bl�ble�iz�ize�l�zr N) r r r% r& r r r r r )r r r r r �step1ab� s: � �� zPorterStemmer.step1abc C sH | � d�r | �� r"| jd| j� d | j| jd d� | _dS dS dS )zOstep1c() turns terminal y to i when there is another vowel in the stem.r Nr r )r% r r r r r r r �step1c� s .�zPorterStemmer.step1cc C s� | j | jd dkr$| �d�r| �d� d+S | �d�r"| �d� d+S d+S | j | jd dkrH| �d�r:| �d � d+S | �d �rF| �d � d+S d+S | j | jd d kr`| �d �r^| �d� d+S d+S | j | jd dkr�| �d�rv| �d� d+S | �d�r�| �d� d+S | �d�r�| �d� d+S | �d�r�| �d � d+S | �d�r�| �d� d+S d+S | j | jd dkr�| �d�r�| �d� d+S | �d�r�| �d� d+S | �d �r�| �d� d+S d+S | j | jd d k�r| �d �r�| �d� d+S | �d �r�| �d � d+S | �d!��r| �d"� d+S | �d#��r| �d� d+S d+S | j | jd d$k�rK| �d%��r/| �d� d+S | �d&��r<| �d � d+S | �d'��rI| �d� d+S d+S | j | jd d(k�rc| �d)��re| �d*� d+S d+S d+S ),z�step2() maps double suffices to single ones. so -ization ( = -ize plus -ation) maps to -ize etc. note that the string before the suffix must give m() > 0. r r �ationalr. �tional�tion�c�enci�ence�anci�ancer �izerr2 r3 �blir0 �alli�al�entli�ent�eli�ousli�ousr �ization�ation�atorr! �alism�iveness�ive�fulness�ful�ousness�t�aliti�iviti�biliti�g�logi�logN�r r r% r' r r r r �step2� sv � � � � � � � �zPorterStemmer.step2c C s� | j | j dkr.| �d�r| �d� dS | �d�r | �d� dS | �d�r,| �d� dS dS | j | j dkrD| �d �rB| �d� dS dS | j | j d krf| �d �rX| �d� dS | �d �rd| �d� dS dS | j | j d krz| �d�r|| �d� dS dS dS )zLstep3() dels with -ic-, -full, -ness etc. similar strategy to step2.r �icate�ic�ativer �alizerB r �icitir3 �icalrO r! �nessNrX r r r r �step3 s. � � � �zPorterStemmer.step3c C sP | j | jd dkr| �d�r�ndS | j | jd dkr+| �d�r#n�| �d�r)n�dS | j | jd dkr=| �d �r;n�dS | j | jd d krO| �d �rMn�dS | j | jd d krg| �d �r_n�| �d�ren�dS | j | jd dkr�| �d�rwn�| �d�r}n�| �d�r�n�| �d�r�n�dS | j | jd dkr�| �d�r�| j | j dks�| j | j dkr�nn| �d�r�nhdS | j | jd dkr�| �d�r�nVdS | j | jd dkr�| �d�r�nD| �d�r�n>dS | j | jd d kr�| �d �r�n,dS | j | jd d k�r| �d ��rndS | j | jd d k�r| �d!��rndS dS | �� dk�r&| j| _dS dS )"z:step4() takes off -ant, -ence etc., in context <c>vcvc<v>.r r rB Nr: r> r< r �err r[ r3 �able�ibler �ant�ement�mentrD r �ionr! rQ �ou�ismr. �itir rG �vrM r4 r2 )r r r% r r r r r r �step4 s� �zPorterStemmer.step4c C s� | j | _| j| j dkr&| �� }|dks |dkr&| �| j d �s&| j d | _ | j| j dkrB| �| j �rD| �� dkrF| j d | _ dS dS dS dS )zYstep5() removes a final -e if m() > 1, and changes -ll to -l if m() > 1. r r r3 N)r r r r r r )r r r r r �step5s s ( �zPorterStemmer.step5�pc C sn || _ || _|| _| j| jd kr| j S | �� | �� | �� | �� | �� | �� | j | j| jd � S )a� In stem(p,i,j), p is a char pointer, and the string to be stemmed is from p[i] to p[j] inclusive. Typically i is zero and j is the offset to the last character of a string, (p[j+1] == ' '). The stemmer adjusts the characters p[i] ... p[j] and returns the new end-point of the string, k. Stemming never increases word length, so i <= k <= j. To turn the stemmer into a module, declare 'stem' as extern, and delete the remainder of this file. r ) r r r r5 r6 rY ra rm rn )r ro r r r r r �stem s zPorterStemmer.stem)r N)�__name__� __module__� __qualname__r �intr r r r r �strr% r& r' r5 r6 rY ra rm rn rp r r r r r s" % / ; S r N)�__doc__r r r r r �<module> s
Save
Cancel