Speaker
Affilliation
Corunna, Spain
Abstract
The parsing schemata formalism allows us to describe a wide variety of parsing algorithms in a simple, declarative way, by capturing their fundamental semantics while abstracting low-level detail. This talk will introduce the formalism and present a system that can be used to automatically transform parsing schemata into efficient implementations of their corresponding parsers. This system can be employed to test the relative performance of different parsing strategies in a particular grammar or domain without worrying about implementation details. The system has been used to analyze and compare the performance of different parsers for context-free grammars and tree-adjoining grammars. Additionally, the presentation will discuss the possibility of using parsing schemata to represent dependency parsers.