;ih ddlmZddlZddlmZmZmZddlmZm Z gdZ dZ eddddddZ edddddd Z edd dddd d Zd ZdZe dddddddddZe dddddddddZdS)) annotationsN) ScorerFlagis_none setupPandas)WRatioratio)cdistextract extractOne extract_itercht|dd}||ddi|}|d|dfSdS)N _RF_ScorerPyget_scorer_flags worst_score optimal_score)rd)getattrscorer scorer_kwargsparamsflagss HC:\PYTHON\MyICR_Workspace\venv\Lib\site-packages\rapidfuzz/process_py.py_get_scorer_flags_pyr sN V^T 2 2F *)*;;];;m$eO&<== 8)r processor score_cutoff score_hintrc#K|}|pi}t||\}} | |k} tt|rdS||}| ||}t|dr|nt |} | D]V\} } t| r| ||| fd|i|}n|||| fd|i|}| r||kr| || fVI||kr| || fVWdS)aI Find the best match in a list of choices Parameters ---------- query : Sequence[Hashable] string we want to find choices : Iterable[Sequence[Hashable]] | Mapping[Sequence[Hashable]] list of all strings the query should be compared with or dict with a mapping {: } scorer : Callable, optional Optional callable that is used to calculate the matching score between the query and each choice. This can be any of the scorers included in RapidFuzz (both scorers that calculate the edit distance or the normalized edit distance), or a custom function, which returns a normalized edit distance. fuzz.WRatio is used by default. processor : Callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : Any, optional Optional argument for a score threshold. When an edit distance is used this represents the maximum edit distance and matches with a `distance > score_cutoff` are ignored. When a normalized edit distance is used this represents the minimal similarity and matches with a `similarity < score_cutoff` are ignored. Default is None, which deactivates this behaviour. score_hint : Any, optional Optional argument for an expected score to be passed to the scorer. This is used to select a faster implementation. Default is None, which deactivates this behaviour. scorer_kwargs : dict[str, Any], optional any other named parameters are passed to the scorer. This can be used to pass e.g. weights to `Levenshtein.distance` Yields ------- tuple[Sequence[Hashable], Any, Any] Yields similarity between the query and each choice in form of a Tuple with 3 elements. The values stored in the tuple depend on the types of the input arguments. * The first element is always the current `choice`, which is the value that's compared to the query. * The second value represents the similarity calculated by the scorer. This can be: * An edit distance (distance is 0 for a perfect match and > 0 for non perfect matches). In this case only choices which have a `distance <= score_cutoff` are yielded. An example of a scorer with this behavior is `Levenshtein.distance`. * A normalized edit distance (similarity is a score between 0 and 100, with 100 being a perfect match). In this case only choices which have a `similarity >= score_cutoff` are yielded. An example of a scorer with this behavior is `Levenshtein.normalized_similarity`. Note, that for all scorers, which are not provided by RapidFuzz, only normalized edit distances are supported. * The third parameter depends on the type of the `choices` argument it is: * The `index of choice` when choices is a simple iterable like a list * The `key of choice` when choices is a mapping like a dict, or a pandas Series Nitemsrrrrhasattrr! enumerate)querychoicesrrrrr_rrlowest_score_worst choices_iterkeychoicescores rr r ssF A!'RM!5fm!L!LK&4MMMu~~"  %  &-gw&?&?W7==???YwEWEWL#++ V 6??    F5&UU|U}UUEEF &!!* E  + $$uc**** $$uc****'++rc|}|pi}t||\}} | |k} tt|rdS||}| ||}d} t|dr|nt |} | D]z\} }t|r| |||fd|i|}n||||fd|i|}| r||kr| || dkr|}||| f} n||kr| || dkr|}||| f} || krn{| S)a Find the best match in a list of choices. When multiple elements have the same similarity, the first element is returned. Parameters ---------- query : Sequence[Hashable] string we want to find choices : Iterable[Sequence[Hashable]] | Mapping[Sequence[Hashable]] list of all strings the query should be compared with or dict with a mapping {: } scorer : Callable, optional Optional callable that is used to calculate the matching score between the query and each choice. This can be any of the scorers included in RapidFuzz (both scorers that calculate the edit distance or the normalized edit distance), or a custom function, which returns a normalized edit distance. fuzz.WRatio is used by default. processor : Callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : Any, optional Optional argument for a score threshold. When an edit distance is used this represents the maximum edit distance and matches with a `distance > score_cutoff` are ignored. When a normalized edit distance is used this represents the minimal similarity and matches with a `similarity < score_cutoff` are ignored. Default is None, which deactivates this behaviour. score_hint : Any, optional Optional argument for an expected score to be passed to the scorer. This is used to select a faster implementation. Default is None, which deactivates this behaviour. scorer_kwargs : dict[str, Any], optional any other named parameters are passed to the scorer. This can be used to pass e.g. weights to `Levenshtein.distance` Returns ------- tuple[Sequence[Hashable], Any, Any] Returns the best match in form of a Tuple with 3 elements. The values stored in the tuple depend on the types of the input arguments. * The first element is always the `choice`, which is the value that's compared to the query. * The second value represents the similarity calculated by the scorer. This can be: * An edit distance (distance is 0 for a perfect match and > 0 for non perfect matches). In this case only choices which have a `distance <= score_cutoff` are returned. An example of a scorer with this behavior is `Levenshtein.distance`. * A normalized edit distance (similarity is a score between 0 and 100, with 100 being a perfect match). In this case only choices which have a `similarity >= score_cutoff` are returned. An example of a scorer with this behavior is `Levenshtein.normalized_similarity`. Note, that for all scorers, which are not provided by RapidFuzz, only normalized edit distances are supported. * The third parameter depends on the type of the `choices` argument it is: * The `index of choice` when choices is a simple iterable like a list * The `key of choice` when choices is a mapping like a dict, or a pandas Series None When no choice has a `similarity >= score_cutoff`/`distance <= score_cutoff` None is returned Examples -------- >>> from rapidfuzz.process import extractOne >>> from rapidfuzz.distance import Levenshtein >>> from rapidfuzz.fuzz import ratio extractOne can be used with normalized edit distances. >>> extractOne("abcd", ["abce"], scorer=ratio) ("abcd", 75.0, 1) >>> extractOne("abcd", ["abce"], scorer=Levenshtein.normalized_similarity) ("abcd", 0.75, 1) extractOne can be used with edit distances as well. >>> extractOne("abcd", ["abce"], scorer=Levenshtein.distance) ("abce", 1, 0) additional settings of the scorer can be passed via the scorer_kwargs argument to extractOne >>> extractOne("abcd", ["abce"], scorer=Levenshtein.distance, scorer_kwargs={"weights":(1,1,2)}) ("abcde", 2, 1) when a mapping is used for the choices the key of the choice is returned instead of the List index >>> extractOne("abcd", {"key": "abce"}, scorer=ratio) ("abcd", 75.0, "key") It is possible to specify a processor function which is used to preprocess the strings before comparing them. >>> extractOne("abcd", ["abcD"], scorer=ratio) ("abcD", 75.0, 0) >>> extractOne("abcd", ["abcD"], scorer=ratio, processor=utils.default_process) ("abcD", 100.0, 0) >>> extractOne("abcd", ["abcD"], scorer=ratio, processor=lambda s: s.upper()) ("abcD", 100.0, 0) When only results with a similarity above a certain threshold are relevant, the parameter score_cutoff can be used to filter out results with a lower similarity. This threshold is used by some of the scorers to exit early, when they are sure, that the similarity is below the threshold. For normalized edit distances all results with a similarity below score_cutoff are filtered out >>> extractOne("abcd", ["abce"], scorer=ratio) ("abce", 75.0, 0) >>> extractOne("abcd", ["abce"], scorer=ratio, score_cutoff=80) None For edit distances all results with an edit distance above the score_cutoff are filtered out >>> extractOne("abcd", ["abce"], scorer=Levenshtein.distance, scorer_kwargs={"weights":(1,1,2)}) ("abce", 2, 0) >>> extractOne("abcd", ["abce"], scorer=Levenshtein.distance, scorer_kwargs={"weights":(1,1,2)}, score_cutoff=1) None Nr!rr")r%r&rrrrrr'rrr(resultr)r*r+r,s rr r s| A!'RM!5fm!L!LK&4MMMu~~t"  %   F&-gw&?&?W7==???YwEWEWL# V 6??    F5&UU|U}UUEEF &!!* E  . $$&.EF1I: } scorer : Callable, optional Optional callable that is used to calculate the matching score between the query and each choice. This can be any of the scorers included in RapidFuzz (both scorers that calculate the edit distance or the normalized edit distance), or a custom function, which returns a normalized edit distance. fuzz.WRatio is used by default. processor : Callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. limit : int, optional maximum amount of results to return. None can be passed to disable this behavior. Default is 5. score_cutoff : Any, optional Optional argument for a score threshold. When an edit distance is used this represents the maximum edit distance and matches with a `distance > score_cutoff` are ignored. When a normalized edit distance is used this represents the minimal similarity and matches with a `similarity < score_cutoff` are ignored. Default is None, which deactivates this behaviour. score_hint : Any, optional Optional argument for an expected score to be passed to the scorer. This is used to select a faster implementation. Default is None, which deactivates this behaviour. scorer_kwargs : dict[str, Any], optional any other named parameters are passed to the scorer. This can be used to pass e.g. weights to `Levenshtein.distance` Returns ------- list[tuple[Sequence[Hashable], Any, Any]] The return type is always a List of Tuples with 3 elements. However the values stored in the tuple depend on the types of the input arguments. * The first element is always the `choice`, which is the value that's compared to the query. * The second value represents the similarity calculated by the scorer. This can be: * An edit distance (distance is 0 for a perfect match and > 0 for non perfect matches). In this case only choices which have a `distance <= score_cutoff` are returned. An example of a scorer with this behavior is `Levenshtein.distance`. * A normalized edit distance (similarity is a score between 0 and 100, with 100 being a perfect match). In this case only choices which have a `similarity >= score_cutoff` are returned. An example of a scorer with this behavior is `Levenshtein.normalized_similarity`. Note, that for all scorers, which are not provided by RapidFuzz, only normalized edit distances are supported. * The third parameter depends on the type of the `choices` argument it is: * The `index of choice` when choices is a simple iterable like a list * The `key of choice` when choices is a mapping like a dict, or a pandas Series The list is sorted by similarity or distance depending on the scorer used. The first element in the list has the `highest similarity`/`smallest distance`. r.)rrrrrNc|dSNr.ris rzextract..s 1r)r*reversec|dSr4rr5s rr7zextract..s !r)r*c|dSr4rr5s rr7zextract..s QqTr)rr r sortedheapqnlargest nsmallest) r%r&rrr1rrrrrr(res result_iters rr r /sV"'RM!5fm!L!LK&4 zz  %!'    ;Iu  !#K }k~~?QRRRRF~e[nnEEEE ?5+>> B B BBrcddl}|||St|dd}|M|ddi|}|dtjzr|jS|dtjzr|jS|jS|jS)Nrrrrr) numpydtyperr RESULT_I64int32 RESULT_SIZE_Tuint32float32)rCrrnprrs r_dtype_to_type_numrJs  xx V^T 2 2F *)*;;];; >J1 1 8O >J4 4 9 z :rcvt|dd}|%|ddi|}|dtjzrdSdS)NrrrTFr)rr SYMMETRICrs r _is_symmetricrMsR V^T 2 2F *)*;;];; >J0 0 4 5rr.)rrrrscore_multiplierrCworkersrcddl} ||f} | pi} t||| }| t|t|f|} t t |} nfd|D} ||urt || rt| D]\}}|||fd|i| |z}| || j rt|}|| ||f<t|dzt| D]O}||| |fd|i| |z}| || j rt|}|x| ||f<| ||f<Pnt|D]x\}}rt|s |n|}t| D]E\}}|||fd|i| |z}| || j rt|}|| ||f<Fy| S)a Compute distance/similarity between each pair of the two collections of inputs. Parameters ---------- queries : Collection[Sequence[Hashable]] list of all strings the queries choices : Collection[Sequence[Hashable]] list of all strings the query should be compared scorer : Callable, optional Optional callable that is used to calculate the matching score between the query and each choice. This can be any of the scorers included in RapidFuzz (both scorers that calculate the edit distance or the normalized edit distance), or a custom function, which returns a normalized edit distance. fuzz.ratio is used by default. processor : Callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : Any, optional Optional argument for a score threshold to be passed to the scorer. Default is None, which deactivates this behaviour. score_hint : Any, optional Optional argument for an expected score to be passed to the scorer. This is used to select a faster implementation. Default is None, which deactivates this behaviour. score_multiplier: Any, optional Optional argument to multiply the calculated score with. This is applied as the final step, so e.g. score_cutoff is applied on the unmodified score. This is mostly useful to map from a floating point range to an integer to reduce the memory usage. Default is 1, which deactivates this behaviour. dtype : data-type, optional The desired data-type for the result array. Depending on the scorer type the following dtypes are supported: - similarity: - np.float32, np.float64 - np.uint8 -> stores fixed point representation of the result scaled to a range 0-100 - distance: - np.int8, np.int16, np.int32, np.int64 If not given, then the type will be np.float32 for similarities and np.int32 for distances. workers : int, optional The calculation is subdivided into workers sections and evaluated in parallel. Supply -1 to use all available CPU cores. This argument is only available for scorers using the RapidFuzz C-API so far, since it releases the Python GIL. scorer_kwargs : dict[str, Any], optional any other named parameters are passed to the scorer. This can be used to pass e.g. weights to `Levenshtein.distance` Returns ------- ndarray Returns a matrix of dtype with the distance/similarity between each pair of the two collections of inputs. rNrCcHg|]}t|r|n |Sr)r).0xrs r zcdist..s0KKKaWQZZ9YYq\\KKKrrr.) rBrJzeroslenrlistrMr$ issubdtypeintegerroundranger)queriesr&rrrrrNrCrOrrIr'results proc_choicesr6 proc_queryr,jr%r+s ` rr r sJA!'RM ufm < stores fixed point representation of the result scaled to a range 0-100 - distance: - np.int8, np.int16, np.int32, np.int64 If not given, then the type will be np.float32 for similarities and np.int32 for distances. workers : int, optional The calculation is subdivided into workers sections and evaluated in parallel. Supply -1 to use all available CPU cores. This argument is only available for scorers using the RapidFuzz C-API so far, since it releases the Python GIL. scorer_kwargs : dict[str, Any], optional any other named parameters are passed to the scorer. This can be used to pass e.g. weights to `Levenshtein.distance` Returns ------- ndarray Returns a matrix of size (n x 1) of dtype with the distance/similarity between each pair of the two collections of inputs. rNz/Length of queries and choices must be the same!rQr) rBrW ValueErrorrJrVrr$ziprrYrZr[)r]r&rrrrrNrCrOrrI len_queries len_choices error_messager'r^r6r%r+r` proc_choicer,s rcpdistri>srJg,,Kg,,Kk!!I '''A!'RM ufm < >?E6*3VGENNVYYu%%%QV ,5ZgfooZii'''TZ     &     !! == + + !%LLE Nr) __future__rr<rapidfuzz._utilsrrrrapidfuzz.fuzzrr__all__rr r r rJrMr rirrrrns#""""" ==========(((((((( < < < h+h+h+h+h+^ lllllf  lClClClClC^,   }}}}}H   iiiiiiir