Starting with complex primitives pays off

Authors:
Aravind K. Joshi
Affiliations:
University of Pennsylvania, Philadelphia, PA
Venue:
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Year:
2003

Citing 3
Cited 1

Tree-adjoining grammars

Handbook of formal languages, vol. 3
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Anaphora and Discourse Structure

Computational Linguistics

GeLexi project: sentence parsing based on a GEnerative LEXIcon

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the specification of formal systems for a grammar formalism, conventional mathematical wisdom dictates that we start with primitives (basic primitive structures or building blocks) as simple as possible and then introduce various operations for constructing more complex structures. Alternatively, we can start with complex (more complicated) primitives that directly capture crucial linguistic properties and then introduce some general operations (language independent operations) for composing them. This latter approach has led to the so-called strongly lexicalized grammars, providing some new insights into syntactic description, semantic composition, discourse structure, language generation, psycholinguistic and statistical processing, all with computational implications. In this paper, we will illustrate some of these insights in the context of the lexicalized tree-adjoining grammar (LTAG).