Show HN: Transductive regular expressions for text editing

Re:Show HN: Transductive regular expressions for text editing by languagehacker on Friday February 07, 2025 @04:31PM (#42977711)

For folks interested in finite-state transducers and other kinds of tooling available, check out XFST (Xerox Finite-State Transducer), which has been used in computational linguistics applications for a good 20 years now.

I remember a Finnish researcher from PARC coming to one of my classes at UT to show how you can use FSTs for handling Finnish morphology, which is, on its face, quite a feat.

[ Parent | on HN ]

Re:Show HN: Transductive regular expressions for text editing by kreyenborgi on Friday February 07, 2025 @04:48PM (#42977883)

http://hfst.github.io/ is the modern open source version of XFST; it subsumes foma and openfst, pretty sure it does all of what trre does and more.

[ Parent | on HN ]

Re:Show HN: Transductive regular expressions for text editing by woodson on Friday February 07, 2025 @06:06PM (#42978542)

There’s also k2 (https://github.com/k2-fsa/k2) which implements a lot of FSA and FST algorithms in CUDA, with PyTorch bindings.

[ Parent | on HN ]

Re:Show HN: Transductive regular expressions for text editing by ChuckMcM on Friday February 07, 2025 @04:57PM (#42977968)

I was going to mention this as well. This is a link to Kaplan's paper : https://aclanthology.org/J94-3001.pdf which describes the work PARC did.

[ Parent | on HN ]

Re:Show HN: Transductive regular expressions for text editing by mcyc on Friday February 07, 2025 @11:22PM (#42980355)

People may also be interested in Pynini [1], a python wrapper (+ a lot of additional ease-of-use functionality) of OpenFst [2] (a really great library for transducers).

There are some good tutorials in the form of homework assignments (from like Johns Hopkins and some others) that go through Pynini use cases.

[1] https://www.openfst.org/twiki/bin/view/GRM/Pynini

[2] https://www.openfst.org/

[ Parent | on HN ]