Adaptive correction of program statements
- 1 January 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 16 (1) , 27-37
- https://doi.org/10.1145/361932.361940
Abstract
A method of analyzing statements in a programming language which can tolerate a considerable inaccuracy in their specification is proposed. This method involves principles at present mainly confined to studies in the area of artificial intelligence such as feature extraction, approximate tree matching, and strategy improvement by feedback from the matching process. A pilot program incorporating the principles is described and preliminary operating results are presented. A final section surveys further principles which are currently being investigated.Keywords
This publication has 10 references indexed in Scilit:
- Transition network grammars for natural language analysisCommunications of the ACM, 1970
- Tree Structures for Optimal SearchingJournal of the ACM, 1970
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970
- Spelling correction in systems programsCommunications of the ACM, 1970
- Pattern recognition and a model of the brainInternational Journal of Man-Machine Studies, 1969
- Randomized binary search techniqueCommunications of the ACM, 1969
- Variable length tree structures having minimum average search timeCommunications of the ACM, 1969
- “Memo” Functions and Machine LearningNature, 1968
- An error-correcting parse algorithmCommunications of the ACM, 1963
- CORC—the Cornell computing languageCommunications of the ACM, 1963