Computational Grammars can be adapted to detect ungrammatical sentences, effectively transforming them into error detection (or correction) systems. In this paper we provide a theoretical account of how adapt implemented HPSG grammars for grammatical detection. We discuss single input reconstructed in multiple ways and, turn, used specific, high-quality feedback language learners. then move on ...

The markedness theory has been becoming an important tool to directly link formal (structural) linguistic data and properties across languages. Markedness is one of the criteria which used determine asymmetry grammatical constructions in languages being learnt. So far, typological analyses on non-verbal Minangkabaunese[1] have not particularly based yet. Therefore, analysis Minangkabaunese ling...

Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets intractable. This paper presents a probabilistic model of English grammar that is much simpler than conventional models, but which admits an efficient EM training algorithm. The model is based upon grammatical bigrams, i....

This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic programming based on Social Learning, Social Programming or Swarm Programming. Each individual particle represents choices of program construction rules, where these rules are specified using a Backus-Naur Form grammar. The resu...

This study examines the potential of Grammatical Evolution to uncover a series of useful rules which can assist in predicting corporate failure using information drawn from financial statements. A sample of 178 publically quoted, failed and non-failed US firms, drawn from the period 1991 to 2000 are used to train and test the model. The preliminary findings indicate that the methodology has muc...

A proof is presented that shows that the number of directions determined by a function over a finite field GF (q) is either 1, at least (q+3)/2, or between q/s+1 and (q − 1)/(s − 1) for some s where GF (s) is a subfield of GF (q). Moreover the graph of those functions that determine less than half the directions is GF (s)−linear. This completes the unresolved cases s = 2 and s = 3 of the main t...

weight distribution of linear codes over GF (q l) having generator matrices over GF (q)," \New upper bound on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans.