Struct SemanticSynonymExpander 

pub struct SemanticSynonymExpander {
    pub graph: HashMap<String, Vec<SynonymEdge>>,
    pub config: ExpanderConfig,
    pub stats: SynonymExpanderStats,
}

Synonym graph for vocabulary expansion in semantic search.

Maintains a weighted directed adjacency list; add_synonym automatically inserts bidirectional edges with correctly mirrored relationship types.

Fields

graph: HashMap<String, Vec<SynonymEdge>>

Adjacency list: term → list of outgoing synonym edges.

config: ExpanderConfig

Expander configuration.

stats: SynonymExpanderStats

Runtime statistics.

Implementations

impl SemanticSynonymExpander

pub fn new(config: ExpanderConfig) -> Self

Create a new expander with the given configuration.

pub fn add_synonym( &mut self, from: &str, to: &str, relation: SynonymRelation, weight: f32, )

Add a bidirectional synonym edge between from and to.

The reverse edge uses the mirrored relation:

• Broader ↔ Narrower
• Exact ↔ Exact
• Near ↔ Near

Duplicate edges (same target + same relation) are silently skipped; stats.total_edges is incremented only for edges actually inserted.

pub fn expand( &mut self, term: &str, allowed_relations: Option<&[SynonymRelation]>, ) -> Vec<ExpandedTerm>

BFS expansion from term up to config.max_hops hops.

Only follows edges whose weight >= config.min_weight and whose relation is in allowed_relations (if Some). Results are sorted by cumulative_weight descending, then alphabetically by term, and truncated to config.max_expansions.

pub fn remove_term(&mut self, term: &str)

Remove term from the graph and all incoming edges from other nodes.

pub fn stats(&self) -> &SynonymExpanderStats

Return a reference to the current statistics.

pub fn term_count(&self) -> usize

Return the number of unique terms currently in the graph.