Divvunspell—Finite-State Spell-Checking and Correction on Modern Platforms

Flammie A Pirinen, Sjur Nørstebø Moshagen


Abstract
Spell-checking and correction is one of the key applications of natural language support. Historically, for the biggest, less morphologically complex languages, spell-checking and correction could be implemented by relatively simple means; however, for morphologically complex and low-resource languages, the solutions were often suboptimal. Finite-state methods are the state of the art in rule-based natural language processing and also for spell-checking and correction they have been effectively used. In this article, we show some recent developments of a finite-state spell-checker implementation that works with modern operating systems and platforms.
Anthology ID:
2025.cgmta-1.9
Volume:
Proceedings of the 9th Workshop on Constraint Grammar and Finite State NLP
Month:
march
Year:
2025
Address:
Tallinn, Estonia
Editors:
Trond Trosterud, Linda Wiechetek, Flammie Pirinen
Venues:
cgmta | WS
SIG:
Publisher:
University of Tartu Library
Note:
Pages:
59–63
Language:
URL:
https://preview.aclanthology.org/fix-sig-urls/2025.cgmta-1.9/
DOI:
Bibkey:
Cite (ACL):
Flammie A Pirinen and Sjur Nørstebø Moshagen. 2025. Divvunspell—Finite-State Spell-Checking and Correction on Modern Platforms. In Proceedings of the 9th Workshop on Constraint Grammar and Finite State NLP, pages 59–63, Tallinn, Estonia. University of Tartu Library.
Cite (Informal):
Divvunspell—Finite-State Spell-Checking and Correction on Modern Platforms (Pirinen & Moshagen, cgmta 2025)
Copy Citation:
PDF:
https://preview.aclanthology.org/fix-sig-urls/2025.cgmta-1.9.pdf