A new investigation of the complexity of language identi cation is undertaken using the notion of reduction from recursion theory and complexity theory. The approach, referred to as the intrinsic complexity of language identi cation, employs notions of `weak' and `strong' reduction between learnable classes of languages. The intrinsic complexity of several classes are considered and the results...

We introduce a method for analyzing the complexity of natural language processing tasks, and for predicting the difficulty new NLP tasks. Our complexity measures are derived from the Kolmogorov complexity of a class of automata — meaning automata, whose purpose is to extract relevant pieces of information from sentences. Natural language semantics is defined only relative to the set of question...

The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learning machine. This approach provides a measure of the extent to which a learning machine has to keep revising its estimate of the number of mind changes it will make before converging to a correct hypothesis for languages...

A sequence over an alphabet Σ is called disjunctive [13] if it contains all possible finite strings over Σ as its substrings. Disjunctive sequences have been recently studied in various contexts, e.g. [12, 9]. They abound in both category and measure senses [5]. In this paper we measure the complexity of a sequence x by the complexity of the language P (x) consisting of all prefixes of x. The l...

Deenitions of complexity are traditionally given relative to a relatively low-level, machine-oriented model of computation. As programming languages become more complex, the relation between a program and its machine model time, space, etc., complexities becomes less clear. An alternative is to provide a language-oriented deenition of complexity in terms of costs that make sense for that langua...

This paper is a continuation of the work begun in 5] on establishing relative intensional expressiveness results for programming languages. Language L 1 is intensionally more expressive than L 2 , if L 1 can compute all the functions L 2 can, with at least the same asymptotic complexity. The question we address is: Does nondeterministic parallelism add intensional expressiveness? We compare det...

Sentence complexity in children with autism and specific language impairment." MA (Master of Arts) thesis, iii ABSTRACT Children with high-functioning autism, children with specific language impairment, children with autism and language impairment, and controls produced sentences after a prompt to form a sentence using a specific word. The sentences were analyzed for length and syntactic comple...