XUXEN: A Spelling Checker/Corrector for Basque Based on Two-Level Morphology

@inproceedings{Agirre1992XUXENAS,
  title={XUXEN: A Spelling Checker/Corrector for Basque Based on Two-Level Morphology},
  author={Eneko Agirre and I{\~n}aki Alegria and Xabier Arregi and Xabier Artola and Arantza D{\'i}az de Ilarraza and Montse Maritxalar and Kepa Sarasola and Miriam Urkia},
  booktitle={ANLP},
  year={1992}
}
The application of the formalism of two-level morphology to Basque and its use in the elaboration of the XUXEN spelling checker/corrector are described. This application is intended to cover a large part of the language.Because Basque is a highly inflected language, the approach of spelling checking and correction has been conceived as a by-product of a general purpose morphological analyzer/generator. This analyzer is taken as a basic tool for current and future work on automatic processing of… 
A spelling corrector for Basque based on morphology
TLDR
The Xuxen spelling checker/corrector performs morphological decomposition in order to check misspellings and, to correct them, uses a new strategy which combines the use of an additional two-level morphological subsystem for orthographic errors.
Spelling correction and morphological analysis to aid electronic dictionary look-up
We discuss here the potential use of a morphologically aware spelling corrector to aid second language learners in finding words in an electronic dictionary, using Korean as the language of
First Approach to Automatic Text Simplification in Basque Marı́a
TLDR
This work presents an architecture for a text simplification system based on previously developed general coverage tools and on hand written rules specific for syntactic simplification, and focuses on specific phenomena like appositions, finite relative clauses and finite temporal clauses.
Handling Reduplication in Basque: A Problem for Spell Checking
TLDR
This paper provides a linguistic description of the phenomenon and presents a prototype to be integrated in a complete spelling and grammar checker that would be capable of handling reduplication better than existing systems.
FipsOrtho: A spell checker for learners of French
TLDR
FipsOrtho, a spell checker targeted at learners of French, and a corpus of learners’ errors which has been gathered to test the system and to get a sample of specific language learners' errors are presented.
Different Issues in the Design of a Lemmatizer/Tagger for Basque
TLDR
This paper presents relevant issues that have been considered in the design of a general purpose lemmatizer/tagger for Basque (EUSLEM) and on the strategies for morphological disambiguation that will be used.
Weighted Finite-State Methods for Spell-Checking and Correction
TLDR
The usability of finite-state spell-checkers as a viable alternative to traditional non-finitestate solutions is demonstrated in a large-scale evaluation of spell-checking speed and the quality using languages with morphologically different natures.
Automatic morphological analysis of Basque
TLDR
The components of a robust and wide-coverage morphological analyser for Basque, based on the two-level formalism, are described and improved both the performance of the different components of the system and the description itself.
Morphosyntactic structure of terms in Basque for automatic terminology extraction
TLDR
The morphosyntactic patterns of technical terms in Basque are described and an architecture for a term-extracting tool is presented and it is suggested that a shallow syntactic parser will identify the previously described patterns.
Syntactic error detection and correction in date expressions using finite-state transducers
TLDR
A set of experiments for the detection and correction of syntactic errors, exploring two alternative approaches using an error grammar which combines a robust morphosyntactic analyser and two groups of finite-state transducers.
...
...

References

SHOWING 1-10 OF 37 REFERENCES
Automatic spelling correction in scientific and scholarly text
TLDR
This paper describes the correction program developed as part of SPEEDCOP (Spelling Error Correction Project), a Chemical Abstracts Service (CAS) project supported by the National Science Foundation intended not as a theoretical construct but as a useful tool for text editing.
A General Computational Model For Word-Form Recognition And Production
TLDR
A language independent model for recognition and production of word forms is presented, based on a new way of describing morphological alternations that is capable of both analyzing and synthesizing word-forms.
The application of two-level morphology to non-concatenative German morphology
TLDR
An extension to the model which will allow for the description of non-concatenative morphology to restrict the applicability of two-level rules by providing them with filters in the form of feature structures is proposed.
Morphological Analysis
TLDR
A computer program that is intended to carry out nontrivial operations on texts in an ordinary language must start by recognizing the words that the text is made up of, and there must be a list what the authors call a dictionary to define the mapping of words into linguistically interesting properties and a process to look words up in this dictionary.
Computational Complexity in Two-Level Morphology
TLDR
Reductions of the satisfiability problem show that finding the proper lexical-surface correspondence in a two-level generation or recognition problem can be computationally difficult, however, another source of complexity in the existing algorithms can be sharply reduced by changing the implementation of the dictionary component.
Compilation of automata from morphological two-level rules
TLDR
The model consists of a lexicon system and a formalism for two-level rules for word inflection and its relations pertaining to the ru le co m p o n e n t h a v e been e p r e s s e d in two ways.
A Computational Framework for Lexical Description
TLDR
Various rule formalisms are presented which process orthographic effects, word structure, and lexicai redundancy in a manner which allows the statement of linguistic generalisations with a clear computational interpretation.
Computer programs for detecting and correcting spelling errors
TLDR
Peterson investigates the basic structure of several such existing programs and their approaches to solving the problems which arise when this type of program is created.
A technique for computer detection and correction of spelling errors
The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input
...
...