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={Applied Natural Language Processing Conference},
  year={1992},
  url={https://api.semanticscholar.org/CorpusID:1844637}
}
An extension for continuation class specifications in order to deal with long-distance dependencies is proposed and consists basically of two features added to the standard formalism which allow the lexicon builder to make explicit the interdependencies of morphemes.
View on ACL
dl.acm.org
56 Citations
Highly Influential Citations
1
Background Citations
22
Methods Citations
18

56 Citations

A spelling corrector for Basque based on morphology

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

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

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

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

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

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

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

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

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.
...

26 References

Automatic spelling correction in scientific and scholarly text

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.

The application of two-level morphology to non-concatenative German morphology

It is demonstrated how a well-known problem of German morphology, so-called "Umlautung", can be described in this approach in a linguistically motivated and efficient way.

A General Computational Model for Word-Form Recognition and Production

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.

Morphological Analysis

Computational Complexity in Two-Level Morphology

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.

Compilation of automata from morphological two-level rules

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.

Automatic Spelling Correction Using a Trigram Similarity Measure

A Computational Framework for Lexical Description

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

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.

Computational Linguistics Research at the University of Pennsylvania

Perhaps the most activity here in computat ional linguistics is aimed at extending the kinds of behavior that can be supported in interactions with data base and expert systems. Elsewhere we have…

Related Papers

Showing 1 through 3 of 0 Related Papers