A morphographemic model for error correction in nonconcatenative strings

Authors:
Tanya Bowden;George Anton Kiraz
Affiliations:
University of Cambridge, Computer Laboratory, Cambridge;University of Cambridge, Computer Laboratory, Cambridge
Venue:
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Year:
1995

Citing 4
Cited 4

A technique for computer detection and correction of spelling errors

Communications of the ACM
Nonconcatenative finite-state morphology

EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Syntactic normalization of spontaneous speech

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Multi-tape two-level morphology: a case study in semitic non-linear morphology

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1

Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction

Computational Linguistics
Using Finite State Technology in Natural Language Processing of Basque

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Compiling a partition-based two-level formalism

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Computing prosodic morphology

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a spelling correction system which integrates seamlessly with morphological analysis using a multi-tape formalism. Handling of various Semitic error problems is illustrated, with reference to Arabic and Syriac examples. The model handles errors vocalisation, diacritics, phonetic syncopation and morphographemic idiosyncrasies, in addition to Damerau errors. A complementary correction strategy for morphologically sound but morphosyntactically ill-formed words is outlined.