…transducers - a form of two-way automata. The XFST formalism leads to more readable/maintainable lexicons and rules, and it can also be used to generate, not just to analyze. [1] https://www.amazon.com/Finite-State-Morphology-Kenneth-Beesl... [2] https://dsacl3-2018.github.io/xfst-demo/ and others (simplay search for e.g. "xfst|foma fst") [3] Hulden, Mans (2008) https://aclanthology.org/E09-2008/ (A Python interface already…
评论区提到了《Finite State Morphology》，这对我来说是个新东西。虽然代码写起来可能冗长了点，但它看起来确实比正则表达式好用得多。FSM 本质上就是一个双向（正向/反向）的过程……
Finite State Morphology was mentioned in the comments and was new to me. It really does look much more useful than regular expressions at the expense of some verbosity. The way that FSM is inherently a forward/backward process…
……https://www.amazon.co.uk/Recognition-Algorithms-Finite-State... (c) https://www.amazon.co.uk/Finite-State-Techniques-Transducers... (d) https://www.amazon.co.uk/Finite-state-Language-Processing-Sp... (e) https://www.amazon.co.uk/Finite-State-Morphology-CSLI-Comput...
…https://www.amazon.co.uk/Recognition-Algorithms-Finite-State... (c) https://www.amazon.co.uk/Finite-State-Techniques-Transducers... (d) https://www.amazon.co.uk/Finite-state-Language-Processing-Sp... (e) https://www.amazon.co.uk/Finite-State-Morphology-CSLI-Comput...
……transducer——一种双向自动机形式。XFST 形式化体系带来了可读性更好、更易维护的词表（lexicon）和规则，而且它不仅可以用来分析，还可以用来生成。[1] https://www.amazon.com/Finite-State-Morphology-Kenneth-Beesl... [2] https://dsacl3-2018.github.io/xfst-demo/ 以及其他（直接搜索比如 "xfst|foma fst" 就行）[3] Hulden, Mans (2008) https://aclanthology.org/E09-2008/（已经有一个 Python 接口……
…transducers - a form of two-way automata. The XFST formalism leads to more readable/maintainable lexicons and rules, and it can also be used to generate, not just to analyze. [1] https://www.amazon.com/Finite-State-Morphology-Kenneth-Beesl... [2] https://dsacl3-2018.github.io/xfst-demo/ and others (simplay search for e.g. "xfst|foma fst") [3] Hulden, Mans (2008) https://aclanthology.org/E09-2008/ (A Python interface already…
评论区提到了《Finite State Morphology》，这对我来说是个新东西。虽然代码写起来可能冗长了点，但它看起来确实比正则表达式好用得多。FSM 本质上就是一个双向（正向/反向）的过程……
Finite State Morphology was mentioned in the comments and was new to me. It really does look much more useful than regular expressions at the expense of some verbosity. The way that FSM is inherently a forward/backward process…