Enum Strategy 

pub enum Strategy {
    ForwardMaxMatch,
    BiMaxMatch,
    UnigramDp,
}

Which segmentation algorithm KhmerTokenizer::segment uses.

Set at construction with KhmerTokenizer::with_strategy.

Variants

ForwardMaxMatch

Greedy longest-match, left to right. Fast, deterministic — the long-standing default.

BiMaxMatch

Bidirectional maximum matching: runs forward and backward max-match and picks between them on disagreement — fewer tokens wins; ties broken by fewer single-cluster tokens; a remaining tie favors the forward result. The canonical tie-break from Bi & Taing (APSIPA 2014); see docs/RESEARCH-2.md §3b.

UnigramDp

Unigram max-probability path (jieba-style): builds a DAG of every dictionary match over the cluster run, then dynamic-programs right-to-left for the path with the highest cumulative log-probability, using word frequencies set with KhmerTokenizer::with_frequencies. Falls back to Strategy::ForwardMaxMatch if no frequencies were set — there’s nothing to score without them.

Trait Implementations

impl Clone for Strategy

fn clone(&self) -> Strategy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Strategy

impl Debug for Strategy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Strategy

fn default() -> Strategy

Returns the “default value” for a type.

impl Eq for Strategy

impl PartialEq for Strategy

fn eq(&self, other: &Strategy) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Strategy