基于浅层剖析的CYK改进算法

现代汉语句法与英语句法不同,具有明显复杂性,一是不容易获得完整的规则集,二是整句剖析所得结果含有大量的歧义结构难以消除。使用分治的策略将句法剖析任务分为不同层面的小任务,逐层进行句法剖析是一种可行有效的方法。其基本思想是:首先采用多层马尔可夫模型对句子进行短语组块剖析,将整个句子分割为名词组块、动词组块等短语语块,然后在此基础上运行CYK剖析算法,剖析组块间的依存关系,最终实现对完整语句的句法分析,浅层剖析简化了CYK算法规则集,在一定程度上降低了句法剖析难度。     

A new parallel algorithm for parsing arithmetic infix expressions

A new parallel algorithm for transforming an arithmetic infix expression into a par se tree is presented. The technique is based on a result due to Fischer (1980) which enables the construction of the parse tree, by appropriately scanning the vector of precedence values associated with the elements of the expression. The algorithm presented here is suitable for execution on a shared memory model of an SIMD machine with no read/write conflicts permitted. It uses O(n) processors and has a time complexity of O(log²n) where n is the expression length. Parallel algorithms for generating code for an SIMD machine are also presented.     

220kV母差保护分列逻辑问题分析

母线保护装置的可靠性关系到电网系统的安全、稳定运行,在对金华变电站进行220 kV母差保护技改中,金华电网首次使用国电南自的SGB750装置。对SGB750做了简要介绍,同时对调试过程中遇到的分列逻辑问题进行了详细分析。     

基于TinyXML的智能变电站SCD文件的解析

介绍了变电站配置描述语言SCL,分析了SCD文件的结构,利用TinyXML解析SCD文件,并给出了流程图。     

立地评价系统的设计与实现

针对目前基层林农与林场在森林经营管理中的立地评价问题,探讨了利用林分生长模型对有林地进行评价的方法与技术,建立了以定距等分算法为核心,采用好、中、差立地等级对有林地进行评价的方法,设计了林分生长模型库,实现了生长模型解析算法.在此基础上,设计了立地评价系统工作流程和立地评价系统架构,结合无林地评价开发了基于浏览器与服务器体系结构的综合立地评价系统,从而有效满足了在只有林分生长模型情况下的立地评价需求.     

Android平台煤矿安全巡检系统客户端设计

煤矿安全巡检工作对保障煤矿安全生产至关重要.基于Android平台设计了一套用于煤矿安全巡检系统的客户端.介绍了系统组成及工作流程,重点阐述了设计中涉及的关键技术,如SAX解析、SQLite数据库、soeket通信等.实际应用表明,该客户端全面有效地推进了煤矿安全巡检工作的标准化、信息化,加大了媒矿安全生产的监控力度.     

Semantic Role Labeling of Chinese Nominal Predicates with Dependency-Driven Constituent Parse Tree Structure

This paper explores a tree kernel based method for semantic role labeling （SRL） of Chinese nominal predicates via a convolution tree kernel. In particular, a new parse tree representation structure, called dependency-driven constituent parse tree （D-CPT）, is proposed to combine the advantages of both constituent and dependence parse trees. This is achieved by directly representing various kinds of dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT （Constituent Parse Tree）. In this way, D-CPT not only keeps the dependency relationship information in the dependency parse tree （DPT） structure but also retains the basic hierarchical structure of CPT style. Moreover, several schemes are designed to extract various kinds of necessary information, such as the shortest path between the nominal predicate and the argument candidate, the support verb of the nominal predicate and the head argument modified by the argument candidate, from D-CPT. This largely reduces the noisy information inherent in D-CPT. Finally, a convolution tree kernel is employed to compute the similarity between two parse trees. Besides, we also implement a feature-based method based on D-CPT. Evaluation on Chinese NomBank corpus shows that our tree kernel based method on D-CPT performs significantly better than other tree kernel-based ones and achieves comparable performance with the state-of-the-art feature-based ones. This indicates the effectiveness of the novel D-CPT structure in representing various kinds of dependency relations in a CPT-style structure and our tree kernel based method in exploring the novel D-CPT structure. This also illustrates that the kernel-based methods are competitive and they are complementary with the feature- based methods on SRL.     

汉语多重关系复句的关系层次分析

汉语多重关系复句的句法分析问题主要由复句中的关系分析和层次分析两部分组成.将多重关系复句中的层次分析作为研究对象.它是针对多种逻辑或并列关系,按照一定层次组成复杂主从关系复句而进行的关系层次分析过程.为了有效地形式化地表示多重关系复句的层次结构,提出了关系层次树的概念,并以此为基础构造文法,采用部分数据驱动的确定性移进-归约算法实现多重关系复句的关系层次分析.通过开放测试对计算机实现的多重关系复句句法分析器进行考察,93.56%的正确率使所提出的分析方法的有效性和正确性得到了充分的验证.     

系统资源受限环境下的证书解析方法研究

证书解析是证书应用的基础,目前已知的证书解析操作均运行于操作系统应用层。这种证书解析方法尽管具有较强的通用性,但代码复杂,占用系统资源较多。本文在研究证书格式的基础上,给出了一种适用于操作系统内核层、嵌入式系统等资源受限环境的解析方法,具有实现简单、占用资源少、运行速度快等特点。     

RECOGNITION CAN BE HARDER THAN PARSING

The work presented here attempts to bring out some fundamental concepts that underlie some known parsing algorithms, usually called chart or dynamic programming parsers, in the hope of guiding the design of similar algorithms for other formalisms that could be considered for describing the "surface" syntax of languages. The key idea is that chart parsing is essentially equivalent to a simple construction of the intersection of the language (represented by its grammar) with a regular set containing only the input sentence to be parsed (represented by a finite state machine). The resulting grammar for that intersection is precisely what is usually called a shared forest: it represents all parses of a syntactically ambiguous sentence. Since most techniques for processing ill-formed input can be modeled by considering a nonsingleton regular set of input sentences, we can expect to generalize these ill-formed input processing techniques to all parsers describable with our approach.