Speaker: Rouzbeh Farahmand
JolfaTech Consulting Inc.
Title: Flexible Structural Analysis of Near-Meet-Semilattices for Typed Unication-based Grammar Design
We present a new method for directly working with typed unification grammars in which type unification is not well defined. This is often the case, as large-scale HPSG grammars now usually have type systems for which many pairs do not have least upper bounds. Our method yields a unification algorithm that compiles quickly and yet is nearly as fast during parsing as one that requires least upper bounds. The method also provides a natural naming convention for unification results in cases where no user-defined type exists.