%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.32",
%%%     date            = "05 July 1997",
%%%     time            = "17:10:51 MDT",
%%%     filename        = "spell.bib",
%%%     address         = "Center for Scientific Computing
%%%                        Department of Mathematics
%%%                        University of Utah
%%%                        Salt Lake City, UT 84112
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "43326 8851 42186 389680",
%%%     email           = "beebe at math.utah.edu (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography, orthography, phonography,
%%%                        spell, spelling",
%%%     supported       = "yes",
%%%     docstring       = "This bibliography records publications on
%%%                        computer-based spelling error detection and
%%%                        correction.
%%%
%%%                        At version 1.32, the year coverage looked
%%%                        like this:
%%%
%%%                             1960 (  1)     1973 (  0)     1986 ( 21)
%%%                             1961 (  0)     1974 (  1)     1987 ( 27)
%%%                             1962 (  1)     1975 (  2)     1988 ( 13)
%%%                             1963 (  0)     1976 (  1)     1989 (  7)
%%%                             1964 (  0)     1977 (  2)     1990 ( 13)
%%%                             1965 (  0)     1978 (  1)     1991 ( 10)
%%%                             1966 (  1)     1979 (  1)     1992 ( 27)
%%%                             1967 (  0)     1980 (  4)     1993 ( 24)
%%%                             1968 (  0)     1981 ( 15)     1994 ( 37)
%%%                             1969 (  1)     1982 ( 26)     1995 ( 15)
%%%                             1970 (  1)     1983 ( 23)     1996 (  2)
%%%                             1971 (  0)     1984 ( 23)
%%%                             1972 (  1)     1985 ( 16)
%%%                             19xx (  1)
%%%
%%%                             Article:        167
%%%                             Book:            16
%%%                             InBook:           1
%%%                             InCollection:     5
%%%                             InProceedings:   65
%%%                             MastersThesis:    2
%%%                             Misc:             1
%%%                             Proceedings:     58
%%%                             TechReport:       3
%%%
%%%                             Total entries:  318
%%%
%%%                        This bibliography has been collected from
%%%                        bibliographies in the author's personal
%%%                        files, from several OCLC databases, from
%%%                        the Compendex databases (1970--1996), from
%%%                        the IEEE INSPEC CD ROM databases
%%%                        (1989--1995), from the computer graphics
%%%                        bibliography archive at ftp.siggraph.org,
%%%                        and from the computer science bibliography
%%%                        collection on ftp.ira.uka.de in
%%%                        /pub/bibliography to which many people of
%%%                        have contributed.  The snapshot of this
%%%                        collection was taken on 5-May-1994, and it
%%%                        consists of 441 BibTeX files, 2,672,675
%%%                        lines, 205,289 entries, and 6,375
%%%                        <at>String{} abbreviations, occupying
%%%                        94.8MB of disk space.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.  Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen as
%%%                        name:year:abbrev, where name is the family
%%%                        name of the first author or editor, year is a
%%%                        4-digit number, and abbrev is a 3-letter
%%%                        condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted
%%%                        first by ascending year, and within each
%%%                        year, alphabetically by author or editor,
%%%                        and then, if necessary, by the 3-letter
%%%                        abbreviation at the end of the BibTeX
%%%                        citation tag, using the bibsort -byyear
%%%                        utility. Year order has been chosen to make
%%%                        it easier to identify the most recent work
%%%                        in this collection.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
  "\hyphenation{
                Faw-throp
                Go-pal-a-krish-nan
                Za-mora
  }"
}

%=======================================================================
% Acknowledgement abbreviations:

