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

dc.contributor.authorPirinen, Flammie A.
dc.contributor.authorMoshagen, Sjur Nørstebø
dc.contributor.editorTrosterud, Trond
dc.contributor.editorWiechetek, Linda
dc.contributor.editorPirinen, Flammie
dc.coverage.spatialTallinn, Estonia
dc.date.accessioned2025-02-17T09:32:00Z
dc.date.available2025-02-17T09:32:00Z
dc.date.issued2025-03
dc.description.abstractSpell-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.
dc.identifier.urihttps://hdl.handle.net/10062/107154
dc.language.isoen
dc.publisherUniversity of Tartu Library
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.titleDivvunspell---Finite-State Spell-Checking and Correction on Modern Platforms
dc.typeArticle

Failid

Originaal pakett

Nüüd näidatakse 1 - 1 1
Laen...
Pisipilt
Nimi:
2025_cgfsnlp_1_9.pdf
Suurus:
116.46 KB
Formaat:
Adobe Portable Document Format