景观的语言

将文学语言的属性赋予景观，对景观语言和文学语言，从语法和修辞手法两方面来阐述他们之间的联系和区别，从而引导人们从另一个更加人文的角度去欣赏和创造景观，并且能够参与和尊重景观语言之间的“对话”。     

Associative Grammar Combination Operators for Tree-Based Grammars

Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way that guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms.     

Context-free and context-sensitive dynamics in recurrent neural networks

Continuous-valued recurrent neural networks can learn mechanisms for processing context-free languages. The dynamics of such networks is usually based on damped oscillation around fixed points in state space and requires that the dynamical components are arranged in certain ways. It is shown that qualitatively similar dynamics with similar constraints hold for aⁿbⁿcⁿ , a context-sensitive language. The additional difficulty with aⁿbⁿcⁿ , compared with the context-free language aⁿbⁿ , consists of 'counting up' and 'counting down' letters simultaneously. The network solution is to oscillate in two principal dimensions, one for counting up and one for counting down. This study focuses on the dynamics employed by the sequential cascaded network, in contrast to the simple recurrent network, and the use of backpropagation through time. Found solutions generalize well beyond training data, however, learning is not reliable. The contribution of this study lies in demonstrating how the dynamics in recurrent neural networks that process context-free languages can also be employed in processing some context-sensitive languages (traditionally thought of as requiring additional computation resources). This continuity of mechanism between language classes contributes to our understanding of neural networks in modelling language learning and processing.     

An Empirical Approach to Spanish Anaphora Resolution

This paper documents the development of an empirically-basedsystem implemented in Prolog that automatically resolves severalkinds of anaphora in Spanish texts. These are pronominalreferences, surface-count anaphora, one-anaphora and ellipticalzero-subject constructions (i.e., sentences that omit theirpronominal subject). The resolution is based onrepresentations resulting from either partial or full parsing. Thesystem developed can also work on the output of a POStagger or with different dictionaries, without changing thegrammar. This grammar represents the syntactic information of eachlanguage by means of the Slot Unification Grammar formalism. The different kinds of information used for anaphora resolution in full and partial parsing are shown, as wellas evaluation results. The system has been adapted toEnglish texts, obtaining encouraging results that prove that itcan be applied with only a very few refinements to other languagesas well as Spanish and English. In addition, the differencesbetween English and Spanish anaphora are noted.     

原则-参数理论在二语习得中的应用

Chomsky提出由原则和参数系统构成的普遍语法,意在揭示人类语言共有的、抽象的属性;十几年来,外语相关理论的研究在国内和国外都有相当的发展,普遍语法原则与参数理论在二语习得中的应用研究在国内也随之发展起来。本文以基于普遍语法的二语习得研究范围和内容为基础,分析了普遍语法在解释二语习得的语法表征方面的理论及其在解释第二语言习得过程方面的局限性。     

可移植的汉语人—机接口系统的研究与实现

可移植汉语人一机接口是我国界当前研究的热点之一。本文通过分析汉语的特点, 对在微机上建造中小型应用系统的可移植汉语人一机接口, 提出了一种切实可行的实现方法, 文中还介绍了反用这一方法实现的实验系统的具体结构。     

Incremental generation of LR parsers

Implementation of a new compiler usually requires making frequent adjustments to grammar definitions. An incremental technique for updating the parser tables after a monor change to the grammer could potentially save much computational effort. More importantly, debugging a grammar is made easier if the grammar is re-checked for correctness after each small change to the grammar. The basic design philosophy of an incremental parser generator, and incremental algorithms for LR(0), SLR(1) and LALR(1) parser generation are discussed in this paper. Some of these algorithms have been incorporated into an implementation of an incremental LALR(1) parser generator.     

CIMS软件开发工具：Petri网编辑器的语法分析及其实现

本文给出并发表达式语言的文法，并描述了Petri网编辑器的语法分析过程和中间代码的产生过程。解决了Petri网在计算机中的存贮结构问题，处理了可能会出现的重名变量，实现了从井发表达式语言到安全标号的Petri网的转换工作。     

基于语法的元程序设计系统的自动生成技术

本文提出一种基于语法的元程序设计系统的自动生成技术，并开发了一个元程序设计系统的自动生成系统Ａ－ＭＰＳ。元程序设计系统是一种以程序作为操作对象的有效的程序设计工具，并具有广泛的应用。     

建立现代汉语依存关系的层次体系

依存语法通过分析语言单位内成分之间的依存关系揭示其句法结构本文针对从短语到句群的各级单位内部的各种依存关系展开讨论。提出依存关系普遥存在于各级单位之中, 初步建立了汉语依存关系的层次体系。这一体系覆盖了大部分常见的语言现象, 经检验可应用于句法分析过程中, 作为表示句子结构的一种手段。为了增进体系的完备性和正确性, 显然还有许多工作要做。