rustfst 1.3.0

Library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs).
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

use anyhow::Result;
use serde::{Deserialize, Serialize};

use crate::algorithms::shortest_distance;
use crate::fst_traits::{MutableFst, SerializableFst};
use crate::semirings::SerializableSemiring;
use crate::semirings::WeaklyDivisibleSemiring;
use crate::semirings::WeightQuantize;
use crate::tests_openfst::FstTestData;

#[derive(Serialize, Deserialize, Debug)]
pub struct ShorestDistanceOperationResult {
    reverse: bool,
    result: Vec<String>,
}

#[derive(Debug)]
pub struct ShortestDistanceTestData<W> {
    reverse: bool,
    result: Vec<W>,
}

impl ShorestDistanceOperationResult {
    pub fn parse<W: SerializableSemiring>(&self) -> ShortestDistanceTestData<W> {
        let r = self
            .result
            .iter()
            .map(|v| {
                let (_, w) = W::parse_text(v.as_str()).unwrap();
                w
            })
            .collect();
        ShortestDistanceTestData {
            result: r,
            reverse: self.reverse,
        }
    }
}

pub fn test_shortest_distance<W, F>(test_data: &FstTestData<W, F>) -> Result<()>
where
    F: SerializableFst<W> + MutableFst<W>,
    W: SerializableSemiring + WeaklyDivisibleSemiring + WeightQuantize,
{
    for data in &test_data.shortest_distance {
        let distance = shortest_distance(&test_data.raw, data.reverse)?;
        assert_eq!(
            data.result,
            // .iter()
            // .map(|w| w.quantize(KDELTA).unwrap())
            // .collect_vec(),
            distance,
            // .iter()
            // .map(|w| w.quantize(KDELTA).unwrap())
            // .collect_vec(),
            "Test failing for ShortestDistance with reverse={}",
            data.reverse
        );
    }
    Ok(())
}