An Efficient Parallel Parsing Algorithm for Context-Free Languages Based on Earley's Method (Special Section on Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
We propose a parallel parsing algorithm based on Earley's method, which works in O(log^2n) time using O(n~<4.752>) Processors on CREW PRAM. This algorithm runs with less number of processors compared with previously proposed W. Rytter's algorithm.
- 社団法人電子情報通信学会の論文
- 1996-04-25
著者
-
Masuyama Shigeru
Toyohashi Univ. Technol. Toyohashi‐shi Jpn
-
Masuyama Shigeru
Toyohashi University Of Technology
-
ATSUMI Kiyotaka
Toyohashi University of Technology
-
Atsumi K
Toyohashi Univ. Technol. Toyohashi‐shi Jpn
関連論文
- A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs(Invited Papers from New Horizons in Computing)
- Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
- An Efficient Parallel Parsing Algorithm for Context-Free Languages Based on Earley's Method (Special Section on Discrete Mathematics and Its Applications)
- Minimum Vertex Ranking Spanning Tree Problem(TUTORIAL SPEECH)
- On the Ambiguity Reduction Ability of a Probabilistic Context-Free Grammar(Special Section on Discrete Mathematics and Its Applications)
- Extraction of Effect and Technology Terms from a Patent Document(Theory and Methodology)
- Extraction of Effect and Technology Terms from a Patent Document