Abstract

Bangalore and Joshi (1999) investigate supertagging as “almost parsing”. In this paper we explore this claim further by replacing their Lightweight Dependency Analyzer with a nonlexical probabilistic chart parser. Our approach is still in the spirit of their work in the sense that lexical information is only used during supertagging; the parser and its probabilistic model only see supertags. 1

Citations