to browse

Patti

Compiling Unification-Based Finite-State Automata into Machine Instructions for PowerPC

NLP
Apple

Talk · Sascha Brawer · IBM T. J. Watson Research Center, Lucent Bell Labs, Xerox PARC, Saarland University, and the University of Zürich · 1999

The core ideas of the Patti compiler: turning a unification-based finite-state grammar directly into PowerPC machine code, fast enough that unification and pattern matching stop being bottlenecks in a natural-language system.

Given on a 1999 tour of several research labs. The full write-up is my diploma thesis, Patti.