Spell checking library for ZHFST/BHFST spellers, with case handling and tokenization support. (Spell checking derived from hfst-ospell)
-
Updated
May 30, 2024 - Rust
Spell checking library for ZHFST/BHFST spellers, with case handling and tokenization support. (Spell checking derived from hfst-ospell)
Parses over the existing lexc file in HFST format and generates the corresponding monolingual dictionary in lttoolbox format.
Babylonian finite-state morphology
📜 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.
Experimental two-level rule compilation using Python HFST
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.
Source for UiT specific documentation for the GiellaLT infrastructure.
Add a description, image, and links to the hfst topic page so that developers can more easily learn about it.
To associate your repository with the hfst topic, visit your repo's landing page and select "manage topics."