Abstract
This paper examines the performance on the Kendall Square Research KSR1 multicomputer of a highly unstructured algorithm for natural language parsing. It describes a Tree Adjoining Grammar parsing algorithm that exhibits near linear speedup and very high efficiency for grammars of even moderate size. The work reported demonstrates the utility of shared-address-space parallel architectures for algorithms that require shared data structures. Finally, the paper presents practical guidelines for the efficient use of the KSR1.
| Original language | English (US) |
|---|---|
| Pages | 215-220 |
| Number of pages | 6 |
| State | Published - Dec 1 1994 |
| Event | Proceedings of the Scalable High-Performance Computing Conference - Knoxville, TN, USA Duration: May 23 1994 → May 25 1994 |
Other
| Other | Proceedings of the Scalable High-Performance Computing Conference |
|---|---|
| City | Knoxville, TN, USA |
| Period | 5/23/94 → 5/25/94 |