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*'&#...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 6(1984), 3 vom: 01. März, Seite 302-14 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Format: | Article |
| Langue: | English |
| Publié: |
1984
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article |