On shared indefinite expressions in coordinative structures

The paper shows that shared indefinite expressions in coordinative constructions may differ with respect to their referential properties. This is due to their being either in a focused or in a nonfocused shared constituent. Their different information-structural status follows from Rooth's theory on focus interpretation. Thus it follows that focused shared constitutents must be beyond the actual coordination and that coordinative constructions with unfocused shared constituents can be represented as ellipsis. In a focused shared constituent indefinite expressions may have a specific and an non specific unique reading as well as an non specific distributive one. For the latter we outline the idea that subjects and objects in the actual coordination form a pair of sets to which a distributing operator is attached. The set formation is further supported by plural pronouns referring to the respective set and by plural verb agreement in subsequent expressions

On describing determination in a Montague grammar

In my paper "Thesen zum Universalienprojekt" (1976) I mention two complementary procedures for discovering language universals: 1. The investigation of the dimensions and principles whose existence is necessitated by the communicative function of language; 2. The development of a formal language in which all syntactic rules are explicitly formulated and in which all syntactic categories are defined by their relation to a minimally necessary number of syntactic categories. Since the first procedure is treated in many of the other papers of this volume, I wish to discuss the role of formal methods in the research of language universals. As an example I want to take the dimensions of determination and show how expressions denoting concepts are modified and turned into reference identifying expressions. There is a general end a specific motivation for the introduction of formal methods into linguistics. The general motivation is to make statements in linguistics as exact and verifiable as they are in the natural sciences. The specific motivation is to make the grammars of various languages comparable by describing them with the same form of rules. The form has to be flexible enough to describe the phenomena of any possible natural language. All natural languages have in common that they may potentially express any meaning. The flexibility of the form of grammatical rules may therefore be attained, if syntactic rules are not isolated from the semantic function they express and syntactic classes are not defined merely by the relative position of their elements in the sentence, but also by the communicative function their elements fulfill in their combination with elements of other classes. Montague (1974) has shown that this flexibility may be attained by using the language of algebra combined with categorial grammar. Algebraic systems have been developed by mathematicians to model any systems whose operations are definable. Montague does not merely use the tools of mathematics for describing the features of language, but regards syntax, semantics and pragmatics as branches of mathematics. One of the advantages of this approach is that we may apply the laws developed by mathematicians to the systems constructed by linguists for the description and explanation of natural language

Plurals: individuals and sets in a richly typed semantics

We developed a type-theoretical framework for natural lan- guage semantics that, in addition to the usual Montagovian treatment of compositional semantics, includes a treatment of some phenomena of lex- ical semantic: coercions, meaning, transfers, (in)felicitous co-predication. In this setting we see how the various readings of plurals (collective, dis- tributive, coverings,...) can be modelled

Copredication in homotopy type theory

This paper applies homotopy type theory to formal semantics of natural languages and proposes a new model for the linguistic phenomenon of copredication. Copredication refers to sentences where two predicates which assume different requirements for their arguments are asserted for one single entity, e.g., "the lunch was delicious but took forever". This paper is particularly concerned with copredication sentences with quantification, i.e., cases where the two predicates impose distinct criteria of quantification and individuation, e.g., "Fred picked up and mastered three books." In our solution developed in homotopy type theory and using the rule of existential closure following Heim analysis of indefinites, common nouns are modeled as identifications of their aspects using HoTT identity types, e.g., the common noun book is modeled as identifications of its physical and informational aspects. The previous treatments of copredication in systems of semantics which are based on simple type theory and dependent type theories make the correct predictions but at the expense of ad hoc extensions (e.g., partial functions, dot types and coercive subtyping). The model proposed here, also predicts the correct results but using a conceptually simpler foundation and no ad hoc extensions

Attempto Controlled English (ACE)

Attempto Controlled English (ACE) allows domain specialists to interactively formulate requirements specifications in domain concepts. ACE can be accurately and efficiently processed by a computer, but is expressive enough to allow natural usage. The Attempto system translates specification texts in ACE into discourse representation structures and optionally into Prolog. Translated specification texts are incrementally added to a knowledge base. This knowledge base can be queried in ACE for verification, and it can be executed for simulation, prototyping and validation of the specification.Comment: 13 pages, compressed, uuencoded Postscript, to be presented at CLAW 96, The First International Workshop on Controlled Language Applications, Katholieke Universiteit Leuven, 26-27 March 199

Specifying Logic Programs in Controlled Natural Language

Writing specifications for computer programs is not easy since one has to take into account the disparate conceptual worlds of the application domain and of software development. To bridge this conceptual gap we propose controlled natural language as a declarative and application-specific specification language. Controlled natural language is a subset of natural language that can be accurately and efficiently processed by a computer, but is expressive enough to allow natural usage by non-specialists. Specifications in controlled natural language are automatically translated into Prolog clauses, hence become formal and executable. The translation uses a definite clause grammar (DCG) enhanced by feature structures. Inter-text references of the specification, e.g. anaphora, are resolved with the help of discourse representation theory (DRT). The generated Prolog clauses are added to a knowledge base. We have implemented a prototypical specification system that successfully processes the specification of a simple automated teller machine.Comment: 16 pages, compressed, uuencoded Postscript, published in Proceedings CLNLP 95, COMPULOGNET/ELSNET/EAGLES Workshop on Computational Logic for Natural Language Processing, Edinburgh, April 3-5, 199

Controlled Natural Language Processing as Answer Set Programming: an Experiment

Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that relies on different software components. We investigate in this paper in an experimental way how well answer set programming (ASP) is suited as a unifying framework for parsing a CNL, deriving a formal representation for the resulting syntax trees, and for reasoning with that representation. We start from a list of input tokens in ASP notation and show how this input can be transformed into a syntax tree using an ASP grammar and then into reified ASP rules in form of a set of facts. These facts are then processed by an ASP meta-interpreter that allows us to infer new knowledge