pub struct TfIdfVectorizer { /* private fields */ }
Expand description
Simlar to CountVectorizer
but instead of
just counting the term frequency of each vocabulary entry in each given document,
it computes the term frequecy times the inverse document frequency, thus giving more importance
to entries that appear many times but only on some documents. The weight function can be adjusted
by setting the appropriate method. This struct provides the same string
processing customizations described in CountVectorizer
.
Implementations§
Source§impl TfIdfVectorizer
impl TfIdfVectorizer
pub fn tokenizer(self, tokenizer: Tokenizer) -> Self
Sourcepub fn max_features(self, max_features: Option<usize>) -> Self
pub fn max_features(self, max_features: Option<usize>) -> Self
When building the vocabulary, only consider the top max_features (by term frequency). If None, all features are used.
Sourcepub fn convert_to_lowercase(self, convert_to_lowercase: bool) -> Self
pub fn convert_to_lowercase(self, convert_to_lowercase: bool) -> Self
If true, all documents used for fitting will be converted to lowercase.
Sourcepub fn n_gram_range(self, min_n: usize, max_n: usize) -> Self
pub fn n_gram_range(self, min_n: usize, max_n: usize) -> Self
If set to (1,1)
single tokens will be candidate vocabulary entries, if (2,2)
then adjacent token pairs will be considered,
if (1,2)
then both single tokens and adjacent token pairs will be considered, and so on. The definition of token depends on the
regex used fpr splitting the documents.
min_n
should not be greater than max_n
Sourcepub fn normalize(self, normalize: bool) -> Self
pub fn normalize(self, normalize: bool) -> Self
If true, all charachters in the documents used for fitting will be normalized according to unicode’s NFKD normalization.
Sourcepub fn document_frequency(self, min_freq: f32, max_freq: f32) -> Self
pub fn document_frequency(self, min_freq: f32, max_freq: f32) -> Self
Specifies the minimum and maximum (relative) document frequencies that each vocabulary entry must satisfy.
min_freq
and max_freq
must lie in 0..=1
and min_freq
should not be greater than max_freq
Sourcepub fn stopwords<T: ToString>(self, stopwords: &[T]) -> Self
pub fn stopwords<T: ToString>(self, stopwords: &[T]) -> Self
List of entries to be excluded from the generated vocabulary.
Sourcepub fn fit<T: ToString + Clone, D: Data<Elem = T>>(
&self,
x: &ArrayBase<D, Ix1>,
) -> Result<FittedTfIdfVectorizer>
pub fn fit<T: ToString + Clone, D: Data<Elem = T>>( &self, x: &ArrayBase<D, Ix1>, ) -> Result<FittedTfIdfVectorizer>
Learns a vocabulary from the texts in x
, according to the specified attributes and maps each
vocabulary entry to an integer value, producing a FittedTfIdfVectorizer.
Returns an error if:
- one of the
n_gram
boundaries is set to zero or the minimum value is greater than the maximum value - if the minimum document frequency is greater than one or than the maximum frequency, or if the maximum frequecy is
smaller than zero
Sourcepub fn fit_vocabulary<T: ToString>(
&self,
words: &[T],
) -> Result<FittedTfIdfVectorizer>
pub fn fit_vocabulary<T: ToString>( &self, words: &[T], ) -> Result<FittedTfIdfVectorizer>
Produces a FittedTfIdfVectorizer with the input vocabulary.
All struct attributes are ignored in the fitting but will be used by the FittedTfIdfVectorizer
to transform any text to be examined. As such this will return an error in the same cases as the fit
method.
pub fn fit_files<P: AsRef<Path>>( &self, input: &[P], encoding: EncodingRef, trap: DecoderTrap, ) -> Result<FittedTfIdfVectorizer>
Trait Implementations§
Source§impl Clone for TfIdfVectorizer
impl Clone for TfIdfVectorizer
Source§fn clone(&self) -> TfIdfVectorizer
fn clone(&self) -> TfIdfVectorizer
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for TfIdfVectorizer
impl Debug for TfIdfVectorizer
Auto Trait Implementations§
impl !Freeze for TfIdfVectorizer
impl !RefUnwindSafe for TfIdfVectorizer
impl Send for TfIdfVectorizer
impl !Sync for TfIdfVectorizer
impl Unpin for TfIdfVectorizer
impl UnwindSafe for TfIdfVectorizer
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.