Tree Structures for Optimal Searching
Journal of the ACM (JACM)
Spelling correction in systems programs
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Variable length tree structures having minimum average search time
Communications of the ACM
Randomized binary search technique
Communications of the ACM
CORC—the Cornell computing language
Communications of the ACM
An error-correcting parse algorithm
Communications of the ACM
Syntax-directed error recovery for compilers
Syntax-directed error recovery for compilers
Programming Systems and Languages.
Programming Systems and Languages.
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
ACM Computing Surveys (CSUR)
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Practical syntactic error recovery
Communications of the ACM
Practical syntactic error recovery in compilers
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A statistical analysis of syntax errors
Computer Languages
Efficient fuzzy search in large text collections
ACM Transactions on Information Systems (TOIS)
| Hi-index | 48.25 |
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.