Rauzy graphs of subshifts are endowed with an automaton structure. For Sturmian subshifts, it is shown that its transition semigroup is the syntactic semigroup of the language recognized by the automaton. A projective limit of the partial semigroups of nonzero regular elements of their transition semigroups is described. If the subshift is minimal, then this projective limit is isomorphic, as a...

This paper deals with the problem of the projection of arguments, i.e., how the arguments of a predicate are integrated into a syntactic structure. My starting point is the model offered in Borer (1993). This model is defined by Borer as a 'syntactic predicate based account' of the projection of arguments. In the next section I will briefly sketch the different approaches to the problem of argu...

There is substantial evidence that speakers co-ordinate their contributions in dialogue. Until now, experimental studies of co-ordination have concentrated on the development of shared strategies for reference. We present an experiment that employed a novel confederate-scripting technique to investigate whether speakers also co-ordinate syntactic structure in dialogue. Pairs of speakers took it...

In the end-user programming arena the fundamental challenges have gradually shifted from basic syntactic challenges towards semantic challenges including the need to convey an understanding of design and engineering principles relevant to end-users. Visual programming has significantly lowered the threshold of programming [1] mostly by sharply reducing or even completely eliminating syntactic p...

Prior approaches to sentence compression have taken low level syntactic constraints into account in order to maintain grammaticality. We propose and successfully evaluate a more comprehensive, generalizable feature set that takes syntactic and structural relationships into account in order to sustain variable compression rates while making compressed sentences more coherent, grammatical and rea...

In this paper we present a logical system able to compute the semantics of both declarative and interrogative sentences. Our proposed analysis takes place at both the sentential and at the discourse level. We use syntactic inference on the sentential level for declarative sentences, while the discourse level comes into play for our treatment of questions. Our formalisation uses a type logic sen...

We construct a list of binary semantic relations that combines three lists recognized at different syntactic levels { multi-clause sentences, clauses, noun phrases. We identify relations that are the same at diierent levels and represent them in a level-independent way. We base our construction on the fact that many syntactic variants express the same idea, and a linguistic expression displayin...

A natural language understanding system is described which extracts contextual information from Japanese texts. It integrates syntactic, semantic and contextual processing serially. The syntactic analyzer obtains rough syntactic structures from the text. The semantic analyzer treats modifying relations inside noun phrases and case relations among verbs and noun phrases. Then, the contextual ana...

Carnap (in, [ I ] , p. 566) has remarked that his measure function m* is jitting fof finite languages using a fixed number of one-place predicates, i.e., for any sentence i, m*(;) is the same In all such restricted finite languages in which i occurs. The main purpose of this brief note is to show by means of a counter-example that * does not have the intuitively desirable property of fittingne...

We prove that for any finite prefix code X with n elements, the non special subgroups in the syntactic monoid of X have degree at most n − 1. This implies in particular that the groups in the syntactic monoid of X are all cyclic when X is a prefix code with three elements.