Article Preview
Buy Now
| Print: | |
| PDF: |
Feature
REALWord
Mind Your Spelling
Issue: 6.1 (November/December 2007)
Author: JC Cruz
Article Description: No description available.
Article Length (in bytes): 22,462
Starting Page Number: 21
RBD Number: 6111
Resource File(s):
6111.zip Updated: Thursday, November 15, 2007 at 10:34 AM
Related Web Link(s):
http://wordlist.sourceforge.net
http://en.wikipedia.org/wiki/Spell_checker
http://en.wikipedia.org/wiki/Edit_distance
http://en.wikipedia.org/wiki/Levenshtein_distance
http://en.wikipedia.org/wiki/Jaro-Winkler
http://www.concentric.net/~Ttwang/tech/inthash.htm
http://en.wikipedia.org/wiki/Hash_collision
Known Limitations: None
Excerpt of article text...
Today, we will look into the concept of a spell checker. We will learn how a spell checker works and what it takes to build one. We will then use REALbasic to design, develop, and test a basic spell check engine.
A Brief Primer on Spell Checkers
Spell checkers are software packages that verify the spelling of each word in a given document. They let users correct the misspelled word or choose from a list of close matches. Some can even do simple grammar checks as well. All spell checkers use a dictionary of words with proven spelling as their reference source. Many have multiple dictionaries, each one for a specific language or purpose.
Spell checkers came into the mainframe scene in the 1970s, about the same time as word processors. These early spell checkers are separate standalone packages. They check the document after it was written, not during. They also detect only misspellings and do not provide any corrective features. And not surprisingly, these early spell checkers support standard English spellings only. They are also unable to recognize contractions and regional spellings.
...End of Excerpt. Please purchase the magazine to read the full article.
Article copyrighted by REALbasic Developer magazine. All rights reserved.
|
