A non-left-to-right, non-directional parser for ambiguous lattices

Authors:
A Giordana;L Saitta
Affiliations:
Department of Informatics, University of Torino, Corso M. D'Azeglio 42, 10125 - Torino, Italy;Department of Informatics, University of Torino, Corso M. D'Azeglio 42, 10125 - Torino, Italy
Venue:
Pattern Recognition Letters
Year:
1985

Citing 7
Cited 0

An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Problem Reduction Representation for the Linguistic Analysis of Waveforms

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Syntactic Approach for Handwritten Mathematical Formula Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Speech segmentation and interpretation using a semantic syntax-directed translation

Pattern Recognition Letters
Parallel string acceptance using lattice graphs

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

In syntactic pattern recognition the need of reducing computational power may require the use of more general parsers than the standard ones, allowing to efficiently exploit the structural knowledge for limiting the extraction of primitive patterns. In this paper a new flexible, non-directional, non-left-to-right parsing scheme is presented; it has worst case space complexity O(N^2) and time complexity O(N^3), where N is the length of the input string. These upper bounds are lowered for particular classes of context-free grammars as, for instance, linear or non-ambiguous ones.