State-of-the-art in weighted finite-state spell-checking
TA Pirinen, K Lindén - … Linguistics and Intelligent Text Processing: 15th …, 2014 - Springer
The following claims can be made about finite-state methods for spell-checking: 1) Finite-
state language models provide support for morphologically complex languages that word …
state language models provide support for morphologically complex languages that word …
Minimization of symbolic transducers
O Saarikivi, M Veanes - … , CAV 2017, Heidelberg, Germany, July 24-28 …, 2017 - Springer
Symbolic transducers extend classical finite state transducers to infinite or large alphabets
like Unicode, and are a popular tool in areas requiring reasoning over string transformations …
like Unicode, and are a popular tool in areas requiring reasoning over string transformations …
A New Notion of Regularity: Finite State Automata Accepting Graphs
YA Meeres - arxiv preprint arxiv:2409.06968, 2024 - arxiv.org
Analogous to regular string and tree languages, regular languages of directed acyclic
graphs (DAGs) are defined in the literature. Although called regular, those DAG-languages …
graphs (DAGs) are defined in the literature. Although called regular, those DAG-languages …
[PDF][PDF] Automated lossless hyper-minimization for morphological analyzers
This paper presents a fully automated lossless hyper-minimization method for finitestate
morphological analyzers in Xerox lexc formalism. The method utilizes flag diacritics to …
morphological analyzers in Xerox lexc formalism. The method utilizes flag diacritics to …
[PDF][PDF] Automatic Morphological Analysis and Syntactic Parsing for the Georgian
In our research, we address Georgian-a language with rich inflectional morphology and with
very little fixed structure on the sentence level. The languages of similar design are referred …
very little fixed structure on the sentence level. The languages of similar design are referred …
[PDF][PDF] CLARA: A new generation of researchers in common language resources and their applications
Abstract CLARA (Common Language Resources and Their Applications) is a Marie Curie
Initial Training Network which ran from 2009 until 2014 with the aim of providing researcher …
Initial Training Network which ran from 2009 until 2014 with the aim of providing researcher …
and Intelligent Text Processing
A Gelbukh - Springer
CICLing 2015 was the 16th Annual Conference on Intelligent Text Processing and
Computational Linguistics. The CICLing conferences provide a wide-scope forum for …
Computational Linguistics. The CICLing conferences provide a wide-scope forum for …