We argue in this paper in favor of a fully constraint-based approach in the perspective of grammar development. Representing syntactic information by means of constraints makes it possible to include several parsers at the core of the development process. In this approach, any constraint (then any syntactic property) can be evaluated separately. This aspect, on top of being highly useful in a d...

Purpose: This study shows that children with Autism Spectrum Disorder experience difficulties in communicating. Theoretical framework: difficulty is the form of limited syntactic complexity which has an impact on low ability autistic to produce language, so it will also have social life and sustainability children's learning. investigates language development related provision storytelling stim...

Semantic stochastic sentence realization is still in its fledgling stage. Most of the available stochastic realizers start from syntactic structures or shallow semantic input structures which still contain numerous syntactic features. This is unsatisfactory since sentence generation traditionally starts from abstract semantic or conceptual structures. However, a change of this state of affairs ...

this paper investigates the nature of absolutive case and the syntactic mechanisms underlying its licensing. to this end, two recent minimalist approaches to the syntactic derivation of ergative structure will be introduced. drawing on evidence from the syntactic derivation of clauses with intransitive complex predicates in kurdish, it will be established that the absolutive case is checked by ...

This paper argues that case and inner aspect are independent syntactic relations. In particular I argue that there is no direct syntactic relation between the appearance of accusative case on the direct object and a telic interpretation of a predicate. I argue that accusative case is an Agree relation with v° and aspect is an Agree relation with Asp°, an aspectual head between vP and VP respons...

Necessary and sufficient conditions on a monoid M are found in order that M be isomorphic to the syntactic monoid of a language L over an alphabet X having one of the following properties. In the first theorem L is a /¿-class and Pw¡¡\ Q PL where PL is the syntactic congruence of L and W(L) is the residue of L . In the second theorem L is an infix code; that is, satisfies u, uvw 6 L implying u ...

Elizabeth Prior claims that dispositional predicates are incomplete in the sense that they have more than one argument place. To back up this claim, she offers a number of arguments that involve such ordinary dispositional predicates as ‘fragile’, ‘soluble’, and so on. In this paper, I will first demonstrate that one of Prior’s arguments that ‘is fragile’ is an incomplete predicate is mistaken....

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...

We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts.

We study the commutative positive varieties of languages closed under various operations: shuffle, renaming and product over one-letter alphabets. Most monoids considered in this paper are finite. In particular, we use the term variety of monoids for variety of finite monoids. Similarly, all languages considered in this paper are regular languages and hence their syntactic monoid is finite.