Formalisms for grammatical knowledge representation

摘要

Computational linguists require descriptively powerful, computationally effective formalisms for representing grammatical information or knowledge. A wide variety of formalisms have been employed in natural language processing systems over the past several decades, including simple phrase structure grammars, augmented transition networks, logic grammars and unification-based grammar formalisms. Until fairly recently however, comparatively little attention has been given to the issues which underly good grammar formalism design in computational linguistics.