Analysis of the source is essentially independent of the task of translation, and in fact the very same English grammar used in LMT is also used in an English data base query system. Analysis is based on a logic grammar formalism, Modular Logic Grammars (MLG’s) (McCord, 1985). MLG’s have clearly separated syntactic, lexical, and semantic components. Furthermore, syntactic structure building is ...

Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languages. ALD do not use nonterminal symbols, but rely on permissible contexts for specifying valid syntax trees. In order to assess ALD adequacy, we analyze the descriptional complexity of structurally equivalent CF and ALD...

In this paper we investigate the possibility of a syntax– semantics inferface between a framework for Model-Theoretic Syntax on one hand and a semantic network on the other hand. We focus on exploring the ability of such a pairing to solve a collection of grammar checking problems, with an emphasis on cases of missing words. We discuss a solution where constraint violations are interpreted as g...

Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languages. ALD do not use nonterminal symbols, but rely on permissible contexts for specifying valid syntax trees. In order to assess ALD adequacy, we analyze the descriptional complexity of structurally equivalent CF and ALD...

In recent years, several computational models (Alishahi & Stevenson 2008, Chang 2008, Bannard, Lieven & Tomasello 2009) have begun fulfilling the promise of usage-based construction grammar (Tomasello 2003, Goldberg 2006) as a computationally testable account of the acquisition of grammar.1 In simulating specific developmental patterns, such as the generalization of argument structure construct...

This research investigates using semantic information to learn syntax rules automatically. After describing a semantic parsing mechanism for parsing utterances based on meaning, we illustrate a grammar induction technique which uses semantic parsing’s results to create syntactic rules. We also present and discuss several experiments which use the learned grammar in syntactic parsing experiments...

Starting from the theoretical goal of syntax, and taking the difference between pedagogical grammar and syntax into consideration, this article, based on the author’s teaching practice and review of exam papers, analyzes common problems in drawing tree diagrams such as ternary branching and improper marking of grammatical categories, followed by proposals for constructing such representations, ...

Based on the st~uctuzL~m, we propose a generative semantic model which has a topological information space generative grammar as basic rules. In this model a semantic map which is called a topological information space, is generated by the grammar,and the space can express implications and simi l a r i t i e s among concepts. In the syntax, a syntactic generative grammar is defined based on the...

The GF Resource Grammar Library is a set of natural language grammars implemented in GF (Grammatical Framework). These grammars are in a strong sense parallel: they are built upon a common abstract syntax, i.e. a common tree structure. Individual languages are obtained via compositional mappings from abstract syntax trees to feature structures specific to each language. The grammar defines, for...