In what sense is a grammar the union of its rules? This paper adapts the notion of composition, well developed in the context of programming languages, to the domain of linguistic formalisms. We study alternative definitions for the semantics of such formalisms, suggesting a denotational semantics that we show to be compositional and fully-abstract. This facilitates a clear, mathematically sound way for defining grammar modularity.
|Number of pages||8|
|Journal||Proceedings of the Annual Meeting of the Association for Computational Linguistics|
|State||Published - 1999|
|Event||37th Annual Meeting of the Association for Computational Linguistics, ACL 1999 - College Park, United States|
Duration: 20 Jun 1999 → 26 Jun 1999
Bibliographical notePublisher Copyright:
© ACL 1999.All right reserved.
ASJC Scopus subject areas
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics