Syntax-directed least-errors analysis for context-free languages-Reference-Cited by-同舟云学术

Syntax-directed least-errors analysis for context-free languages

Published:1974-01 Issue:1 Volume:17 Page:3-14
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Lyon Gordon¹

Affiliation:

1. National Bureau of Standards, U.S. Dept. of Commerce, Washington, DC

Abstract

A least-errors recognizer is developed informally using the well-known recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of context-free grammars as drivers, and any finite string as input. Recognition consists of a least-errors count for a corrected version of the input relative to the driver grammar. The algorithm design emphasizes practical aspects which help in programming it.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/360767.360771

Reference31 articles.

1. Bellman R.E. Dynamic Programming. Princeton U. Press Princeton N.J. 1957. Bellman R.E. Dynamic Programming. Princeton U. Press Princeton N.J. 1957.

2. Design of a separable transition-diagram compiler

3. An efficient context-free parsing algorithm

Cited by 55 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Input-driven pushdown automata for edit distance neighborhood;Theoretical Computer Science;2022-05

2. Approximate matching between a context-free grammar and a finite-state automaton;Information and Computation;2016-04

3. Approximate Matching between a Context-Free Grammar and a Finite-State Automaton;Implementation and Application of Automata;2013

4. Managing misspelled queries in IR applications;Information Processing & Management;2011-03

5. Error-repair parsing schemata;Theoretical Computer Science;2010-02