Thomas Dey

Learn More
This paper presents a preprocessor based parsing system for Tree Adjoining Grammars. The preprocessor is used for two purposes: (1) to organize the data structures, (2) to reduce the runtime processing load so that the parser executes fast. A parallel parsing algorithm is presented that takes advantage of the preprocessor. The future goals of the proposed(More)
  • 1