pub struct SemanticDiversifier {
pub config: DiversifierConfig,
/* private fields */
}Expand description
Diversifies a ranked list of candidates using Maximal Marginal Relevance.
Each call to select greedily picks items
that simultaneously maximise relevance to the query and minimise similarity
to previously selected items.
Fields§
§config: DiversifierConfigMMR configuration (lambda, etc.).
Implementations§
Source§impl SemanticDiversifier
impl SemanticDiversifier
Sourcepub fn new(config: DiversifierConfig) -> Self
pub fn new(config: DiversifierConfig) -> Self
Create a new diversifier with the given configuration.
Sourcepub fn select(
&mut self,
_query: &[f32],
candidates: Vec<DiversificationCandidate>,
k: usize,
) -> Vec<DiversifiedResult>
pub fn select( &mut self, _query: &[f32], candidates: Vec<DiversificationCandidate>, k: usize, ) -> Vec<DiversifiedResult>
Select up to k diversified results from candidates using MMR.
The algorithm greedily builds a selected set S, starting from empty.
Each iteration scores every remaining candidate with:
mmr = lambda * relevance_score - (1 - lambda) * max_sim_to_selectedTies are broken by doc_id ascending.
Returns an empty Vec when candidates is empty or k == 0.
Sourcepub fn stats(&self) -> &DiversifierStats
pub fn stats(&self) -> &DiversifierStats
Return a reference to the accumulated statistics.
Sourcepub fn set_lambda(&mut self, lambda: f32)
pub fn set_lambda(&mut self, lambda: f32)
Override the lambda trade-off parameter, clamped to [0.0, 1.0].
Auto Trait Implementations§
impl Freeze for SemanticDiversifier
impl RefUnwindSafe for SemanticDiversifier
impl Send for SemanticDiversifier
impl Sync for SemanticDiversifier
impl Unpin for SemanticDiversifier
impl UnsafeUnpin for SemanticDiversifier
impl UnwindSafe for SemanticDiversifier
Blanket Implementations§
impl<T> Allocation for T
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.