This paper presents an object-oriented model for machine translation based on Universal Grammar, the Universal Lexicon and language-specific grammars and the lexicons, and demonstrates the internal structures of these linguistic constructs by following a step-by-step process of English to Japanese translation. It elucidates what elements are required in the Universal Lexicon and the lexicons of...

Abstract A ‘universal grammar’ for the full spectrum of visualization types is discussed. The grammar enables analysis any type regarding its syntactic constituents, such as visual encodings and components that are used. Such an a visualization, describing compositional syntax, can be represented specification tree. Colour coded tree branches between constituent enforce combination rules visual...

Generative grammar retained from American structural linguistics the ‘formal’ approach, which basically effaces the semantic and pragmatic dimensions of grammar. This creates serious problems for an account of language acquisition, most especially the problem of how to link universal grammar to some particular language (the linking problem). Parameters do not help the situation, as they depend ...

Grammar is the computational system of language. It is a set of rules that specifies how to construct sentences out of words. Grammar is the basis of the unlimited expressibility of human language. Children acquire the grammar of their native language without formal education simply by hearing a number of sample sentences. Children could not solve this learning task if they did not have some pr...

Every language has its characteristics and rules, though all languages share the same components like words, sentences, subject, verb, object and so on. Nevertheless, Chomsky suggested the theory of language acquisition in children instinctively through a universal grammar that represents a universal grammar for all human languages. Since it has its declaration, this theory has encountered crit...

In probabilistic grammar induction, to avoid overfitting, simplicity priors are often used, which favor smaller grammars. An example of simplicity priors is Solomonoff’s universal probability distribution , where is the description length of the grammar G. The Hierarchical Dirichlet process (HDP) [Teh, et al., 2006] has recently been used as a prior for the transition probabilities of a probabi...

The paper takes a look at the history of the idea of universal grammar and compares it to multilingual grammars, as formalized in the Grammatical Framework, GF. Résumé. L’article jette un coup d’oeil sur l’histoire de l’idée d’une grammaire universelle et fait ensuite une comparaison avec les grammaires multilingues, telles que formalisées dans GF, “Grammatical Framework”.

The perspective of this paper is to compare mathematical models for the evolutionary dynamics of genomes and languages. The quasispecies equation describes the evolution of genetic sequences under the influence of mutation and selection. A central result is an error threshold which specifies the minimum replication accuracy required for maintaining genetic information of a certain length. The l...