On CKY-parsing of context-free grammars in parallel

On CKY-parsing of context-free grammars in parallel

A parallel version of the CKY-parsing algorithm for context-free grammar is presented. The algorithm uses parallel random access machine (PRAM) models of computation and parses a string (or sentence) of length n in parallel time O(n log n), employing O(n/sup 2/) processors. The proposed algorithm us...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chandwani, M., Puranik, M., Chaudhari, N.S.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Artificial intelligence
Binary trees
Production
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A parallel version of the CKY-parsing algorithm for context-free grammar is presented. The algorithm uses parallel random access machine (PRAM) models of computation and parses a string (or sentence) of length n in parallel time O(n log n), employing O(n/sup 2/) processors. The proposed algorithm uses a very simple procedure, and provides multiple parses for ambiguous languages.< >
DOI:10.1109/TENCON.1992.271967