1. Introduction Early accounts of epenthesis in Optimality Theory focused on epenthesis that results from constraints on prosodic structure, that is, from syllable structure constraints or minimal prosodic category (e.g. minimal word) requirements. McCarthy & Prince (1993a) account for word-internal consonant epenthesis at V-V junctures in Axininca Campa, for example, by ranking ONSET (Syllable...

Much literature in syntax has assumed that all noun phrases are categorically headed by the determiner or the noun, with well-formedness categorial in nature. In this paper I develop a theory of noun phrase structure in which both categories project noun phrases, arguing that this better fits the indeterminacy of the criteria often cited for determining headedness (Zwicky, 1985, inter alia). Th...

A Declarative Subtyping 6 A.1 Properties of Well-Formedness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1 Proposition (Weakening) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2 Proposition (Substitution) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 A.2 Reflexivity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Word frequency plays a role in reduction processes: high-frequency words undergo more reduction than low-frequency words. Pretonic schwa reduction in Dutch is susceptible to frequency effects in this way, but the well-formedness of the cluster that remains after schwa deletion also plays a role. An experiment shows that cluster well-formedness and frequency effects in fact interact with each ot...

1 Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Value and expression syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3 Context well-formedness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4 Constraint well-formedness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 5 Well-formedness of types ....

The UML 1.1. as released in September 1997 represents an improved version of the previous document by giving revised definitions of many modelling elements and including well-formedness rules, defining its four layered architecture and organisation by package, and including an Object Constraint Language Specification used within well-formedness rules. In this paper we analyse and critically ass...

Though natural language understanding systems have improved markedly in recent years, they have only begun to consider a major problem of truly natural input: ill-formedness. Quite often natural language input is ill-formed in the sense of being misspelled, ungrammatical, or not entirely meaningful. A requirement for any successful natural language interface must be that the system either intel...

We argue that there are some special situations where it can be useful to repair well-formedness violations occurring in XML-like input, giving examples from our own work. We analyze the types of errors that can occur in XML-like input and present a shallow algorithm that fixes most of these errors, without requiring knowledge of a DTD or XML Schema. A Shallow Algorithm for Correcting Nesting E...

In model-driven development of safety-critical systems (like automotive, avionics or railways), wellformedness of models is repeatedly validated in order to detect design flaws as early as possible. Validation rules are often implemented by a large amount of imperative model traversal code which makes those rule implementations complicated and hard to maintain. Additionally as models are rapidl...

For a strongly connected Extended-Free-Choice Net (EFC-net) N the algorithm given in this paper either nds a cover of S-components or recognizes that N is not well-formed. Well-formedness denotes the existence of a live and bounded marking for N. The algorithm is also adaptable to compute a cover of T-components. The time complexity is O(jPjjTj). According to the Rank Theorem, nding a cover of ...