<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="pirinen-moshagen-2025-divvunspell">
    <titleInfo>
        <title>Divvunspell—Finite-State Spell-Checking and Correction on Modern Platforms</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Flammie</namePart>
        <namePart type="given">A</namePart>
        <namePart type="family">Pirinen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Sjur</namePart>
        <namePart type="given">Nørstebø</namePart>
        <namePart type="family">Moshagen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2025-03</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 9th Workshop on Constraint Grammar and Finite State NLP</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Trond</namePart>
            <namePart type="family">Trosterud</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Linda</namePart>
            <namePart type="family">Wiechetek</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Flammie</namePart>
            <namePart type="family">Pirinen</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>University of Tartu Library</publisher>
            <place>
                <placeTerm type="text">Tallinn, Estonia</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
        <identifier type="isbn">978-9908-53-113-7</identifier>
    </relatedItem>
    <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.</abstract>
    <identifier type="citekey">pirinen-moshagen-2025-divvunspell</identifier>
    <location>
        <url>https://aclanthology.org/2025.cgmta-1.9/</url>
    </location>
    <part>
        <date>2025-03</date>
        <extent unit="page">
            <start>59</start>
            <end>63</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Divvunspell—Finite-State Spell-Checking and Correction on Modern Platforms
%A Pirinen, Flammie A.
%A Moshagen, Sjur Nørstebø
%Y Trosterud, Trond
%Y Wiechetek, Linda
%Y Pirinen, Flammie
%S Proceedings of the 9th Workshop on Constraint Grammar and Finite State NLP
%D 2025
%8 March
%I University of Tartu Library
%C Tallinn, Estonia
%@ 978-9908-53-113-7
%F pirinen-moshagen-2025-divvunspell
%X 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.
%U https://aclanthology.org/2025.cgmta-1.9/
%P 59-63

Markdown (Informal)

[Divvunspell—Finite-State Spell-Checking and Correction on Modern Platforms](https://aclanthology.org/2025.cgmta-1.9/) (Pirinen & Moshagen, cgmta 2025)

• Divvunspell—Finite-State Spell-Checking and Correction on Modern Platforms (Pirinen & Moshagen, cgmta 2025)

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.