Lingsoft's Spell-Checker Component for Swedish

Select language  
Search from site  

Lingsoft® SWESPELL is a high-quality spelling-checker component for Swedish, designed for checking basic spelling errors in standard written Swedish. It adheres to commonly known and accepted spelling norms presented in established reference works available at the date of the latest update.

Lingsoft endeavors to keep the subtle balance between recall (the rate of correctly spelled words recognized) and precision (the rate of errors detected) by performing rigorous regression testing when changes are made to the language model. Particular care has been taken to avoid masking, which means that a frequent spelling error is hidden by a rare word being spelled exactly as the erroneously spelled.

Based on Lingsoft's Model of Swedish

Swedish Spelling exampleSWESPELL uses Lingsoft's comprehensive two-level model of Swedish morphology, SWETWOL to recognize inflected, derivative and compound word forms, and to generate correction suggestions. The model contains more than 240 000 lexical entries, covering the central vocabulary of Swedish, including abbreviations, acronyms, proper names and numerals. Two-level rules take care of word transformation issues like "bok, böcker" (book, books)

The inflectional mechanism recognizes all the morphologically correct inflected word forms. The derivational and compositional mechanisms allow for new words to be formed based on words known to the model. The generative mechanisms have been restricted to increase precision, meaning that not all morphologically acceptable compound or derivative words are recognized. Considering the productive compounding in Swedish, the amount of recognized words can be measured in millions.

The lexical content and two-level rules of the language model are compiled to a fast and compact finite-state transducer, which along with the program code and other data are included in a binary file of only about 2.5 MB.

A Suggestion Mechanism that Works

SWESPELL attempts to suggest corrections to words it doesn't recognize as correctly spelled. The basic suggestion mechanism suggests all recognized words with the editing distance of one (one-letter addition, deletion or transposition, except for the first letter of the word). More wide-ranging and more specific suggestions are given to common spelling errors. Some particular common spelling errors receive only the typically appropriate correction(s).

SWESPELL generally avoids suggesting words that may seem awkward or incomprehensible for the user. In particular generated compounds and derivatives are only suggested based on segment-specific correction rules. SWESPELL also endeavors not to suggest words that may potentially seem offensive for the user. If suitable suggestions are not found, no suggestions are given.

Stunning Performance and Precision

SWESPELL can analyze more than 2 000 words per second on an Intel Xeon @ 3.0 GHz running Linux, and recognizes more than 95% of the correctly spelled words in typical running text.

Software Integration Made Easy

SWESPELL can be integrated to provide spell-checking to almost any software application, including web-based services, with Lingsoft's proprietary LSPROOF-API application programming interface for Windows, Linux, Mac and Java. The character set used with LSPROOF is Unicode. LSPROOF is a common programming library for Lingsoft's spelling and grammar checkers. We recommend to combine SWESPELL with Lingsoft's Swedish grammar checker SWEGRC.

Lingsoft® SWESPELL: Copyright © Lingsoft, Inc. 1986-2010. Svenska Akademiens ordlista 13th edition © Svenska Akademien 2006. Two-Level Compiler: Copyright © Xerox Corporation 1994. All rights reserved. Lingsoft is a registered trademark and SWESPELL, SWETWOL and LSPROOF are trademarks of Lingsoft, Inc. Copyright © Lingsoft, Inc. 2010. All rights reserved. Details subject to change.

Print   RSS

Microsoft® Gold Certified Partner    Adobe® Solution Partner    SDL | LSP Partner Program | Advantage Plus Partner

Copyright ©1986-2018, Lingsoft Ltd.