|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM211014540 |
| 003 |
DE-627 |
| 005 |
20231224012720.0 |
| 007 |
tu |
| 008 |
231224s1984 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0703.xml
|
| 035 |
|
|
|a (DE-627)NLM211014540
|
| 035 |
|
|
|a (NLM)21869196
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Chiang, Y T
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
|
| 264 |
|
1 |
|c 1984
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 02.10.2012
|
| 500 |
|
|
|a Date Revised 12.11.2019
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a 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*'' operator. By restricting the input context-free grammar to be ¿-free, the parallel algorithm can be executed on a triangular-shape VLSI array. This array system has an efficient way of moving data to the right place at the right time. Simulation results show that this system can recognize a string with length n in 2n + 1 system time. We also present a parallel parse-extraction algorithm, a complete parsing algorithm, and an error-correcting recognition algorithm. The parallel complete parsing algorithm has been simulated on a processor array which is similar to the triangular VLSI array. For an input string of length n the processor array will give the correct right-parse at system time 2n + 1 if the string is accepted. The error-correcting recognition algorithm has also been simulated on a triangular VLSI array. This array recognizes an erroneous string of length n in time 2n + 1 and gives the correct error count. These parallel algorithms are especially useful for syntactic pattern recognition
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Fu, K S
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 6(1984), 3 vom: 01. März, Seite 302-14
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:6
|g year:1984
|g number:3
|g day:01
|g month:03
|g pages:302-14
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 6
|j 1984
|e 3
|b 01
|c 03
|h 302-14
|