PPQ : a pregroup parser using majority composition

Abstract

Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup grammar that uses a tabular approach based on majority partial composition. 

1 Figure or Table

Topics

  • Presentations referencing similar topics