pub struct TextRankSummarizer {
pub damping: f64,
pub n_iterations: usize,
pub similarity: SentenceSimilarity,
}Expand description
Extractive summariser based on the TextRank algorithm.
Sentences are represented as graph nodes; edges are weighted by sentence similarity. PageRank is run to score each sentence.
Fields§
§damping: f64PageRank damping factor.
n_iterations: usizeNumber of PageRank iterations.
similarity: SentenceSimilaritySimilarity metric used to weight graph edges.
Implementations§
Source§impl TextRankSummarizer
impl TextRankSummarizer
Sourcepub fn new(
damping: f64,
n_iterations: usize,
similarity: SentenceSimilarity,
) -> Self
pub fn new( damping: f64, n_iterations: usize, similarity: SentenceSimilarity, ) -> Self
Create a summariser with custom parameters.
Trait Implementations§
Source§impl Clone for TextRankSummarizer
impl Clone for TextRankSummarizer
Source§fn clone(&self) -> TextRankSummarizer
fn clone(&self) -> TextRankSummarizer
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for TextRankSummarizer
impl Debug for TextRankSummarizer
Auto Trait Implementations§
impl Freeze for TextRankSummarizer
impl RefUnwindSafe for TextRankSummarizer
impl Send for TextRankSummarizer
impl Sync for TextRankSummarizer
impl Unpin for TextRankSummarizer
impl UnsafeUnpin for TextRankSummarizer
impl UnwindSafe for TextRankSummarizer
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
Mutably borrows from an owned value. Read more
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>
Converts
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>
Converts
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.