A prototype for a Chamalal morphological analyzer in lexd and twol

simple cg output from hfst-ospell, expects one word per line as input

Provides syntax highlighting for the twolc two-level rule compiler language, used by xfst, HFST, and Foma to augment finite-state transducers.

Pure Python implementation of HFST

A morphological analyzer and generator for 150 Laz nouns.

A tap to install HFST on macOS with Homebrew

HFST Optimized Lookup for Rust

Source for UiT specific documentation for the GiellaLT infrastructure.

Experimental two-level rule compilation using Python HFST

📜 Major mode for editing Helsinki Finite State Tools files in Emacs

Python library for automatic analysis of Ancient Greek hexameter. The algorithm uses linguistic rules and finite-state technology.

Source files for Odawa/Nishnaabemwin morphological analysis (xfst/hfst/foma)

Parses over the existing lexc file in HFST format and generates the corresponding monolingual dictionary in lttoolbox format.

Babylonian finite-state morphology

Spell checking library for ZHFST/BHFST spellers, with case handling and tokenization support. (Spell checking derived from hfst-ospell)