Parallel parsing of tree adjoining grammars on the connection machine

Journal Article · Sat Feb 01 00:00:00 EST 1992 · International Journal of Parallel Programming; (United States)

DOI:https://doi.org/10.1007/BF01379313· OSTI ID:7249394

Palis, M A ^[1]; Wei, D S.L. ^[2]

---

1. Univ. of Pennsylvania, Philadelphia, PA (United States)
2. Radford Univ., VI (United States)

This paper describes a parsing algorithm for Tree Adjoining Grammar (TAG) and its parallel implementation on the Connection Machine. TAG is a formalism for natural language that employs trees as the basic grammar structures. Parsing involves the application of two operations, called adjunction and substitution, to produce derived tree structures. Sequential parsing algorithms for TAGs run in time quadratic in the grammer size, which is impractical for the very large grammars currently being developed for natural language. This paper presents two parallel algorithms, one running in time nearly linear in the grammar size, and the other running in time logarithmic in the grammar size. Both parallel algorithms were implemented on a Connection Machine CM-2 and performance measurements were obtained for varying grammar sizes.

• OSTI ID: 7249394
• Journal Information: International Journal of Parallel Programming; (United States), Vol. 21:1; ISSN 0885-7458
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
COMPUTER ARCHITECTURE
OPTIMIZATION
PARALLEL PROCESSING
ALGORITHMS
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers