This page is obsolete. The new page is here. You will be redirected presently.
The goal of this project is to design and implement a compiler which will translate grammars, expressed in the finite-state toolbox of Xerox (which include two systems, LEXC and XFST), to grammars in the language of the FSA Utils package. For the most part, there is a strong parallelism between the languages, but certain constructs will be harder to translate and will require more innovation.
The contribution of such a project lies in the fact that the Xerox utilities are proprietary; compilation to FSA will enable us to use grammars developed with the Xerox tools on publicly available systems. Furthermore, parallel investigation of two similar, yet different, systems, is likely to result in new insights regarding the two systems and there interrelationships. Finally, such a compiler will enable us to compare the performance of the two systems on very similar benchmarks.
|Mailing address||Yael Cohen-Sygal
Department of Computer Science
University of Haifa
31905 Haifa, Israel.
email@example.com. Last modified: Tue Apr 1 10:47:18 IDT 2003