Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
Earley's algorithm has been commonly used for the parsing of general context-free languages and the error-correcting parsing in syntactic pattern recognition. The time complexity for parsing is 0(n3). This paper presents a parallel Earley's recognition algorithm in terms of an ``X*'&#...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 6(1984), 3 vom: 01. März, Seite 302-14 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1984
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Journal Article |