@String{ack-fm  =   "Frank Mittelbach,
                    e-mail: \path|mittelbach@mzdmza.zdv.uni-mainz.de|"}

@String{ack-nhfb = "Nelson H. F. Beebe,
                    Center for Scientific Computing,
                    Department of Mathematics,
                    University of Utah,
                    Salt Lake City, UT 84112, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%=======================================================================
% Institution abbreviations:

@String{inst-APPL-FORTH-RES     = "Institute for Applied FORTH Research"}

@String{inst-APPL-FORTH-RES:adr = "Rochester, NY, USA"}

@String{inst-CORNELL            = "Cornell University"}

@String{inst-CORNELL:adr        = "Ithaca, NY, USA"}

%=======================================================================
% Journal abbreviations:

@String{j-A-PLUS                = "A+"}

@String{j-ACTA-INFO             = "Acta Informatica"}

@String{j-AEDS                  = "AEDS J"}

@String{j-ASLIB-PROC            = "ASLIB Proceedings"}

@String{j-ASTM-SPEC-TECH-PUB    = "ASTM special technical publication"}

@String{j-BEHAV-INF-TECH        = "Behav. Inf. Technol"}

@String{j-BYTE                  = "BYTE Magazine"}

@String{j-BYTE                  = "Byte Magazine"}

@String{j-C-JET                 = "C: JET, Communication: journalism education
                                  today"}

@String{j-CACM                  = "Communications of the Association for
                                  Computing Machinery"}

@String{j-CD-ROM-WORLD          = "CD-ROM World"}

@String{j-COGNITION             = "Cognition"}

@String{j-COMP-BULL             = "The Computer Bulletin"}

@String{j-COMP-HUM              = "Comput. Hum."}

@String{j-COMP-INTELL           = "Computational Intelligence"}

@String{j-COMP-J                = "The Computer Journal"}

@String{j-COMP-LANG-MAG         = "Computer Language Magazine"}

@String{j-COMP-SURV             = "ACM Computing Surveys"}

@String{j-COMPUT-AND-BIOMED-RES = "Computers and Biomedical Research"}

@String{j-COMPUT-HUM-BEHAV      = "Computers in Human Behavior"}

@String{j-CREATIVE-COMP         = "Creative Comput"}

@String{j-CRYPTOLOGIA           = "Cryptologia"}

@String{j-CUJ                   = "C Users Journal"}

@String{j-DATAMATION            = "Datamation"}

@String{j-DDJ                   = "Dr. Dobb's Journal of Software Tools"}

@String{j-DISCRETE-APPL-MATH    = "Discrete Applied Mathematics"}

@String{j-ELECTRONIC-LIBRARY    = "Electronic Library"}

@String{j-EPODD                 = "Electronic Publishing---Origination,
                                  Dissemination, and Design"}

@String{j-IBM-JRD               = "IBM Journal of Research and Development"}

@String{j-IBM-TDB               = "IBM Technical Disclosure Bulletin"}

@String{j-IEEE-INT-PROFL-COMM-CONF = "IEEE International Professional
                                  Communications Conference"}

@String{j-IEEE-INT-SYMP-INF-THEORY = "IEEE International Symposium on
                                  Information Theory"}

@String{j-IEEE-POT              = "IEEE Potentials"}

@String{j-IEEE-SOFTWARE         = "IEEE Software"}

@String{j-IEEE-SPECTRUM         = "IEEE Spectrum"}

@String{j-IEEE-TRANS-ACOUST-SPEECH = "IEEE Transactions on Acoustics, Speech,
                                  and Signal Processing"}

@String{j-IEEE-TRANS-BIOMED-ENG = "IEEE Transactions on Biomedical
                                  Engineering"}

@String{j-IEEE-TRANS-COMM       = "IEEE Transactions on Communications"}

@String{j-IEEE-TRANS-KNOWL-DATA-ENG = "IEEE Transactions on Knowledge and Data
                                  Engineering"}

@String{j-IEEE-TRANS-PATT-ANAL-MACH-INTEL = "IEEE Transactions on Pattern
                                  Analysis and Machine Intelligence"}

@String{j-IEEE-TRANS-PROF-COMM  = "IEEE Transactions on Professional
                                  Communication"}

@String{j-INFO-CTL              = "Information and Control"}

@String{j-INFO-PROC-LETT        = "Information Processing Letters"}

@String{j-INFO-PROC-MAN         = "Information Processing and Management"}

@String{j-INFOWORLD             = "InfoWorld"}

@String{j-INT-J-MAN-MACHINE-STUDIES = "International Journal of Man-Machine
                                  Studies"}

@String{j-INTEGRATION-VLSI-J    = "Integration, the VLSI journal"}

@String{j-J-AM-SOC-INF-SCI      = "Journal of the American Society for
                                  Information Science"}

@String{j-J-COMP-BASED-INST     = "Journal of Computer-Based Instruction"}

@String{j-J-DOC                 = "Journal of Documentation"}

@String{j-J-EDU-RESEARCH        = "The Journal of Educational Research"}

@String{j-J-EXP-PSYCH-GEN       = "Journal of Experimental Psychology:
                                  General"}

@String{j-J-EXP-PSYCH-LMC       = "Journal of Experimental Psychology:
                                  Learning, Memory, and Cognition"}

@String{j-J-INF-PROCESS         = "Journal of Information Processing"}

@String{j-J-INST-ELEC-TELECOMM-ENG = "Journal of the Institution of
                                  Electronics and Telecommunication Engineers"}

@String{j-J-PAS-ADA-MOD         = "Journal of Pascal, Ada and Modula-2"}

@String{j-LAWYERS-PC            = "The Lawyer's PC"}

@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}

@String{j-MEM-COG               = "Memory and Cognition"}

@String{j-OFF-OUR-BACKS         = "Off our backs"}

@String{j-ONLINE                = "Online"}

@String{j-PAT-REC-LETT          = "Pattern Recognition Letters"}

@String{j-PATTERN-RECOGN        = "Pattern Recognition"}

@String{j-PC-MAGAZINE           = "PC Magazine"}

@String{j-PC-PUB                = "PC Publishing"}

@String{j-PC-WORLD              = "PC World"}

@String{j-PERS-COMP             = "Personal Computing"}

@String{j-POP-COMP              = "Popular Computing"}

@String{j-PROBL-INF-TRANSM      = "Problems of Information Transmission"}

@String{j-PROBL-PEREDA-INF      = "Problemy Peredachi Informatsii"}

@String{j-PROC-ACM-SYMP-APPL-COMPUTING = "Proceedings of the ACM Symposium on
                                  Applied Computing"}

@String{j-PROC-ASIS-AM          = "Proceedings of the ASIS annual meeting"}

@String{j-PROC-ICASSP           = "Proceedings of the International Conference
                                  on Acoustics, Speech, and Signal Processing"}

@String{j-PROC-IEEE-CONF-SYST-MAN-CYBERN = "Proceedings of the IEEE
                                  International Conference on Systems, Man and
                                  Cybernetics"}

@String{j-PROC-SPIE             = "Proceedings of the SPIE --- The
                                  International Society for Optical
                                  Engineering"}

@String{j-PROG-COMP-SOFT        = "Programming and Computer Software;
                                  translation of Programmirovaniye (Moscow,
                                  USSR) Plenum"}

@String{j-PROLOGUE              = "Prologue: the journal of the National
                                  Archives"}

@String{j-SIGIR-FORUM           = "SIGIR Forum (ACM Special Interest Group on
                                  Information Retrieval)"}

@String{j-SIGPLAN               = "SIGPLAN Notices"}

@String{j-SPE                   = "Soft{\-}ware\emdash Prac{\-}tice and
                                  Experience"}

@String{j-SPEECH                = "Speech"}

@String{j-SPEECH-COMM           = "Speech Communication"}

@String{j-TODS                  = "ACM Transactions on Database Systems"}

@String{j-TOOIS                 = "ACM Transactions on Office Information
                                  Systems"}

@String{j-TRANS-INFO-PROCESSING-SOC-JAPAN = "Transactions of the Information
                                  Processing Society of Japan"}

@String{j-TUGBOAT               = "TUGboat"}

%=======================================================================
% Publishers and their addresses:

@String{pub-ABLEX               = "Ablex Publishing Corp."}

@String{pub-ABLEX:adr           = "Norwood, NJ, USA"}

@String{pub-ACM                 = "ACM Press"}

@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-AFIPS               = "AFIPS Press"}

@String{pub-AFIPS:adr           = "Arlington, VA, USA"}

@String{pub-AP                  = "Academic Press"}

@String{pub-AP:adr              = "New York, NY, USA"}

@String{pub-APA                 = "American Psychological Association"}

@String{pub-APA:adr             = "Washington, DC, USA"}

@String{pub-ASLIB               = "Aslib"}

@String{pub-ASLIB:adr           = "London, UK"}

@String{pub-ASTM                = "ASTM"}

@String{pub-ASTM:adr            = "Philadelphia, PA, USA"}

@String{pub-ATT-BTL             = "Bell Telephone Laboratories"}

@String{pub-ATT-BTL:adr         = "Murray Hill, NJ, USA"}

@String{pub-CSP                 = "Computer Science Press"}

@String{pub-CSP:adr             = "11 Taft Court, Rockville, MD 20850,
                                  USA"}

@String{pub-ENH                 = "Elsevier North-Holland, Inc."}

@String{pub-ENH:adr             = "New York, NY, USA"}

@String{pub-ERLBAUM             = "Erlbaum"}

@String{pub-ERLBAUM:adr         = "New York, NY, USA, and London, UK"}

@String{pub-EUUG                = "European UNIX Users Group"}

@String{pub-EUUG:adr            = "Buntingford, Herts, UK"}

@String{pub-HALSTED             = "Halsted Press"}

@String{pub-HALSTED:adr         = "New York, USA"}

@String{pub-IEEE                = "IEEE Computer Society Press"}

@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300,
                                  Silver Spring, MD 20910, USA"}

@String{pub-KLUWER              = "Kluwer Academic Publishers Group"}

@String{pub-KLUWER:adr          = "Norwell, MA, USA, and Dordrecht, The
                                  Netherlands"}

@String{pub-LEARNED-INF         = "Learned Information"}

@String{pub-LEARNED-INF:adr     = "Medford, NJ, USA"}

@String{pub-LITTLE-BROWN        = "Little, Brown and Co."}

@String{pub-LITTLE-BROWN:adr    = "Boston, MA, USA"}

@String{pub-MIT                 = "MIT Press"}

@String{pub-MIT:adr             = "Cambridge, MA, USA"}

@String{pub-NH                  = "North-Hol{\-}land Publishing Co."}

@String{pub-NH:adr              = "Amsterdam, The Netherlands"}

@String{pub-NIST                = "National Institute for Standards and
                                    Technology"}

@String{pub-NIST:adr            = "Gaithersburg, MD, USA"}

@String{pub-PH                  = "Pren{\-}tice-Hall, Inc."}

@String{pub-PH:adr              = "Englewood Cliffs, NJ 07632, USA"}

@String{pub-PHI                 = "Prentice-Hall International"}

@String{pub-PHI:adr             = "Englewood Cliffs, NJ 07632, USA"}

@String{pub-SOS-PRINT           = "SOS Print"}

@String{pub-SOS-PRINT:adr       = "Piscataway, NJ, USA"}

@String{pub-SPIE                = "SPIE Optical Engineering Press"}

@String{pub-SPIE:adr            = "Bellingham, WA, USA"}

@String{pub-SV                  = "Spring{\-}er-Ver{\-}lag, Inc."}

@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg,
                                   Germany~/ London, UK~/ etc."}

@String{pub-TATA-MCGRAW-HILL    = "Tata McGraw-Hill"}

@String{pub-TATA-MCGRAW-HILL:adr = "New Delhi, India"}

@String{pub-US-GOV-HEW          = "U.S. Department of Health,
                                   Education, and Welfare"}

@String{pub-US-GOV-HEW:adr      = "Washington, DC, USA"}

@String{pub-USENIX              = "USENIX"}

@String{pub-USENIX:adr          = "San Francisco, CA, USA"}

@String{pub-VNR                 = "Van Nostrand Reinhold Co."}

@String{pub-VNR:adr             = "New York, NY, USA"}

@String{pub-WILEY               = "John Wiley and Sons, Inc."}

@String{pub-WILEY:adr           = "New York, NY, USA"}

%=======================================================================
% Bibliography entries.

@Article{Blair:1960:PCS,
  author =       "Charles R. Blair",
  title =        "A program for correcting spelling errors",
  journal =      j-INFO-CTL,
  volume =       "3",
  number =       "??",
  pages =        "60--67",
  year =         "1960",
  bibdate =      "Sat Apr 06 14:44:33 1996",
  acknowledgement = ack-nhfb,
  keywords =     "numerical analysis",
}

@Article{Davidson:1962:RMS,
  author =       "Leon Davidson",
  title =        "Retrieval of Mis-spelled Names in an Airline Passenger
                 Record System",
  journal =      j-CACM,
  volume =       "5",
  number =       "3",
  pages =        "??--??",
  month =        mar,
  year =         "1962",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Jul 26 10:29:32 1994",
  acknowledgement = ack-nhfb,
}

@Book{Hanna:1966:PCC,
  author =       "Paul Robert Hanna and J. S. Hanna and R. E. Hodges and
                 E. H. Rudorf",
  title =        "Phoneme-Grapheme Correspondences as Cues to Spelling
                 Improvement",
  publisher =    pub-US-GOV-HEW,
  address =      pub-US-GOV-HEW:adr,
  pages =        "1716",
  year =         "1966",
  LCCN =         "PE1143.H3",
  bibdate =      "Tue Jul 26 10:29:39 1994",
  acknowledgement = ack-nhfb,
}

@TechReport{Morgan:1969:SCS,
  author =       "H. L. Morgan",
  title =        "Spelling Correction and Systems Programming",
  number =       "TR 69-31",
  institution =  inst-CORNELL,
  address =      inst-CORNELL:adr,
  month =        feb,
  year =         "1969",
  bibdate =      "Tue Jul 26 10:29:42 1994",
  note =         "(email lmc@cs.cornell.edu)",
  acknowledgement = ack-nhfb,
}

@Article{Morgan:1970:SCS,
  author =       "H. L. Morgan",
  title =        "Spelling correction in systems programs",
  journal =      j-CACM,
  volume =       "13",
  number =       "3",
  pages =        "90--94",
  month =        mar,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue May 28 09:49:07 1996",
  abstract =     "Several specialized techniques are shown for
                 efficiently incorporating spelling correction
                 algorithms in to compilers and operating systems. These
                 include the use of syntax and semantics information,
                 the organization of restricted keyword and symbol
                 tables, and the consideration of a limited class of
                 spelling errors. Sample 360 coding for performing
                 spelling correction is presented. By using systems
                 which perform spelling correction, the number of
                 debugging runs per program has been decreased, saving
                 both programmer and machine time.",
  keywords =     "spelling correction, error correction, debugging,
                 compilers, operating systems, diagnostics, error
                 detection, misspelling, lexical analysis systems
                 programming, computer science and automata",
}

@MastersThesis{Heinselman:1972:CDC,
  author =       "Russell Craig Heinselman",
  title =        "Computerized detection and correction of spelling
                 errors in {FORTRAN} programs",
  type =         "Thesis (M.S.)",
  school =       "University of Minnesota",
  address =      "Minneapolis, MN, USA",
  pages =        "76",
  year =         "1972",
  bibdate =      "Sat Jan 27 13:40:57 MST 1996",
  acknowledgement = ack-nhfb,
  keywords =     "{Fortran} (Computer program language)",
}

@Article{Wagner:1974:OCR,
  author =       "R. A. Wagner",
  title =        "Order-$n$ Correction for Regular Languages",
  journal =      j-CACM,
  volume =       "17",
  number =       "5",
  pages =        "??--??",
  month =        may,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue May 28 14:35:14 1996",
  abstract =     "A method is presented for calculating a string B,
                 belonging to a given regular language L, which is
                 ``nearest'' (in number of edit operations) to a given
                 input string $a$. $B$ is viewed as a reasonable
                 ``correction'' for the possibly erroneous string $a$,
                 where a was originally intended to be a string of $L$.
                 \par

                 The calculation of $B$ by the method presented requires
                 time proportional to $|a|$, the number of characters in
                 $a$. The method should find applications in information
                 retrieval, artificial intelligence, and spelling
                 correction systems.",
  keywords =     "error correction, regular languages, regular events,
                 finite state automata, compiler error recovery,
                 spelling correction, string best match problem,
                 correction, corrector, errors, nondeterministic
                 finite-state automata",
}

@Article{Gibbs:1975:ESA,
  author =       "A. T. Gibbs and J. P. McCarthy and D. Whelpton",
  title =        "Electronic Spelling Aid for Use in Speech Therapy",
  journal =      "Medical and Biological Engineering",
  volume =       "13",
  number =       "5",
  pages =        "742--745",
  month =        sep,
  year =         "1975",
  CODEN =        "MBENAU",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A device was produced to assist in the treatment of
                 aphasia. The effects of this disorder, generally caused
                 by damage to brain tissue, are well documented, and are
                 usually considered to be an inability to construct
                 words, or sentences from their component letters, both
                 in spoken or written languages. It was considered that
                 an electronic spelling device offering a minimal
                 `reward' at each stage would perhaps assist in the
                 treatment of such patients in general and children in
                 particular. Accordingly it was decided to use a system
                 in which the word was illuminated letter by letter as
                 the patient operated a keyboard, on which switches were
                 arranged in alphabetical order. On the successful
                 completion of the spelling, it was arranged that a
                 picture illustrating the word would be illuminated.
                 This spelling aid has been received with great
                 enthusiasm by the speech therapists and there is every
                 indication that it will prove highly useful and
                 reliable.",
  acknowledgement = ack-nhfb,
  classification = "751; 461; 462",
  journalabr =   "Med Biol Eng",
  keywords =     "biomedical engineering; speech; speech therapy",
}

@TechReport{Schek:1975:TFK,
  author =       "H.-J. Schek",
  title =        "Tolerating Fuzzyness in Keywords By Similarity
                 Searches",
  institution =  "University of Heidelberg (??)",
  address =      "Heidelberg, Germany",
  year =         "1975",
  bibdate =      "Tue Jul 26 10:29:55 1994",
  acknowledgement = ack-nhfb,
  annote =       "Contents: 1. Introduction 2. Definition of similarity
                 2.1. Intuitive requirements for similarity 2.2. Formal
                 similarity with maximal common substrings 2.3. Formal
                 similarity with syllabic matching 3. Preprocessing,
                 preselection, list ordering 3.1. Preprocessing 3.2.
                 Preselection 3.3. Similarity ordering for minimization
                 of list-block-accesses 4. Implementations 4.1.
                 Detection of misspellings 4.2. Structure of the
                 similarity search 5. Practical experience one feature
                 of a user-friendly system is the capability to tolerate
                 fuzzyness in names or keywords. This report describes
                 how the word context can be used to define similarity
                 measures which model the intuitive human-like notion of
                 similarity. These measures are based on maximal common
                 substrings and abstract syllables. In order to obtain
                 an efficient computation of this formal similarity in
                 large lists, a preselection method is given which uses
                 a simple distance between strings and a precomputed
                 binary relation between character-pairs and keywords.",
  descriptor =   "Informationssystem, Datenbank, Datenbanksystem,
                 Dokumentationssystem, Software-technologie",
}

@Article{Ullmann:1976:BGT,
  author =       "J. R. Ullmann",
  title =        "A binary $n$-gram technique for automatic correction
                 of substitution, deletion, insertion and reversal
                 errors in words",
  journal =      j-COMP-J,
  volume =       "20",
  number =       "2",
  pages =        "140--147",
  year =         "1976",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620",
  bibdate =      "Tue Jul 26 10:29:59 1994",
  acknowledgement = ack-nhfb,
  comment =      "``An $n$--gram is an $n$--character subset of a word.
                 Techniques that are already well known use $n$--grams
                 for detecting and correcting spelling errors in words.
                 This paper offers three basic contributions to
                 $n$--gram technology. First, a method of reducing
                 storage requirements by random superimposed coding.
                 Second, an $n$--gram method for correcting up to two
                 substitutions, insertions, deletions and reversal
                 errors without doing a separate computation for every
                 possible pair of errors.''",
}

@Article{Bourne:1977:FIS,
  author =       "Charles P. Bourne",
  title =        "Frequency and Impact of Spelling Errors in
                 Bibliographic Data Bases",
  journal =      j-INFO-PROC-MAN,
  volume =       "13",
  number =       "1",
  pages =        "1--12",
  month =        "????",
  year =         "1977",
  CODEN =        "IPMADK",
  ISSN =         "0306-4573",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Using a composite sample of over 3600 index terms
                 drawn from 11 different machine-readable bibliographic
                 data bases, estimates were made of the spelling error
                 frequencies of each of these data bases, as well as the
                 frequency of posting to misspelled terms. The terms
                 studied included assigned index terms as well as some
                 terms from titles and abstracts. The frequency of index
                 term misspellings ranged from a high of almost 23\% for
                 one data base to a low of less than one-half \% for
                 another data base. The frequency of posting to
                 misspelled terms ranged from about one posting in 8000
                 citations for one data base, to about one posting in
                 160 citations in another data base. The impact of these
                 error rates is di for the tape supplier, tape user and
                 end user. Some suggestions are given regarding search
                 strategy.",
  acknowledgement = ack-nhfb,
  classification = "723; 901",
  journalabr =   "Inf Process Manage",
  keywords =     "information retrieval systems; data base systems;
                 information services",
}

@Article{Wang:1977:SMD,
  author =       "C. H. C. Wang and P. C. Mitchell and J. S. Rugh and B.
                 W. Basheer",
  title =        "Statistical Method for Detecting Spelling Errors in
                 Large Data Bases",
  journal =      "Digest of Papers --- IEEE Computer Society
                 International Conference",
  volume =       "??",
  number =       "??",
  pages =        "124--128",
  month =        "????",
  year =         "1977",
  CODEN =        "DCSIDU",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Existing computer-assisted methods for detecting
                 spelling errors are prevented from treating very large
                 data bases due to their requirement for large amounts
                 of computation time and\slash or storage. A practical
                 approach is described that combines an automatic
                 statistical detection method with a manual verification
                 procedure. The method is currently used to detect
                 spelling errors in natural language, full-text data
                 bases. Words containing N-grams with relatively low
                 frequencies of occurrence in the text are flagged as
                 spelling error candidates. Misspelled words can be
                 identified from this reduced list via quick
                 proof-reading. Experiments indicate that a
                 quadrigram-matching method is capable of detecting over
                 ninety percent of spelling errors in very large data
                 bases of legal documents.",
  acknowledgement = ack-nhfb,
  classification = "723",
  conference =   "Dig Pap IEEE Comput Soc Int Conf 14th",
  keywords =     "data base systems",
  meetingaddress = "San Francisco, CA, USA",
  meetingdate =  "Feb 28--Mar 3 1977",
  meetingdate2 = "02/28--03/03/77",
}

@Article{Greanias:1978:ASV,
  author =       "E. C. Greanias and W. S. Rosebaum",
  title =        "Automatic Spelling Verification: Towards a System
                 Solution of the Office",
  journal =      "Tsement",
  volume =       "??",
  number =       "??",
  pages =        "225--231",
  month =        "????",
  year =         "1978",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The Automatic Spelling Verification system is a method
                 for automatic spelling verification in a realtime
                 interactive word processing environment. It consists of
                 an extremely compact dictionary and an algorithm for
                 looking up words. The dictionary and the programmed
                 algorithm are stored in a mini-processor taking less
                 than 20K bytes of memory. The secretary or typist
                 simply types her best rendition of a given text onto
                 magnetic cards. The magnetic cards are then read
                 directly into the processor. A dictionary look-up is
                 made for each word and the entire text is printed out.
                 Each word not found in the dictionary is underlined as
                 it is printed. The printout is then returned to the
                 author for proofing, and the underlined words are
                 checked by the author and corrected in the subsequent
                 text revision. Underlined words will be either
                 misspelled words or correctly spelled words that are
                 not in the dictionary. The correctly spelled words not
                 in the dictionary are referred to as False Alarms.
                 Tests have shown that a properly constituted dictionary
                 of only 10,000 words can maintain a False Alarm rate of
                 less than 0. 5\%.",
  acknowledgement = ack-nhfb,
  classification = "745; 723",
  conference =   "Proc of the Jerusalem Conf on Inf Technol, 3rd
                 (JCIT3)",
  keywords =     "business machines; data processing, business; word
                 processing",
  meetingaddress = "Haifa, Isr",
  meetingdate =  "Aug 6--9 1978",
  meetingdate2 = "08/06--09/78",
}

@Article{Sidorov:1979:AWS,
  author =       "A. A. Sidorov",
  title =        "Analysis of Word Similarity in Spelling Correction
                 Systems",
  journal =      j-PROG-COMP-SOFT,
  volume =       "5",
  number =       "4",
  pages =        "274--277",
  month =        jul # "--" # aug,
  year =         "1979",
  CODEN =        "PCSODA",
  ISSN =         "0361-7688",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  note =         "English translation of Russian article in {\em
                 Programmirovanie} 1979, No.4, 65-68 (1979).",
  abstract =     "Automatic spelling correction in programming systems
                 is considered. A measure of word similarity is
                 introduced and an algorithm for computing this measure
                 is proposed.",
  acknowledgement = ack-nhfb,
  classification = "723",
  journalabr =   "Program Comput Software",
  keywords =     "computer programming; computer operating systems; word
                 similarity; automatic spelling correction",
}

@Article{Peterson:1980:CPD,
  author =       "James Lyle Peterson",
  title =        "Computer Programs for Detecting and Correcting
                 Spelling Errors",
  journal =      j-CACM,
  volume =       "23",
  number =       "12",
  pages =        "676--687",
  month =        dec,
  year =         "1980",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sun Feb 04 16:47:16 1996",
  note =         "See remarks
                 \cite{Dunlavey:1981:LES,Miller:1981:LES,Peterson:1981:LES}.",
  acknowledgement = ack-nhfb,
}

@Book{Peterson:1980:CPS,
  author =       "James Lyle Peterson",
  title =        "Computer Programs For Spelling Correction",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vi + 213",
  year =         "1980",
  ISBN =         "3-540-10259-0",
  LCCN =         "QA76.6 .P474",
  bibdate =      "Tue Jul 26 10:30:05 1994",
  acknowledgement = ack-nhfb,
  annote =       "The automatic detection and correction of spelling
                 errors by computers has been a subject of interest for
                 a long time. (Our literature search revealed work as
                 early as 1957.) There have been several papers
                 investigating various algorithms and showing their
                 application to various tasks, generally data entry.
                 Now, however, with the increased interest in computer
                 based text processing (word processing) and the storage
                 of large amounts of textual information in computers
                 (data bases), we suggest that spelling correction will
                 become commonplace. This volume brings together the
                 diverse and scattered work on this topic and shows how
                 it can be applied to create a real general purpose
                 spelling corrector.",
  descriptor =   "Fehlererkennung, Fehlerkorrektur, Orthographie,
                 Programmentwicklung, Programmsystem, Rechtschreibung,
                 Textbearbeitung, Textverarbeitung",
}

@Book{Sippl:1980:ECD,
  author =       "Charles J. Sippl and JoAnn Coffman Mayer",
  title =        "The Essential Computer Dictionary and Speller for
                 Secretaries, Managers, and Office Personnel",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "v + 258",
  year =         "1980",
  ISBN =         "0-13-284364-1 (hardcover), 0-13-284356-0 (paperback)",
  LCCN =         "QA76.15 .S514",
  bibdate =      "Tue Jul 26 10:30:09 1994",
  price =        "US\$13.95 (hardcover), US\$6.95 (paperback)",
  acknowledgement = ack-nhfb,
  annote =       "{\ldots} A ten-page prolog provides a survey of
                 state-of-the-art developments written in reasonably
                 everyday language. {\ldots} What follows is a 250-page
                 glossary of terms.{\ldots}",
  bydate =       "CG",
  byrev =        "Le",
  date =         "11/05/81",
  descriptors =  "Reference;",
  enum =         "2909",
  language =     "English",
  location =     "RWTH-AC-DFV: Bibl.",
  references =   "0",
  revision =     "21/04/91",
}

@Article{Zamora:1980:ADC,
  author =       "Antonio Zamora",
  title =        "Automatic Detection and Correction of Spelling Errors
                 in a Large Data Base",
  journal =      j-J-AM-SOC-INF-SCI,
  volume =       "31",
  number =       "1",
  pages =        "51--57",
  month =        jan,
  year =         "1980",
  CODEN =        "AISJB6",
  ISSN =         "0002-8231",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "This article describes the techniques used to detect
                 and correct spelling errors in the data base of
                 Chemical Abstracts Service. A computer program for
                 spelling error detection achieves a high level of
                 performance using hashing techniques for dictionary
                 look-up and compression. Heuristic procedures extend
                 the dictionary and increase the proportion of
                 misspelled words in the words flagged. Automatic
                 correction procedures are applied only to words which
                 are known to be misspelled; other corrections are
                 performed manually during the normal editorial cycle.
                 The constraints imposed on the selection of a spelling
                 error detection technique by a complex data base, human
                 factors, and high-volume production are discussed.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  journalabr =   "J Am Soc Inf Sci",
  keywords =     "information science; data base systems --- Control;
                 spelling-error detection; spelling-error correction",
}

@InProceedings{Abramovich:1981:FIM,
  author =       "Israel Abramovich and Shimon Hochbaum and Reuven
                 Zilber",
  title =        "First Intelligent Microprocessored Dictionary that
                 Corrects Spelling Errors",
  crossref =     "Baal-Schem:1981:OAK",
  year =         "1981",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  conference =   "Electrotechnology for Development, Proceedings of
                 MELECON '81, 1st Mediterranean Electrotechnical
                 Conference.",
  keywords =     "translating machines; microprocessors; dictionaries;
                 spelling errors; correction; memory organization;
                 translation; word organization",
  meetingaddress = "Tel Aviv, Isr",
  pagecount =    "2",
  sponsor =      "IEEE, New York, NY, USA",
}

@InProceedings{Cannon:1981:OAK,
  author =       "Theodore W. Cannon",
  booktitle =    "Proceedings of the Johns Hopkins 1st National Search
                 for Applications of Personal Computing to Aid the
                 Handicapped",
  title =        "Optically Actuated Keyboard System",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "186--189",
  year =         "1981",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  note =         "IEEE Serv Cent. Piscataway, NJ, USA.",
  acknowledgement = ack-nhfb,
  classification = "717; 461; 722; 723",
  keywords =     "telecommunication links, optical; cerebral palsied
                 children; actuation of keyboards; optical interface
                 applications; aiming of light beam; speak and spell
                 control; programmed optical board",
  meetingaddress = "Baltimore, Md, USA",
  sponsor =      "IEEE Comput Soc, Los Alamitos, Calif, USA; IEEE Tech
                 Comm on Comput and the Handicap, New York, NY, USA",
}

@InProceedings{Cherry:1981:CAW,
  author =       "L. Cherry",
  key =          "Cherry",
  title =        "Computer Aids for Writers",
  crossref =     "ACM:1981:ASS",
  pages =        "61--67",
  year =         "1981",
  bibdate =      "Tue Jul 26 10:30:12 1994",
  abstract =     "For many people, writing is painful and editing one's
                 own prose is difficult, tedious, and errorprone. It is
                 often hard to see which parts of a document are
                 difficult to read or how to transform a wordy sentence
                 into a more concise one. It is even harder to discover
                 that one overuses a particular linguistic construct.
                 The system of programs described here helps writers to
                 evaluate documents and to produce better written and
                 more readable prose. The system consists of programs to
                 measure surface features of text that are important to
                 good writing style as well as programs to do some of
                 the tedious jobs of a copy editor. Some of the surface
                 features measured are readability, sentence and word
                 length, sentence type, word usage, and sentence
                 openers. The copy editing programs find spelling
                 errors, wordy phrases, bad diction, some punctuation
                 errors, double words, and split infinitives.",
  acknowledgement = ack-nhfb,
}

@Article{Dunlavey:1981:LES,
  author =       "Michael R. Dunlavey",
  title =        "Letter to the Editor: On Spelling Correction and
                 Beyond",
  journal =      j-CACM,
  volume =       "24",
  number =       "9",
  pages =        "608--608",
  month =        sep,
  year =         "1981",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sun Feb 04 16:48:13 1996",
  note =         "See
                 \cite{Peterson:1980:CPD,Miller:1981:LES,Peterson:1981:LES}.",
}

@InProceedings{Huston:1981:VVC,
  author =       "Thomas J. Huston",
  title =        "{VCATS 80}: a Visual Computer Augmented Teaching
                 System for the 80'{S}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  year =         "1981",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  note =         "IEEE Serv Cent. Piscataway, NJ, USA.",
  acknowledgement = ack-nhfb,
  classification = "762; 752; 901; 723; 741",
  booktitle =    "Proceedings of the Johns Hopkins 1st National Search
                 for Applications fo Personal Computing to Aid the
                 Handicapped",
  keywords =     "hearing aids; education of hearing impaired; animated
                 finger spelling; interactive graphic animation;
                 instruction of visually impaired; computer-aided
                 teaching systems; individualized learning paths",
  meetingaddress = "Baltimore, Md, USA",
  pagecount =    "61",
  sponsor =      "IEEE Comput Soc, Los Alamitos, Calif, USA; IEEE Tech
                 Comm on Comput and the Handicap, New York, NY, USA",
}

@Article{Johnson:1981:MWS,
  author =       "J. Johnson",
  title =        "Making {WP} smarter",
  journal =      j-DATAMATION,
  volume =       "29",
  number =       "11",
  pages =        "58--62",
  month =        nov,
  year =         "1981",
  CODEN =        "DTMNAT",
  ISSN =         "0011-6963",
  bibdate =      "Sun Jul 24 09:03:39 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; performance",
  subject =      "H.3.4 Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Systems and Software, Question-answering
                 (fact retrieval) systems \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing, Languages
                 \\ I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling \\ H.4.1 Information Systems,
                 INFORMATION SYSTEMS APPLICATIONS, Office Automation,
                 Equipment \\ H.4.1 Information Systems, INFORMATION
                 SYSTEMS APPLICATIONS, Office Automation, Word
                 processing",
}

@Article{Krause:1981:LGN,
  author =       "W. Krause and G. Willee",
  title =        "Lemmatizing German newspaper texts with the aid of an
                 algorithm",
  journal =      j-COMP-HUM,
  volume =       "15",
  number =       "2",
  pages =        "101--113",
  month =        aug,
  year =         "1981",
  CODEN =        "COHUAD",
  ISSN =         "0010-4817",
  bibdate =      "Sat Nov 12 21:45:11 1994",
  note =         "From {\em Computing Reviews\/}: ``Lemmatization is
                 defined as `the (automatic) reduction of word-forms
                 that are related by the morphology of their inflection
                 to a normalized spelling.' Compound words (typical for
                 the German language) are treated as separate
                 lemmata.''",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 39669",
  subject =      "I.7 Computing Methodologies, TEXT PROCESSING, Text
                 Editing \\ J.5 Computer Applications, ARTS AND
                 HUMANITIES, Linguistics",
}

@Article{Miller:1981:LES,
  author =       "Lance A. Miller",
  title =        "Letter to the Editor: On Spelling Correction and
                 Beyond",
  journal =      j-CACM,
  volume =       "24",
  number =       "9",
  pages =        "608--609",
  month =        sep,
  year =         "1981",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sun Feb 04 16:49:22 1996",
  note =         "See
                 \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Peterson:1981:LES}.",
}

@InProceedings{Pain:1981:CAS,
  author =       "Helen Pain",
  title =        "Computer Aid for Spelling Error Classification in
                 Remedial Teaching",
  crossref =     "Lewis:1981:CEP",
  pages =        "297--302",
  year =         "1981",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  classification = "723; 901",
  conference =   "Computers in Education: Proceedings of the IFIP-TC3
                 3rd World Conference on Computers in Education --- WCCE
                 81.",
  journalabr =   "Computers in Education, Proceedings of the IFIP World
                 Conference 3rd.",
  keywords =     "education; computer aided learning; spelling error
                 classification; remedial teaching; computer program",
  meetingaddress = "Lausanne, Switz",
  sponsor =      "IFIP, Geneva, Switz",
}

@Article{Peterson:1981:LES,
  author =       "James L. Peterson",
  title =        "Letter to the Editor: On Spelling Correction and
                 Beyond",
  journal =      j-CACM,
  volume =       "24",
  number =       "9",
  pages =        "609--609",
  month =        sep,
  year =         "1981",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sun Feb 04 16:49:21 1996",
  note =         "See
                 \cite{Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES}.",
}

@InProceedings{Terpenning:1981:CTH,
  author =       "Joseph L. Terpenning",
  title =        "`Computer-Tutor' for the Handicapped",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "74--75",
  year =         "1981",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  note =         "IEEE Serv Cent. Piscataway, NJ, USA.",
  acknowledgement = ack-nhfb,
  classification = "901; 723; 461",
  booktitle =    "Proceedings of the Johns Hopkins 1st National Search
                 for Applications of Personal Computing to Aid the
                 Handicapped",
  keywords =     "education; remediation and drill program; learning of
                 disabled children; computer assisted learning; category
                 of math problems; increase of reading sped; improvement
                 of spelling",
  meetingaddress = "Baltimore, Md, USA",
  sponsor =      "IEEE Comput Soc, Los Alamitos, Calif, USA; IEEE Tech
                 Comm on Comput and the Handicap, New York, NY, USA",
}

@InProceedings{Turba:1981:CST,
  author =       "T. N. Turba",
  title =        "Checking for spelling and typographical errors in
                 computer-based text",
  crossref =     "ACM:1981:ASS",
  pages =        "101--113 (or 51--60??)",
  year =         "1981",
  bibdate =      "Fri Jul 22 23:06:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; design",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling \\ I.2.8 Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Problem Solving, Control
                 Methods, and Search, Graph and tree search strategies
                 \\ D.2.2 Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces",
}

@Article{Asimov:1982:QS,
  author =       "I. Asimov",
  title =        "A question of spelling",
  journal =      j-POP-COMP,
  volume =       "1",
  number =       "9",
  pages =        "106--107",
  month =        jul,
  year =         "1982",
  ISSN =         "0279-4721",
  bibdate =      "Sun Jul 24 09:03:39 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling",
}

@Article{Bomberger:1982:PPS,
  author =       "Alan Bomberger",
  title =        "A poor person's spelling checker",
  journal =      j-DDJ,
  volume =       "7",
  number =       "4",
  pages =        "42--53",
  month =        apr,
  year =         "1982",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Mon Sep 2 09:09:39 MDT 1996",
  bibsource =    "http://www.ddj.com/index/author/index.htm",
  acknowledgement = ack-nhfb,
  keywords =     "performance",
  subject =      "K Computing Milieux, PERSONAL COMPUTING \\ I.7.1
                 Computing Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling",
}

@Article{Comer:1982:HSF,
  author =       "Douglas Comer and Vincent Y. Shen",
  title =        "Hash-Bucket Search --- a Fast Technique for Searching
                 an English Spelling Dictionary",
  journal =      j-SPE,
  volume =       "12",
  number =       "7",
  pages =        "669--682",
  month =        jul,
  year =         "1982",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "When a document is prepared using a computer system,
                 it can be checked for spelling errors automatically and
                 efficiently. Ths study reviews and compares several
                 methods for searching an English spelling dictionary.
                 It also presents a new technique, hash-bucket search,
                 for searching a static table in general, and a
                 dictionary in particular. Analysis shows that with only
                 a small amount of space beyond that required to store
                 the keys, the hash-bucket search method has many
                 advantages over existing methods. Experimental results
                 with a sample dictionary using double hashing and the
                 hash-bucket techniques are presented.",
  acknowledgement = ack-nhfb,
  classification = "723",
  journalabr =   "Software Pract Exper",
  keywords =     "computer programming",
}

@Article{Edmonds:1982:SCI,
  author =       "James D. {Edmonds, Jr.}",
  title =        "Speed-Spelling: Could It Work in the Twenty-First
                 Century?",
  journal =      "Speculations in Science and Technology",
  volume =       "5",
  number =       "4",
  pages =        "375--378",
  month =        oct,
  year =         "1982",
  CODEN =        "SPSTDD",
  ISSN =         "0155-7785",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Speculation is advanced as to whether it is possible
                 for the spelling of the English language to be changed,
                 and such change to be widely accepted. Minicomputers
                 seem to be the key to making such an innovation now
                 possible. Since English has become (for all practical
                 purposes) the international language, billions of
                 persons for generations to come could be directly
                 benefited.",
  acknowledgement = ack-nhfb,
  classification = "901; 751; 723",
  journalabr =   "Speculations Sci Technol",
  keywords =     "information science; speech --- Computer Applications;
                 speed-spelling; changes in English language spelling",
}

@InCollection{Ehrenreich:1982:AAS,
  author =       "S. L. Ehrenreich and T. Porcu",
  title =        "Abbreviations for automated systems: teaching
                 operators the rules",
  crossref =     "Badre:1982:DHC",
  pages =        "111--135",
  year =         "1982",
  bibdate =      "Fri Aug 19 11:57:37 1994",
  abstract =     "One way to improve performance on abbreviations is to
                 inform operators of the rules used to generate the
                 abbreviations. This was tested in a series of rating,
                 encoding, and decoding experiments which compared the
                 benefits of truncation versus contraction and fixed
                 versus variable length abbreviations. In addition, the
                 advisability of representing common suffixes (ING, ED,
                 S) in abbreviations was tested along with a technique
                 for dealing with the problem of a simple rule
                 generating the same abbreviation for more than one
                 word. Based upon the results of these experiments,
                 guidelines for generating abbreviations are
                 presented.",
  acknowledgement = ack-nhfb,
  keywords =     "experimentation; human factors",
  review =       "ACM CR 40340",
  subject =      "D.m Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems \\ H.1 Information Systems,
                 DATABASE MANAGEMENT, Languages, Query languages \\
                 H.2.3 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling \\ I.7.1",
}

@Article{Frantz:1982:DCH,
  author =       "G. A. Frantz and R. H. Wiggins",
  title =        "Design case history: speak and spell learns to talk",
  journal =      j-IEEE-SPECTRUM,
  volume =       "19",
  number =       "2",
  pages =        "45--49",
  month =        feb,
  year =         "1982",
  CODEN =        "IEESAM",
  ISSN =         "0018-9235",
  bibdate =      "Sun Jul 24 09:03:39 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; documentation; human factors",
  subject =      "I.6 Computing Methodologies, SIMULATION AND MODELING,
                 Applications \\ K.3.1 Computing Milieux, COMPUTERS AND
                 EDUCATION, Computer Uses in Education,
                 Computer-assisted instruction (CAI) \\ K.2 Computing
                 Milieux, HISTORY OF COMPUTING, Software",
}

@InCollection{Kernighan:1982:UDP,
  author =       "B. W. Kernighan and M. E. Lesk",
  title =        "{UNIX} document preparation",
  crossref =     "Nievergelt:1982:DPS",
  pages =        "1--20",
  year =         "1982",
  bibdate =      "Sat Nov 12 21:45:03 1994",
  note =         "From {\em Computing Reviews\/}: ``{\ldots} introduces
                 {\tt ed}, {\tt nroff}\slash {\tt troff}, {\tt eqn},
                 {\tt tbl}, {\tt refer}, and {\tt pic}, and touches on
                 {\tt spell}, {\tt style}, and {\tt diction}.''",
  acknowledgement = ack-nhfb,
  keywords =     "documentation; languages",
  review =       "ACM CR 40430",
  subject =      "D.4.0 Software, OPERATING SYSTEMS, General, UNIX \\
                 I.7 Computing Methodologies, TEXT PROCESSING, Text
                 Editing \\ I.7 Computing Methodologies, TEXT
                 PROCESSING, Document Preparation",
}

@Article{McIlroy:1982:DSL,
  author =       "M. Douglas McIlroy",
  title =        "Development of a Spelling List",
  journal =      j-IEEE-TRANS-COMM,
  volume =       "COM-30",
  number =       "1 pt 1",
  pages =        "91--99",
  month =        jan,
  year =         "1982",
  CODEN =        "IECMBT",
  ISSN =         "0096-1965",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The work list used by the UNIX spelling checker,
                 SPELL, was developed from many sources over several
                 years. As the spelling checker may be used on
                 minicomputers, it is important to make the list as
                 compact as possible. Stripping prefixes and suffixes
                 reduces the list below one third of its original size,
                 hashing discards 60 percent of the bits that remain,
                 and data compression halves it once again. This paper
                 tells how the spelling checker works, how the words
                 were chosen, how the spelling checker was used to
                 improve itself, and how the (reduced) list of 30,000
                 English words was squeezed into 26,000 16-bit machine
                 words.",
  acknowledgement = ack-nhfb,
  classification = "721; 901; 723",
  journalabr =   "IEEE Trans Commun",
  keywords =     "automata theory; information science --- Vocabulary
                 Control; data processing --- Word Processing; UNIX
                 spelling checker, spell",
}

@Article{McWilliams:1982:W,
  author =       "P. McWilliams",
  title =        "Word",
  journal =      j-POP-COMP,
  volume =       "1",
  number =       "5",
  pages =        "120--121",
  month =        mar,
  year =         "1982",
  ISSN =         "0279-4721",
  bibdate =      "Sun Jul 24 09:03:39 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "human factors; design; documentation",
  subject =      "K Computing Milieux, PERSONAL COMPUTING \\ I.7.1
                 Computing Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling",
}

@Article{Mor:1982:HCM,
  author =       "M. Mor and A. S. Fraenkel",
  title =        "A Hash Code Method for Detecting and Correcting
                 Spelling Errors",
  journal =      j-CACM,
  volume =       "25",
  number =       "12",
  pages =        "935--940 (or 935--938??)",
  month =        dec,
  year =         "1982",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The most common spelling errors are one extra letter,
                 one missing letter, one wrong letter, or the
                 transposition of two letters. Deletion, exchange, and
                 rotation operators are defined which detect and
                 ``mend'' such spelling errors and thus permit retrieval
                 despite the errors. These three operators essentially
                 delete a letter of a word, exchange two adjacent
                 letters, and rotate a word cyclically. Moreover, the
                 operators can be used in conjunction with hashing, thus
                 permitting very fast retrieval. Results of experiments
                 run on large databases in Hebrew and in English are
                 briefly indicated.",
  acknowledgement = ack-nhfb,
  classification = "723; 901",
  journalabr =   "Commun ACM",
  keywords =     "information science; algorithms; performance",
  review =       "ACM CR 40850",
  subject =      "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table
                 representations \\ H.3.1 Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
                 Indexing, Dictionaries \\ H.3.3 Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Information Search
                 and Retrieval, Search process \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling",
}

@InProceedings{Mor:1982:REF,
  author =       "Moshe Mor and Aviezri S. Fraenkel",
  title =        "Retrieval in an Environment of Faulty Texts or Faulty
                 Queries",
  crossref =     "Scheuermann:1982:PSI",
  pages =        "405--425",
  year =         "1982",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  classification = "723; 901",
  conference =   "Improving Database Usability and Responsiveness.",
  journalabr =   "Proc Int Conf Datab",
  keywords =     "information systems; faulty texts; faulty queries;
                 deletion operator; exchange operator; rotation
                 operator; spelling errors",
  meetingaddress = "Jerusalem, Isr",
  sponsor =      "Hebrew Univ of Jerusalem, Jerusalem, Isr; Information
                 Processing Assoc of Israel, Isr; Northwestern Univ,
                 Evanston, Ill, USA; ACM, New York, NY, USA",
}

@InProceedings{Peterson:1982:UWS,
  author =       "J. L. Peterson",
  title =        "Use of Webster's Seventh Collegiate Dictionary to
                 Construct a Master Hyphenation List",
  crossref =     "Morgan:1982:NCC",
  pages =        "665--670",
  year =         "1982",
  bibdate =      "Sat Nov 12 21:44:55 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Format and notation \\ I.2
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Natural Language Processing \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling",
}

@Article{Pollock:1982:ASE,
  author =       "Joseph J. Pollock and Antonio Zamora",
  title =        "Automatic Spelling Error Detection and Correction in
                 Textual Databases",
  journal =      j-PROC-ASIS-AM,
  volume =       "19",
  pages =        "236--238",
  year =         "1982",
  CODEN =        "PAISDQ",
  ISBN =         "0-86729-038-2",
  ISSN =         "0044-7870",
  LCCN =         "Z699.A1 .A5 1982",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  conference =   "Information Interaction, Proceedings of the 45th ASIS
                 Annual Meeting.",
  journalabr =   "Proc ASIS Annu Meet",
  keywords =     "information science; automatic spelling; textual
                 databases; dictionary words; error
                 detection/correction; misspellings; correction
                 algorithms",
  meetingaddress = "Columbus, OH, USA",
  sponsor =      "ASIS, Washington, DC, USA",
}

@Article{Pollock:1982:SED,
  author =       "J. J. Pollock",
  title =        "Spelling Error Detection and Correction by Computer:
                 Some Notes and a Bibliography",
  journal =      j-J-DOC,
  volume =       "38",
  number =       "4",
  pages =        "282--291",
  month =        dec,
  year =         "1982",
  CODEN =        "JDOCAS",
  ISSN =         "0022-0418",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "This note attempts to provide a comprehensive
                 bibliography of papers in English on the major aspects
                 of spelling error detection and correction of English
                 text.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  comment =      "interesting bibliography",
  journalabr =   "J Doc",
  keywords =     "information science; performance",
  subject =      "J.5 Computer Applications, ARTS AND HUMANITIES,
                 Literature \\ H.4.1 Information Systems, INFORMATION
                 SYSTEMS APPLICATIONS, Office Automation, Word
                 processing \\ I.7.1 Computing Methodologies, TEXT
                 PROCESSING, Text Editing, Spelling A General
                 Literature, REFERENCE",
}

@InProceedings{Rosenthal:1982:SCC,
  author =       "Eric S. Rosenthal",
  title =        "Spelling Checkers, Compound Words, and Variant
                 Spellings",
  crossref =     "USENIX:1982:UAS",
  pages =        "315--322",
  month =        "Summer",
  year =         "1982",
  bibdate =      "Tue Jul 26 10:30:22 1994",
  acknowledgement = ack-nhfb,
}

@Book{Stultz:1982:WPH,
  author =       "R. A. Stultz",
  title =        "The word processing handbook",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "237",
  year =         "1982",
  ISBN =         "0-13-963454-1, 0-13-963447-9 (paperback)",
  LCCN =         "HF5548.115 .S78",
  bibdate =      "Fri Aug 19 11:38:39 1994",
  price =        "US\$17.95",
  acknowledgement = ack-nhfb,
  keywords =     "management",
  review =       "ACM CR 38951",
  subject =      "H.4.1 Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation, Word processing \\ I.7
                 Computing Methodologies, TEXT PROCESSING, Miscellaneous
                 \\ J.1 Computer Applications, ADMINISTRATIVE DATA
                 PROCESSING, Business \\ K.6 Computing Milieux,
                 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS,
                 Installation Management",
}

@Article{Terrell:1982:EEL,
  author =       "C. D. Terrell and O. Linyard",
  title =        "Evaluation of Electronic Learning Aids: {Texas
                 Instruments' ``Speak Spell''}",
  journal =      j-INT-J-MAN-MACHINE-STUDIES,
  volume =       "17",
  number =       "1",
  pages =        "59--67",
  month =        jul,
  year =         "1982",
  CODEN =        "IJMMBC",
  ISSN =         "0020-7373",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "An evaluation of an electronic learning aid, the Texas
                 Instruments ``Speak Spell'' is described. This machine
                 is marketed as a spelling aid. Spelling performance was
                 monitored for two groups of normal 12-year-old girls, a
                 control group and a treatment group. The treatment
                 group used the ``Speak Spell'' machine in their own
                 homes for a period of 14 days. A significant increase
                 in the spelling of words in the machine's lexicon was
                 observed for the treatment group but this appeared to
                 be only a transitory increase because spelling
                 performance on these words began to drop to pre-machine
                 exposure levels once the opportunity to use the machine
                 was removed. No improvement was observed in the
                 spelling of words not in the machine's lexicon.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  journalabr =   "Int J Man Mach Stud",
  keywords =     "education; human factors; measurement; documentation",
  subject =      "K.3.1 Computing Milieux, COMPUTERS AND EDUCATION,
                 Computer Uses in Education, Computer-assisted
                 instruction (CAI)",
}

@InProceedings{Thimbleby:1982:BUE,
  author =       "H. Thimbleby",
  title =        "Basic User Engineering Principles for Display
                 Editors",
  crossref =     "Williams:1982:PIS",
  pages =        "537--541",
  year =         "1982",
  bibdate =      "Fri Jul 22 23:14:42 1994",
  acknowledgement = ack-nhfb,
  keywords =     "theory; design; human factors",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Languages \\ D.2.2 Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, User interfaces \\
                 D.4.7 Software, OPERATING SYSTEMS, Organization and
                 Design, Interactive systems \\ H.4.1 Information
                 Systems, INFORMATION SYSTEMS APPLICATIONS, Office
                 Automation, Word processing \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling",
}

@Article{Turba:1982:LSL,
  author =       "T. N. Turba",
  title =        "Length-segmented lists",
  journal =      j-CACM,
  volume =       "25",
  number =       "8",
  pages =        "522--526",
  month =        aug,
  year =         "1982",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; languages",
  subject =      "D.4.3 Software, OPERATING SYSTEMS, File Systems
                 Management, Access methods \\ D.4.3 Software, OPERATING
                 SYSTEMS, File Systems Management, Directory structures
                 \\ H.2.2 Information Systems, DATABASE MANAGEMENT,
                 Physical Design, Access methods \\ H.3.1 Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Content
                 Analysis and Indexing, Dictionaries \\ E.1 Data, DATA
                 STRUCTURES, Lists \\ E.1 Data, DATA STRUCTURES, Tables
                 \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Contiguous
                 representations \\ H.3.1 Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
                 Indexing, Indexing methods \\ H.4.1 Information
                 Systems, INFORMATION SYSTEMS APPLICATIONS, Office
                 Automation, Word processing \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling",
}

@Book{Weiss:1982:WSE,
  author =       "E. H. Weiss",
  title =        "The writing system for engineers and scientists",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 274",
  year =         "1982",
  ISBN =         "0-13-971606-8",
  LCCN =         "T11 .W44",
  bibdate =      "Fri Aug 19 11:38:32 1994",
  price =        "US\$16.95",
  acknowledgement = ack-nhfb,
  keywords =     "management",
  review =       "ACM CR 39208",
  subject =      "I.7 Computing Methodologies, TEXT PROCESSING, Document
                 Preparation \\ K.6 Computing Milieux, MANAGEMENT OF
                 COMPUTING AND INFORMATION SYSTEMS, Miscellaneous K
                 Computing Milieux, MISCELLANEOUS",
}

@Article{Angell:1983:ASC,
  author =       "Richard C. Angell and George E. Freund and Peter
                 Willett",
  title =        "Automatic Spelling Correction Using a Trigram
                 Similarity Measure",
  journal =      j-INFO-PROC-MAN,
  volume =       "19",
  number =       "4",
  pages =        "255--261",
  month =        "????",
  year =         "1983",
  CODEN =        "IPMADK",
  ISSN =         "0306-4573",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A nearest neighbor search procedure is described for
                 the automatic correction of misspellings. The
                 procedure involves the replacement of a misspelt word
                 by that word in a dictionary which best matches the
                 misspelling, the degree of match being calculated using
                 a similarity coefficient based on the number of
                 trigrams common to the two words.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  journalabr =   "Inf Process Manage",
  keywords =     "information science; languages; experimentation;
                 documentation",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling",
}

@Article{Arceneaux:1983:PMS,
  author =       "C. D. Arceneaux",
  title =        "A poor man's spelling checker",
  journal =      j-CREATIVE-COMP,
  volume =       "9",
  number =       "6",
  pages =        "228--236",
  month =        jun,
  year =         "1983",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "verification",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, BASIC K Computing Milieux, PERSONAL
                 COMPUTING \\ H.3.1 Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Content Analysis and Indexing,
                 Dictionaries \\ J.5 Computer Applications, ARTS AND
                 HUMANITIES, Literature",
}

@Article{Arnold:1983:DD,
  author =       "T. A. Arnold",
  title =        "Dictionary disk",
  journal =      j-A-PLUS,
  volume =       "1",
  number =       "2",
  pages =        "142--144",
  month =        dec,
  year =         "1983",
  CODEN =        "AAAAE6",
  ISSN =         "0740-1590",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "human factors; documentation",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling \\ K.8 Computing Milieux, PERSONAL
                 COMPUTING, Apple \\ H.3.1 Information Systems,
                 INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
                 Indexing, Dictionaries",
}

@Article{Durham:1983:SCU,
  author =       "Ivor Durham and David A. Lamb and James B. Saxe",
  title =        "Spelling Correction in User Interfaces",
  journal =      j-CACM,
  volume =       "26",
  number =       "10",
  pages =        "764--773",
  month =        oct,
  year =         "1983",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The feasibility of providing a spelling corrector as a
                 part of interactive user interfaces is demonstrated.
                 The issues involved in using spelling correction in a
                 user interface are examined, and a simple correction
                 algorithm is described. The results of an experiment in
                 which the corrector is incorporated into a heavily used
                 interactive program are described. More than one
                 quarter of the errors made by users during the
                 experiment were corrected using the simple mechanisms
                 presented here. From this it is concluded that there
                 are considerable benefits and few obstacles to
                 providing a spelling corrector in almost any
                 interactive user interface.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  journalabr =   "Commun ACM",
  keywords =     "computer interfaces; algorithms; human factors",
  subject =      "D.1 Software, PROGRAMMING TECHNIQUES, General \\ D.2.2
                 Software, SOFTWARE ENGINEERING, Tools and Techniques,
                 Software libraries \\ D.2.2 Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, User interfaces \\
                 H.1.2 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors",
}

@Book{Gonnet:1983:UDB,
  author =       "Gaston H. Gonnet",
  title =        "Unstructured Data Bases or Very Efficient Text
                 Searching",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "117--124",
  year =         "1983",
  ISBN =         "0-89791-097-4",
  LCCN =         "????",
  bibdate =      "Sat Jan 25 17:38:12 MST 1997",
  bibsource =    "Compendex database",
  note =         "ACM (order n 475830). Baltimore, MD, USA.",
  abstract =     "Several algorithms are presented for searching data
                 bases that consist of text. The algorithms apply mostly
                 to very large data bases that are difficult to
                 structure. Algorithms are described which search the
                 original data base without transformation and hence
                 could be used as general text searching algorithms.
                 Also described are algorithms requiring pre-processing,
                 the best of them achieving a logarithmic behaviour.
                 These efficient algorithms solve the `plagiarism'
                 problem among n papers. The problem of misspellings,
                 ambiguous spellings, simple errors, endings, positional
                 information, etc. is treated using signature
                 functions.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Univ of Waterloo, Dep of Computer Science,
                 Waterloo, Ont, Can",
  classification = "723; 901; 722",
  conference =   "Proceedings of the Second ACM SIGACT-SIGMOD Symposium
                 on Principles of Database Systems.",
  keywords =     "computer programming --- Algorithms; computer systems,
                 digital --- On Line Operation; data processing --- Data
                 Handling; database systems; Design; full text search;
                 hashing; information retrieval systems --- Online
                 Searching; pattern matching; string searching; text
                 searching algorithms; unstructured data bases",
  meetingaddress = "Atlanta, GA, USA",
  sponsor =      "ACM, Special Interest Group for Automata \&
                 Computability Theory, New York, NY, USA; ACM, Special
                 Interest Group for the Management of Data, New York,
                 NY, USA",
}

@Misc{Grimes:1983:DDE,
  author =       "Gary J. Grimes",
  title =        "Digital Data Entry Glove Interface Device",
  type =         "United States Patent 4414537",
  publisher =    pub-ATT-BTL,
  address =      pub-ATT-BTL:adr,
  month =        nov # " 8",
  year =         "1983",
  bibdate =      "Tue Jul 26 10:30:30 1994",
  note =         "(Keywords: human interface, finger spelling)",
  acknowledgement = ack-nhfb,
}

@Article{Hickey:1983:KSS,
  author =       "Bob Hickey",
  title =        "{Kaypro} Steps up its Software",
  journal =      "Microcomputing",
  volume =       "7",
  number =       "12",
  pages =        "70--73",
  month =        dec,
  year =         "1983",
  CODEN =        "MIRCDC",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A new assortment of Kaypro software is introduced to
                 be used with Kaypro 10 microcomputer to take advantage
                 of its 10 megabyte of hard disk memory. The bundled
                 software includes a word processor, spelling
                 checker\slash corrector, a menu driven financial
                 planning program, a modem program, and three other
                 software business applications in BASIC. Structured
                 BASIC keywords for Pascal-like environment are also
                 considered.",
  acknowledgement = ack-nhfb,
  classification = "723",
  journalabr =   "Microcomputing",
  keywords =     "computer software; computers, microprocessor ---
                 Applications; data processing, business --- Word
                 Processing; computer programming languages --- basic;
                 data processing --- Financial Applications; data
                 storage, magnetic --- Disk; Kaypro 10 microcomputer;
                 spelling checker/corrector; financial planning; hard
                 disk memory; modem program",
}

@Article{Ito:1983:HFO,
  author =       "Tetsuro Ito and Makoto Kizawa",
  title =        "Hierarchical File Organization and its Application to
                 Similar-String Matching",
  journal =      j-TODS,
  volume =       "8",
  number =       "3",
  pages =        "410--433",
  month =        sep,
  year =         "1983",
  CODEN =        "ATDSD3",
  ISSN =         "0362-5915",
  bibdate =      "Sat Dec 7 10:14:22 MST 1996",
  bibsource =    "Compendex database, Database/Graefe.bib,
                 Database/Wiederhold.bib",
  abstract =     "The automatic correction of misspelled inputs is
                 discussed from a viewpoint of similar-string matching.
                 First a hierarchical file organization based on a
                 linear ordering of records is presented for retrieving
                 records highly similar to any input query. Then the
                 spelling problem is attacked by constructing a
                 hierarchical file for a set of strings in a dictionary
                 of English words. The spelling correction steps proceed
                 as follows: (1) find one of the best-match strings
                 which ae most similar to a query, (2) expand the search
                 area for obtaining the good-match strings, and (3)
                 interrupt the file search as soon as the required
                 string is displayed. Computational experiments verify
                 the performance of the proposed methods for
                 similar-string matching under the UNIX time-sharing
                 system.",
  acknowledgement = ack-nhfb,
  annote =       "A spelling checker to provide possible correct
                 spellings for all possible words. Results are quite
                 sketchy",
  classification = "723",
  keywords =     "data processing, algorithms; experimentation;
                 measurement; performance; theory; verification",
  review =       "ACM CR 8408-0665",
  subject =      "I.2 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Natural Language Processing \\ I.5.4 Computing
                 Methodologies, PATTERN RECOGNITION, Applications, Text
                 processing \\ E.5 Data, FILES, Organization/structure
                 \\ H.3.2 Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Information Storage, File organization \\
                 H.3.3 Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Information Search and Retrieval, Search
                 process \\ H.3.3 Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Information Search and
                 Retrieval, Selection process \\ H.4 Information
                 Systems, INFORMATION SYSTEMS APPLICATIONS, Office
                 Automation",
}

@Article{Parrott:1983:SDI,
  author =       "R. D. Parrott",
  title =        "Spelling Dictionary Incorporating Word Association",
  journal =      j-IBM-TDB,
  volume =       "25",
  number =       "11B",
  pages =        "6246--6247",
  month =        apr,
  year =         "1983",
  CODEN =        "IBMTAA",
  ISSN =         "0018-8689",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A technique is described for enhancing a spelling
                 dictionary utilized in a word processing device for
                 checking the correct spelling of words within a
                 document. It includes a word association feature,
                 thereby allowing the dictionary to act as a thesaurus
                 identifying synonyms and antonyms for each word of the
                 dictionary.",
  acknowledgement = ack-nhfb,
  classification = "723",
  journalabr =   "IBM Tech Discl Bull",
  keywords =     "data processing",
}

@Article{Pollock:1983:CCS,
  author =       "J. J. Pollock and A. Zamora",
  title =        "Collection and Characterization of Spelling Errors in
                 Scientific and Scholarly Text",
  journal =      j-J-AM-SOC-INF-SCI,
  volume =       "34",
  number =       "1",
  pages =        "51--58",
  month =        jan,
  year =         "1983",
  CODEN =        "AISJB6",
  ISSN =         "0002-8231",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The SPEEDCOP (SPElling Error Detection COrrection
                 Project) project recently completed at Chemical
                 Abstracts Service extracted over 50,000 misspellings
                 from approximately 25,000,000 words of text from seven
                 scientific and scholarly databases. The misspellings
                 were automatically classified and the error types
                 analyzed. The results, which were consistent over the
                 different databases, showed that the expected incidence
                 of misspelling is 0. 2\%, that 90-95\% of spelling
                 errors have only a single mistake, that substitution is
                 homogeneous while transposition is heterogeneous, that
                 omission is the commonest type of misspelling, and that
                 inadvertent doubling of a letter is the most important
                 cause of insertion errors. The more frequently a letter
                 occurs in the text, the more likely it is to be
                 involved in a spelling error. Most misspellings
                 collected by SPEEDCOP are of the type colloquially
                 referred to as `typos' and approximately 90\% are
                 unlikely to be repeated in normal spans of text. 20
                 rfs.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  journalabr =   "J Am Soc Inf Sci",
  keywords =     "languages; engineering writing; spelling errors",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling",
}

@InProceedings{Radue:1983:DIS,
  author =       "Jon Radue",
  title =        "On the Design of an Interactive Spelling Dictionary
                 for Personal Computers",
  crossref =     "ACM:1983:ACP",
  pages =        "197--199",
  year =         "1983",
  bibdate =      "Tue Jul 26 09:55:25 1994",
  bibsource =    "Compendex database",
  note =         "ACM (Order n 609830). Baltimore, MD, USA.",
  abstract =     "The major spelling error detection techniques are
                 briefly reviewed. The virtual hashing technique is
                 described, and results indicate that it could be an
                 efficient way of storing and searching an interactive
                 dictionary on a personal computer.",
  acknowledgement = ack-nhfb,
  affiliation =  "Brock Univ, Dep of Computer Science \& Information
                 Processing, St. Catharines, Ont, Can",
  affiliationaddress = "Brock Univ, Dep of Computer Science \&
                 Information Processing, St. Catharines, Ont, Can",
  classification = "722; 723; 901",
  conference =   "1983 ACM Conference on Personal and Small Computers.",
  journalabr =   "SIGPC Notes (ACM Special Interest Group on Personal
                 Computing)",
  keywords =     "design; human factors; computer systems, digital;
                 Interactive Operation; data processing --- Word
                 Processing; error correction facilities; virtual
                 hashing technique; information retrieval field; text
                 string valid work determination; dictionary lookup",
  meetingaddress = "San Diego, CA, USA",
  sponsor =      "ACM, Special Interest Group on Personal Computing, New
                 York, NY, USA; ACM, Special Interest Group on Small
                 Computing Systems \& Applications, New York, NY, USA",
  subject =      "K Computing Milieux, PERSONAL COMPUTING \\ I.7.1
                 Computing Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling \\ H.1.2 Information Systems, MODELS AND
                 PRINCIPLES, User/Machine Systems, Human factors",
}

@Article{Robinson:1983:EWM,
  author =       "D. Robinson",
  title =        "{Electric Webster}: much more than a spelling
                 checker",
  journal =      j-CREATIVE-COMP,
  volume =       "9",
  number =       "11",
  pages =        "108--112",
  month =        nov,
  year =         "1983",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "performance",
  subject =      "H.3.1 Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Content Analysis and Indexing, Dictionaries
                 \\ H.4.1 Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation, Word processing K
                 Computing Milieux, PERSONAL COMPUTING \\ J.5 Computer
                 Applications, ARTS AND HUMANITIES, Literature \\ K.6.3
                 Computing Milieux, MANAGEMENT OF COMPUTING AND
                 INFORMATION SYSTEMS, Software Management, Software
                 selection",
}

@Article{Smith:1983:SDL,
  author =       "M. W. A. Smith",
  title =        "Stylometry: the detection of literary authorship",
  journal =      j-COMP-BULL,
  volume =       "2",
  number =       "35",
  pages =        "8--9, 11",
  month =        mar,
  year =         "1983",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages",
  subject =      "J.5 Computer Applications, ARTS AND HUMANITIES,
                 Literature \\ I.7.1 Computing Methodologies, TEXT
                 PROCESSING, Text Editing, Languages \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing, Spelling
                 \\ I.2.7 Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Natural Language Processing, Text
                 analysis",
}

@InProceedings{Smith:1983:UWW,
  author =       "C. R. Smith and K. E. Kiefer",
  title =        "Using the Writer's Workbench programs at Colorado
                 State University",
  crossref =     "Burton:1983:SIC",
  pages =        "672--684",
  year =         "1983",
  bibdate =      "Sat Nov 12 21:44:43 1994",
  note =         "From {\em Computing Reviews\/}: ``The Writer's
                 Workbench programs described include: ORGANIZATION;
                 DEVELOPMENT; FINDBE; DICTION; SUGGEST; SPELL;
                 PUNCTUATION; GRAMMAR; STYLE; PROSE; ABSTRACT;
                 VAGUENESS; and CHECK. The latter two programs were
                 developed at CSU for inclusion in the package. In
                 combination, the thirteen programs produce some five to
                 six pages of analysis to aid students in revision
                 before their papers are handed in for marking.''",
  acknowledgement = ack-nhfb,
  keywords =     "documentation; experimentation; human factors;
                 languages",
  review =       "ACM CR 8405-0410",
  subject =      "I.7 Computing Methodologies, TEXT PROCESSING, Text
                 Editing \\ J.5 Computer Applications, ARTS AND
                 HUMANITIES, Literature \\ K.3 Computing Milieux,
                 COMPUTERS AND EDUCATION, Computer Uses in Education",
}

@Article{Srihari:1983:IDK,
  author =       "S. N. Srihari and J. J. Hull and R. Choudhari",
  title =        "Integrating diverse knowledge sources in text
                 recognition",
  journal =      j-TOOIS,
  volume =       "1",
  number =       "1",
  pages =        "68--87",
  month =        jan,
  year =         "1983",
  CODEN =        "ATOSDO",
  ISSN =         "0734-2047",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  series =       "Res. Contributions",
  abstract =     "A new algorithm for text recognition that corrects
                 character substitution errors in words of text is
                 presented. The search for a correct word effectively
                 integrates three knowledge sources: channel
                 characteristics, bottom-up context, and top-down
                 context. Channel characteristics are used in the form
                 of probabilities that observed letters are corruptions
                 of other letters; bottom-up context is in the form of
                 the probability of a letter when the previous letters
                 of the word are known; and top-down context is in the
                 form of a lexicon. A one-pass algorithm is obtained by
                 merging a previously known dynamic programming
                 algorithm to compute the maximum a posteriori
                 probability string (known as the Viterbi algorithm)
                 with searching a lexical trie. Analysis of the
                 computational complexity of the algorithm and results
                 of experimentation with a PASCAL implementation are
                 presented.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; theory; TOOIS TOIS Inf.
                 systems applications; Office automation; Word
                 processing; Artificial intelligence; Problem solving;
                 Control methods and search; Dynamic programming; Graph
                 and tree search strategies; Pattern recognition;
                 Applications; Text processing; Text processing; Text
                 editing; Spelling; Algorithms; Theory; Knowledge
                 integration",
  review =       "ACM CR 40355",
  subject =      "H.4.1 Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation, Word processing \\
                 I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Problem Solving, Control Methods, and Search, Dynamic
                 programming \\ I.2.8 Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Problem Solving, Control
                 Methods, and Search, Graph and tree search strategies
                 \\ I.5.4 Computing Methodologies, PATTERN RECOGNITION,
                 Applications, Text processing \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing,
                 Spelling",
}

@Article{Thomas:1983:DDE,
  author =       "R. Thomas and B. Gustafson",
  title =        "The design, development and evaluation of a low-cost
                 computer-managed spelling system",
  journal =      j-AEDS,
  volume =       "16",
  number =       "3",
  pages =        "168--176",
  month =        "Spring",
  year =         "1983",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "management; human factors",
  subject =      "K.3.1 Computing Milieux, COMPUTERS AND EDUCATION,
                 Computer Uses in Education, Computer-managed
                 instruction (CMI)",
}

@InProceedings{VanPelt:1983:AAU,
  author =       "W. V. Van Pelt",
  title =        "Another approach to using Writer's Workbench programs:
                 small class applications",
  crossref =     "Burton:1983:SIC",
  pages =        "725--729",
  year =         "1983",
  bibdate =      "Tue Jul 26 09:59:52 1994",
  acknowledgement = ack-nhfb,
  keywords =     "documentation; human factors; languages",
  review =       "ACM CR 8405-0411",
  subject =      "I.7 Computing Methodologies, TEXT PROCESSING, Text
                 Editing \\ J.5 Computer Applications, ARTS AND
                 HUMANITIES, Literature \\ K.3 Computing Milieux,
                 COMPUTERS AND EDUCATION, Computer Uses in Education",
}

@Article{Witten:1983:RKN,
  author =       "Ian H. Witten and John G. Cleary and John J. Darragh",
  title =        "Reactive Keyboard: a New Technology for Text Entry",
  journal =      "Proceedings --- Canadian Information Processing
                 Society",
  pages =        "151--156",
  year =         "1983",
  CODEN =        "PCISE7",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  classification = "745; 723; 722; 716; 721",
  conference =   "Proceedings --- Canadian Information Processing
                 Society: Converging Technologies.",
  journalabr =   "Proc Can Inf Proc Soc",
  keywords =     "typewriters; reactive keyboards; spelling; syntax
                 checkers; vocabulary; adaptive models; text entries",
  meetingaddress = "Ottawa, Ont, Can",
  sponsor =      "Canadian Information Processing Soc, Toronto, Ont,
                 Can",
}

@Article{Wright:1983:PTS,
  author =       "P. Wright and A. Lickorish",
  title =        "Proof-reading texts on screen and paper",
  journal =      j-BEHAV-INF-TECH,
  volume =       "2",
  number =       "3",
  pages =        "227--235",
  month =        jul # "--" # sep,
  year =         "1983",
  CODEN =        "BEITD5",
  ISSN =         "0144-929X",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "economics; experimentation; human factors",
  review =       "ACM CR 8405-0404",
  subject =      "H.1.2 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human information processing \\
                 I.7 Computing Methodologies, TEXT PROCESSING, Document
                 Preparation \\ I.7 Computing Methodologies, TEXT
                 PROCESSING, Text Editing",
}

@Article{Yannakoudakis:1983:ISE,
  author =       "E. J. Yannakoudakis and D. Fawthrop",
  title =        "An intelligent spelling error corrector",
  journal =      j-INFO-PROC-MAN,
  volume =       "19",
  number =       "2",
  pages =        "101--108",
  month =        "????",
  year =         "1983",
  CODEN =        "IPMADK",
  ISSN =         "0306-4573",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "An intelligent spelling error correction system for
                 use in a word processing environment is described. The
                 system employs a dictionary of 93,769 words and
                 provided the intended work is in the dictionary it
                 identifies 80 to 90\% of spelling and typing errors.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  journalabr =   "Inf Process Manage",
  keywords =     "information science; computer programming ---
                 Algorithms; data processing --- Word Processing;
                 spelling errors; intelligent spelling-error corrector;
                 design; documentation",
  subject =      "H.3.1 Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Content Analysis and Indexing, Linguistic
                 processing \\ H.4.1 Information Systems, INFORMATION
                 SYSTEMS APPLICATIONS, Office Automation, Word
                 processing \\ H.3.1 Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Content Analysis and Indexing,
                 Dictionaries",
}

@Article{Yannakoudakis:1983:RSE,
  author =       "E. J. Yannakoudakis and D. Fawthrop",
  title =        "The rules of spelling errors",
  journal =      j-INFO-PROC-MAN,
  volume =       "19",
  number =       "2",
  pages =        "87--99 (or 87--100??)",
  month =        "????",
  year =         "1983",
  CODEN =        "IPMADK",
  ISSN =         "0306-4573",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "It is demonstrated that the vast majority of spelling
                 errors follow specific rules which are based on
                 phonological and sequential considerations. It
                 introduces and describes three categories of spelling
                 errors (consonantal, vowel and sequential) and presents
                 the results of the analysis of 1377 spelling error
                 forms. All results established are empirical and define
                 the nature of spelling errors algorithmically.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  journalabr =   "Inf Process Manage",
  keywords =     "information science; computer programming ---
                 Algorithms; spelling errors; algorithms; languages",
  subject =      "H.3.1 Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Content Analysis and Indexing, Linguistic
                 processing \\ H.4.1 Information Systems, INFORMATION
                 SYSTEMS APPLICATIONS, Office Automation, Word
                 processing \\ H.3.1 Information Systems, INFORMATION
                 STORAGE AND RETRIEVAL, Content Analysis and Indexing,
                 Dictionaries",
}

@Article{Adams:1984:SC,
  author =       "Russ Adams",
  title =        "String Computer",
  journal =      "Robotics Age",
  volume =       "6",
  number =       "11",
  pages =        "22, 24--25",
  month =        nov,
  year =         "1984",
  CODEN =        "ROAGD2",
  ISSN =         "0197-1905",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "Introduced is a VLSI chip designed to bring computer
                 technology one step closer to duplicating human
                 intelligence. The PF474 is a VLSI integrated circuit
                 that can perform a powerful string comparison function
                 at speeds as high as 40,000 comparisons per second for
                 8-character strings.",
  acknowledgement = ack-nhfb,
  classification = "722; 723; 731; 912",
  journalabr =   "Rob Age",
  keywords =     "computers, microprocessor; systems science and
                 cybernetics --- Artificial Intelligence; integrated
                 circuits, VLSI; string computer; intelligence chip;
                 spelling-checking algorithms; proximity pf474",
}

@Book{Anonymous:1984:PMA,
  author =       "Anonymous",
  key =          "APA",
  title =        "Publication Manual of the American Psychological
                 Association",
  publisher =    pub-APA,
  address =      pub-APA:adr,
  edition =      "third",
  pages =        "208",
  year =         "1984",
  ISBN =         "0-912704-57-8",
  LCCN =         "BF76.7 .P83 1983",
  bibdate =      "Tue Mar 1 11:52:52 1994",
  acknowledgement = ack-fm,
  annote =       "The book contains style guidelines known as the APA
                 style. This ranges from spelling conventions to table
                 formatting. The guidelines assume that papers are
                 produced using a typewriter. The book itself shows a
                 very unpleasant design making reading are hard task.",
  bibliography = "yes",
  index =        "yes",
  keywords =     "document preparation guidelines, style guidelines,
                 communications in psychology, psychology authorship,
                 American Psychological Association, publication manual,
                 writing",
}

@InProceedings{Arhar:1984:ETC,
  author =       "M. Arhar and C. Beverstock",
  title =        "The effect of two computer spelling programs on the
                 attitude and achievement of sixth-grade students",
  crossref =     "Camuse:1984:MEC",
  pages =        "1--6",
  year =         "1984",
  bibdate =      "Tue Jul 26 10:03:11 1994",
  acknowledgement = ack-nhfb,
  keywords =     "human factors",
  subject =      "K.3.1 Computing Milieux, COMPUTERS AND EDUCATION,
                 Computer Uses in Education, Computer-assisted
                 instruction (CAI)",
}

@Book{Beddoes:1984:PAL,
  author =       "M. P. Beddoes and H. Garudadri",
  title =        "Possible Application of {LPC}: Spelling Correction",
  publisher =    "Canadian Medical \& Biological Engineering Soc",
  address =      "Gloucester, Ont, Can",
  pages =        "116--117",
  year =         "1984",
  ISBN =         "0-919529-18-6",
  LCCN =         "????",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A basic feature of the Linear Prediction Coder (LPC)
                 is its ability to predict the next sample from the
                 previous ten to fifty samples. The application of LPC
                 to letter prediction through a letter-to-number look-up
                 table is described. Repeating the letter samples is
                 effective in reducing the prediction error. An error
                 indicator for testing miss-spelling is also
                 described.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of British Columbia, Dep of Electrical
                 Engineering, Vancouver, BC, Can",
  affiliationaddress = "Univ of British Columbia, Dep of Electrical
                 Engineering, Vancouver, BC, Can",
  classification = "723; 922; 461",
  conference =   "Proceedings of 10th Canadian Medical \& Biological
                 Engineering Conference: Biomedical Engineering --- The
                 Future of Health Care.",
  keywords =     "codes, symbolic; biomedical engineering --- Computer
                 Applications; misspelling; linear prediction coder;
                 error indicator; minimum error testing; irregular
                 spelling",
  meetingaddress = "Ottawa, Ont, Can",
  sponsor =      "Medical Research Council of Canada, Ottawa, Ont, Can;
                 Health \& Welfare Canada, Bur of Medical Devices,
                 Ottawa, Ont, Can; Commercial \& Industrial Development
                 Corp of Ottawa-Carleton, Ottawa, Ont, Can; City of
                 Ottawa, Ottawa, Ont, Can; Honeywell, Medical
                 Electronics Div, Mississauga, Ont, Can; et al",
}

@Article{Chin:1984:ASG,
  author =       "David Chin",
  title =        "Analysis of Scripts Generated in Writing Between Users
                 and Computer Consultants",
  journal =      "AFIPS Conference Proceedings",
  volume =       "53",
  pages =        "637--642",
  year =         "1984",
  CODEN =        "AFPGBT",
  ISBN =         "0-88283-043-0",
  ISSN =         "0095-6880",
  LCCN =         "????",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  classification = "723",
  conference =   "AFIPS Conference Proceedings, 1984 National Computer
                 Conference.",
  journalabr =   "AFIPS Conference Proceedings",
  keywords =     "computers; computer consultant program; controlled
                 experiment; indirect speech; grammatically ill-formed
                 constructions; spelling errors; speaking to computer",
  meetingaddress = "Las Vegas, NV, USA",
  sponsor =      "AFIPS, Reston, Va, USA",
}

@Article{Garrison:1984:USS,
  author =       "D. A. Garrison and C. S. Himelstein and R. J.
                 Urquhart",
  title =        "Unfold Skipping for Spelling Correction Function",
  journal =      j-IBM-TDB,
  volume =       "26",
  number =       "10B",
  pages =        "5642--5643",
  month =        mar,
  year =         "1984",
  CODEN =        "IBMTAA",
  ISSN =         "0018-8689",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A method is described for increasing the efficiency of
                 a spelling correction function by using a filter to
                 eliminate the need to `unfold' sections of logical
                 records. The variable field dictionary structure
                 requires unfolding of each nibble ( one-half byte) of a
                 logic record during processing. This constitutes a
                 major part of the time spent. This method eliminates
                 50\% to 60\% of the unfold time depending on the number
                 of words in the dictionary.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  journalabr =   "IBM Tech Discl Bull",
  keywords =     "character recognition equipment; spelling correction",
}

@InProceedings{Goodenough-Trepagnier:1984:ESP,
  author =       "Cheryl Goodenough-Trepagnier",
  booktitle =    "{Ecrire}: System Pour la Communication Non-Verbale
                 Fran{\c{ca}}ise en Orthographe Standard",
  title =        "{Ecrire}: System Pour la Communication Non-Verbale
                 Fran{\c{ca}}ise en Orthographe Standard",
  publisher =    "Rehabilitation Engineering Soc of North America",
  address =      "Bethesda, MD, USA",
  pages =        "343--344",
  year =         "1984",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A language representation system for use in French
                 communication devices is described. This system,
                 ECRIRE, is similar to the English system, WRITE, in
                 that it allows production of correctly spelled text
                 with a minimum number of selection gestures per word,
                 as few as 1. 7 for ECRIRE-400 in direct selection
                 mode.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Tufts-New England Medical Cent, Boston, MA,
                 USA",
  classification = "462; 461; 723; 901",
  conference =   "Second International Conference on Rehabilitation
                 Engineering, Combined with the RESNA 7th Annual
                 Conference. Proceedings.",
  keywords =     "biomedical equipment; optical communication equipment;
                 display devices; health care; personnel --- Handicapped
                 Persons; human engineering; nonvocal communication
                 systems; human factors; rehabilitation engineering;
                 communication aids; nonvocal motor handicapped",
  language =     "French",
  meetingaddress = "Ottawa, Ont, Can",
  sponsor =      "Natl Research Council of Canada, Ottawa, Ont, Can;
                 Rehabilitation Engineering Soc of North America,
                 Bethesda, MD, USA; Canadian Medical \& Biological
                 Engineering Soc, Can",
}

@Book{James:1984:DD,
  author =       "Geoffrey James",
  title =        "Document databases",
  publisher =    pub-VNR,
  address =      pub-VNR:adr,
  pages =        "xiii + 184",
  year =         "1984",
  ISBN =         "0-442-28185-4",
  LCCN =         "QA76.9.D3 J35 1985",
  bibdate =      "Fri Aug 19 11:41:26 1994",
  price =        "US\$28.95",
  acknowledgement = ack-nhfb,
  keywords =     "design; performance; reliability; human factors;
                 economics; documentation",
  review =       "ACM CR 8711-0902",
  subject =      "D.2.7 Software, SOFTWARE ENGINEERING, Distribution and
                 Maintenance, Documentation \\ H.3.0 Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, General \\
                 H.2.8 Information Systems, DATABASE MANAGEMENT,
                 Database applications \\ H.4.0 Information Systems,
                 INFORMATION SYSTEMS APPLICATIONS, General \\ K.4.3
                 Computing Milieux, COMPUTERS AND SOCIETY,
                 Organizational Impacts \\ C.4 Computer Systems
                 Organization, PERFORMANCE OF SYSTEMS, Reliability,
                 availability, and serviceability \\ K.6.3 Computing
                 Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
                 SYSTEMS, Software Management, Software maintenance",
}

@Article{Kashyap:1984:SCU,
  author =       "R. L. Kashyap and B. J. Oommen",
  title =        "Spelling correction using probabilistic methods",
  journal =      j-PAT-REC-LETT,
  volume =       "2",
  number =       "3",
  pages =        "147--154",
  month =        mar,
  year =         "1984",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance; reliability; image;
                 symbol",
  subject =      "G.3 Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo) \\ I.7.1 Computing Methodologies, TEXT
                 PROCESSING, Text Editing, Spelling \\ H.4.1 Information
                 Systems, INFORMATION SYSTEMS APPLICATIONS, Office
                 Automation, Word processing",
}

@Article{Krantz:1984:R,
  author =       "Donald G. Krantz",
  title =        "{RESORT}",
  journal =      j-DDJ,
  volume =       "9",
  number =       "11",
  pages =        "88--93",
  month =        nov,
  year =         "1984",
  CODEN =        "DDJSDM",
  ISSN =         "1044-789X",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "RESORT, a user dictionary program with a spelling
                 checker in alphabetical order. It permits the user to
                 read through a document after spelling corrections,
                 strip the speller's flag (a leading tilde), and add
                 correction words unknown to the master dictionary to
                 the user dictionary. I used the sorting technique from
                 the C Programming Language by Kernighan and Ritchie
                 (Prentice Hall, 1978): the lowly binary tree. This is
                 my favorite sorter, as it is easily implemented in C.
                 The program takes the input document filename from the
                 command line, opens it for input, and creates a
                 temporary file for output. The input file is scanned
                 for tildes, which flag unrecognized words. When a tilde
                 is found, the word following is converted to upper case
                 and added to a binary tree. The program shell can be
                 modified easily to do other tasks unrelated to
                 spelling. For example, it would be a matter of adding a
                 few lines of code to do word frequency counts. Few
                 changes are made to produce an index generator.",
  acknowledgement = ack-nhfb,
  classification = "723",
  journalabr =   "Dr Dobb's J",
  keywords =     "computer programs; data processing --- Word
                 Processing; user dictionary; spelling checker; word
                 correction; computer programs; data processing --- Word
                 Processing; spelling checker; user dictionary; word
                 correction",
}

@Article{Lucassen:1984:ITA,
  author =       "J. M. Lucassen and R. L. Mercer",
  title =        "Information Theoretic Approach to the Automatic
                 Determination of Phonemic Baseforms",
  journal =      j-PROC-ICASSP,
  volume =       "3",
  pages =        "42. 5. 1--42. 5. 4",
  year =         "1984",
  CODEN =        "IPRODJ",
  ISSN =         "0736-7791",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  note =         "IEEE Service Cent. Piscataway, NJ, USA.",
  acknowledgement = ack-nhfb,
  classification = "751",
  conference =   "Proceedings --- ICASSP 84, IEEE International
                 Conference on Acoustics, Speech, and Signal
                 Processing.",
  journalabr =   "Proceedings - ICASSP, IEEE International Conference on
                 Acoustics, Speech and Signal Processing 1984",
  keywords =     "speech; information-theoretic method; phonemic
                 baseform identification; phoneme recognizer;
                 spelling-to-baseform channel model; aligned dictionary
                 entries; feature selection",
  meetingaddress = "San Diego, CA, USA",
  sponsor =      "IEEE Acoustics, Speech, \& Signal Processing Soc, New
                 York, NY, USA",
}

@Article{Newman:1984:SAB,
  author =       "P. W. Newman and Barry R. Horowitz",
  title =        "Spelling Aid for the Blind",
  journal =      "Conference Proceedings --- IEEE SOUTHEASTCON",
  pages =        "558--562",
  year =         "1984",
  CODEN =        "CPISDM",
  ISSN =         "0734-7502",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  note =         "IEEE Service Cent. Piscataway, NJ, USA.",
  acknowledgement = ack-nhfb,
  classification = "462",
  conference =   "Conference Proceedings --- IEEE SOUTHEASTCON '84.",
  journalabr =   "Conf Proc IEEE Southeastcon",
  keywords =     "biomedical equipment; enhancements for blind user;
                 design considerations; functional requirements;
                 hardware design; software overview",
  meetingaddress = "Louisville, KY, USA",
  sponsor =      "IEEE, New York, NY, USA",
}

@Article{Pollock:1984:ASC,
  author =       "J. J. Pollock and A. Zamora",
  title =        "Automatic spelling correction in scientific and
                 scholarly text",
  journal =      j-CACM,
  volume =       "27",
  number =       "4",
  pages =        "358--368",
  month =        apr,
  year =         "1984",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "H.4.1 Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation, Word processing \\
                 I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling",
}

@Article{Pollock:1984:SDD,
  author =       "Joseph J. Pollock and Antonio Zamora",
  title =        "System Design for Detection and Correction of Spelling
                 Errors in Scientific and Scholarly Text",
  journal =      j-J-AM-SOC-INF-SCI,
  volume =       "35",
  number =       "2",
  pages =        "104--109",
  month =        mar,
  year =         "1984",
  CODEN =        "AISJB6",
  ISSN =         "0002-8231",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "The SPEEDCOP project recently completed at Chemical
                 Abstracts Service (CAS) extracted over 50,000
                 misspellings from approximately 25,000,000 words of
                 text from seven scientific and scholarly databases. The
                 misspellings were automatically classified and analyzed
                 and the results used to design and implement a program
                 that proved capable of correcting most such errors.
                 Analysis of the performance of the spelling error
                 detection and correction programs highlighted the
                 features that should be incorporated into a powerful
                 and user-friendly interactive system suitable for
                 nonprogrammers. These include document level thresholds
                 for mispelling detection, automatic reuse of user
                 decisions, and user verification and control of
                 correction. An advantage of the proposed design is that
                 the system automatically customizes itself to its
                 environment. This article is primarily concerned with
                 system design, not implementation details.",
  acknowledgement = ack-nhfb,
  classification = "901; 723",
  journalabr =   "J Am Soc Inf Sci",
  keywords =     "information science; computer programming ---
                 Applications; computer systems, digital --- Interactive
                 Operation; spelling-error detection; spelling-error
                 correction",
}

@Article{Pournelle:1984:R,
  author =       "J. Pournelle",
  title =        "On the road",
  journal =      j-BYTE,
  volume =       "9",
  number =       "10",
  pages =        "363--382",
  month =        sep,
  year =         "1984",
  CODEN =        "BYTEDJ",
  ISSN =         "0360-5280",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; security; languages",
  subject =      "C.5 Computer Systems Organization, COMPUTER SYSTEM
                 IMPLEMENTATION, Minicomputers \\ D.4.1 Software,
                 OPERATING SYSTEMS, Process Management, Concurrency \\
                 H.4.1 Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Office Automation, Word processing \\
                 K.5.1 Computing Milieux, LEGAL ASPECTS OF COMPUTING,
                 Software Protection, Copyrights \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing, Languages
                 \\ I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling \\ I.2.1 Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Applications and Expert
                 Systems, Games",
}

@Article{Sinha:1984:PCS,
  author =       "R. M. K. Sinha and K. S. Sigh",
  title =        "A program for correction of single spelling errors in
                 Hindi words",
  journal =      j-J-INST-ELEC-TELECOMM-ENG,
  volume =       "30",
  number =       "6",
  pages =        "249--251",
  month =        nov,
  year =         "1984",
  CODEN =        "JIETAU",
  ISSN =         "0377-2063",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling \\ J.5 Computer Applications, ARTS
                 AND HUMANITIES, Linguistics \\ I.7.2 Computing
                 Methodologies, TEXT PROCESSING, Document Preparation,
                 Languages \\ I.2 Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Natural Language Processing",
}

@Article{Teague:1984:UCI,
  author =       "G. V. Teague and R. M. Wilson and M. G. Teague",
  title =        "Use of computer-assisted instruction to improve
                 spelling proficiency of low achieving first graders",
  journal =      j-AEDS,
  volume =       "17",
  number =       "4",
  pages =        "30--35",
  month =        "Summer",
  year =         "1984",
  bibdate =      "Sun Jul 24 09:09:04 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "human factors",
  subject =      "K.3.1 Computing Milieux, COMPUTERS AND EDUCATION,
                 Computer Uses in Education, Computer-assisted
                 instruction (CAI)",
}

@Article{Teitelman:1984:TTC,
  author =       "W. Teitelman",
  title =        "A tour through Cedar",
  journal =      j-IEEE-SOFTWARE,
  volume =       "1",
  number =       "2",
  pages =        "44--73",
  month =        apr,
  year =         "1984",
  CODEN =        "IESOEG",
  ISSN =         "0740-7459",
  bibdate =      "Sun Jul 24 13:27:28 1994",
  note =         "From {\em Computing Reviews\/}: ``Cedar reduces many
                 good ideas to practice, including such philosophical
                 dicta as The Law of Least Astonishment (user experience
                 should correctly predict system behavior), Do What I
                 Mean (interaction mistakes, e.g., spelling errors,
                 should be automatically corrected in context), and
                 Unlimited Undo (every action should be reversible).''",
  acknowledgement = ack-nhfb,
  review =       "ACM CR 8612-1083",
  subject =      "D.2 Software, SOFTWARE ENGINEERING, Programming
                 Environments",
}

@Article{Urquhart:1984:FSC,
  author =       "R. J. Urquhart",
  title =        "Filter for Spelling Correction Function",
  journal =      j-IBM-TDB,
  volume =       "26",
  number =       "10B",
  pages =        "5637--5638",
  month =        mar,
  year =         "1984",
  CODEN =        "IBMTAA",
  ISSN =         "0018-8689",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "A method is described for increasing throughput in a
                 spelling correction function by providing a cross-match
                 filter between a limited number of characters of the
                 input word and dictionary words. The filter examines
                 the second, third, and fourth characters of both the
                 input (I) word, presented for spelling correction, and
                 candidate dictionary (D) words, looking for particular
                 mismatch patterns.",
  acknowledgement = ack-nhfb,
  classification = "722; 723",
  journalabr =   "IBM Tech Discl Bull",
  keywords =     "character recognition equipment; spelling correction",
}

@Article{Volpano:1984:EIC,
  author =       "D. Volpano and H. Dunsmore",
  title =        "Empirical investigation of {COBOL} features",
  journal =      j-INFO-PROC-MAN,
  volume =       "20",
  number =       "1/2",
  pages =        "277--291",
  year =         "1984",
  CODEN =        "IPMADK",
  ISSN =         "0306-4573",
  bibdate =      "Sun Jul 24 13:27:25 1994",
  note =         "From {\em Computing Reviews\/}: ``{\ldots} (6) COBOL
                 compilers can help solve some problems by: (a) Coercing
                 edited numeric data items in arithmetic expressions, as
                 does FORTRAN. (b) Automatically correcting simple
                 spelling errors with known techniques. (c) Better and
                 more accurate diagnostics in compilers which are
                 deficient in these areas.''",
  acknowledgement = ack-nhfb,
  keywords =     "experimentation; human factors; languages;
                 measurement",
  review =       "ACM CR 8503-0190",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, COBOL \\ D.2 Software, SOFTWARE
                 ENGINEERING, Metrics \\ D.2 Software, SOFTWARE
                 ENGINEERING, Management \\ D.m",
}

@InProceedings{Wolff:1984:ILS,
  author =       "J. G. Wolff and S. G. C. Lawrence",
  title =        "Inductive Learning of Spelling-To-Phoneme Rules by
                 Data Reduction",
  crossref =     "OShea:1984:AAI",
  pages =        "506--507",
  year =         "1984",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "This paper describes work in progress on a method of
                 creating spelling-to-phoneme rules automatically, using
                 some of the principles of data reduction and grammar
                 discovery discussed in Wolff (forthcoming). The method
                 is being developed as part of a project on the
                 synthesis of speech from text.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Univ of Dundee, Scotl",
  classification = "912; 723",
  conference =   "ECAI-84: Proceedings of the Sixth European Conference
                 on Artificial Intelligence.",
  keywords =     "systems science and cybernetics; Learning Systems;
                 artificial intelligence; data processing --- Data
                 Reduction and Analysis; inductive learning;
                 spelling-to-phoneme rules; automatic rule abstraction;
                 hill-climbing search; clusters of contiguous symbols",
  meetingaddress = "Pisa, Italy",
  sponsor =      "AICA; AISB",
}

@Article{Anon:1985:DDS,
  author =       "Anon",
  title =        "Dynamic Dictionary Supplement for Spell Check Tasks",
  journal =      j-IBM-TDB,
  volume =       "28",
  number =       "6",
  pages =        "2334--??",
  month =        nov,
  year =         "1985",
  CODEN =        "IBMTAA",
  ISSN =         "0018-8689",
  bibdate =      "Wed Jan 15 12:19:41 MST 1997",
  bibsource =    "Compendex database",
  abstract =     "An arrangement is described for reducing the access
                 time required to reference the storage media containing
                 the dictionary when a spell check task is being done in
                 a text processing system. This access time can become
                 significant, especially in a multi workstation
                 environment, where each workstation is sharing a common
                 dictionary which is accessed through an interface
                 involving communicating protocols. Where the medium is
                 a diskette employing contact recording, an excessive
                 number of accesses will shorten the life of the medium
                 and adversely affect the reliability of the system.",
  acknowledgement = ack-nhfb,
  classification = "721; 722; 723",
  journalabr =   "IBM Tech Discl Bull",
  keywords =     "data storage, digital; Testing; data processing ---
                 Word Processing; dynamic dictionary supplement; spell
                 check tasks; access time; text processing; multi
                 workstation",
}

@Article{Anonymous:1985:A,
  author =       "Anonymous",
  key =          "Anonymous85aa",
  title =        "Advertisement",
  journal =      j-INFOWORLD,
  volume =       "7",
  number =       "44",
  pages =        "28",
  month =        nov # " 4",
  year =         "1985",
  CODEN =        "INWODU",
  ISSN =         "0199-6649",
  bibdate =      "Tue Jul 26 10:30:37 1994",
  abstract =     "Advertisement for AI:Typist which is a \$79.00 word
                 processing system that has a spelling corrector that
                 checks words as they are entered. Billed as ``AIRUS--A
                 technology is so new, it's still baffling the
                 experts.''",
  acknowledgement = ack-nhfb,
}

@Article{Barth:1985:SSS,
  author =       "Wilhelm Barth and Heinrich Nirschl",
  title =        "{Siche