Finite state morphology
by Kenneth R. Beesley · first published 2003
3mentions
0recommended by
2HN commenters
2020–2026first – last mentioned
100% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
…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...
on “A portable, modern regular expression language” ↗…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…
on “17 weird facts about the Hunspell dictionary format” ↗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…
on “Source of the famous “Now you have two problems” quote (2006)” ↗