Talking about trees
Patrick Blackburn,Claire Gardent,Wilfried Meyer-Viol +2 more
- 21 Apr 1993
- pp 21-29
74
TL;DR: The motivation for introducing these languages is to provide tools for formalising grammatical frameworks perspicuously, and the paper illustrates this by showing how the leading ideas of GPSG can be captured in LT (LF).
read more
Abstract: In this paper we introduce a modal language LT for imposing constraints on trees, and an extension LT (LF) for imposing constraints on trees decorated with feature structures. The motivation for introducing these languages is to provide tools for formalising grammatical frameworks perspicuously, and the paper illustrates this by showing how the leading ideas of GPSG can be captured in LT (LF).In addition, the role of modal languages (and in particular, what we have called layered modal languages) as constraint formalisms for linguistic theorising is discussed in some detail.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
The logic of conventional implicatures
Christopher Potts
- 01 Jan 2005
TL;DR: In this paper, a preliminary case for Conventional Implicatures and a logic for conventional implicatures are presented, together with a syntactic analysis of Grice's definition.
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
Geoffrey K. Pullum,Barbara C. Scholz +1 more
- 27 Jun 2001
TL;DR: This work identifies some distinguishing theoretical features of these frameworks, relating to cardinality of the set of expressions, size of individual expressions, and 'transderivational constraints', and concludes that MTS has some major advantages for linguistic description that have been overlooked.
154
•Book
A descriptive approach to language-theoretic complexity
Philip H. Miller,Geoffrey K. Pullum +1 more
- 01 Jan 1998
TL;DR: This book presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines.
139
Patent
Natural language parser
Salah Ait-Mokhtar,Jean-Pierre Chanod,Claude Roux +2 more
- 10 Oct 2002
TL;DR: In this paper, the parser applies a plurality of rules which describe syntactic properties of the language of the input strings, and all rules are applied according to a predefined order to the input string.
137
References
Concerning the base component of a transformational grammar
James D. McCawley
- 01 Jan 2016
TL;DR: The base component of a transformational grammar, which specifies what structures are available for the transformations to operate on, has hitherto been regarded by Chomsky and others as involving rewriting rules, but in Chomsky's most recent treatment, the base component consists of a constituent structure sub component, consisting of rewriting rules and rules of another type which will be discussed below.
95
Tree-oriented proofs of some theorems on context-free and indexed languages
William C. Rounds
- 04 May 1970
TL;DR: The yield theorem is studied: the yield of a recognizable set of trees (dendrolanguage) is an indexed language and some closure properties of CF sets of trees are proved.
83
A modal perspective on the computational complexity of attribute value grammar
Patrick Blackburn,Edith Spaan +1 more
TL;DR: In this article, the complexity of the satisfiability problem for nine modal languages which mirror different aspects of AVS description formalisms was studied, including the ability to express re-entrancy, generalisations, and recursive constraints, and two main techniques were used: either Kripke models with desirable properties are constructed, or modalities are used to simulate fragments of Propositional Dynamic Logic.
Modal Logic and Attribute Value Structures
Patrick Blackburn
- 01 Jan 1993
TL;DR: The authors examines the relationship between various languages of modal logic and an approach to the specification and processing of natural language grammars currently popular in computational linguistics, and shows that the most common Attribute Value formalisms are nothing but languages of propositional modality and establish the basic logical theory of the languages concerned.
58
Related Papers (5)
Gerald Gazdar,Ewan Klein,Geoffrey K. Pullum,Ivan A. Sag +3 more
- 01 Jan 1985
Philip H. Miller,Geoffrey K. Pullum +1 more
- 01 Jan 1998
Hans Kamp,Uwe Reyle +1 more
- 01 Jan 1993