Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. An algorithm for error correction in context-free languages
Details

An algorithm for error correction in context-free languages

Date Issued
August 1974
Author(s)
Miles, George H.
Advisor(s)
Michael G. Thompson
Additional Advisor(s)
Sara Jordan
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/64137
Abstract

The task of error correction in various applications of parsing is drawing more and more interest and concern. This paper presents an algorithm that corrects three common spelling errors in a context-free language and then describes an implementation on a digital computer.

The algorithm described initially applies transformations to the original grammar to produce three new grammars. Each new grammar will generate the strings in the original language with one occurrence of an error. Each new grammar is then used to define a pushdown transducer which will recognize a string in the error corrupted language. The output will be a string in the original language along with a special symbol to show where the error correction has occurred.

Degree
Master of Science
Major
Computer Science
File(s)
Thumbnail Image
Name

Thesis74.M545.pdf

Size

3.2 MB

Format

Adobe PDF

Checksum (MD5)

50ac26ee67f3ea1fb60f69387ed456ce


University Libraries

1015 Volunteer Boulevard
Knoxville, TN 37996
865-974-4351

Map & Directions
Donate to the Libraries
  • About
  • John C. Hodges Society
  • Speaking Volumes magazine
  • Outreach
  • Directory
  • Employment
  • Policies
  • Library Intranet
University of Tennessee power T logo

The University of Tennessee, Knoxville
Knoxville, Tennessee 37996
865-974-1000

Events
A-Z
Apply
Privacy
Map
Directory
Give to UT
Accessibility

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science