This paper proposes how to convert projective dependency structures into flat phrase structures with language-independent syntactic categories, and use a head finder algorithm to convert these phrase structures back i...
详细信息
ISBN:
(纸本)9781424468973
This paper proposes how to convert projective dependency structures into flat phrase structures with language-independent syntactic categories, and use a head finder algorithm to convert these phrase structures back into dependency structures. The head finder algorithm is implemented by a maximum entropy approach with constraint information. The converted phrase structures can be parsed using a hierarchical coarse-to-fine method with latent variables. Experimental results show that the approach finds 98.8％ heads of all phrases, and our algorithm achieves state-of-the-art dependency parsing performance in English Treebank.
A regulator of the air pump switch is developed in order to realize the automation of regulating pressure of the air pump *** equipment adopts pneumatic device and stepping motor as the power transmission and actuator...
详细信息
A regulator of the air pump switch is developed in order to realize the automation of regulating pressure of the air pump *** equipment adopts pneumatic device and stepping motor as the power transmission and actuator; and realizes the automatic control of the equipment work process based on the industry control computer. The utilization of this system can improve as ten times as the productivity of the regulate system.
Mining maximal frequent itemsets is an active research area in data stream mining. A new algorithm, called MFI-TD (mine maximal frequent itemsets based on time decay model) is proposed for mining maximum frequent item...
详细信息
Mining maximal frequent itemsets is an active research area in data stream mining. A new algorithm, called MFI-TD (mine maximal frequent itemsets based on time decay model) is proposed for mining maximum frequent itemsets. A new data structure, called PW-tree ( Point based Window-tree ) is introduced to store each transaction for the current window, and the final node of the path which denotes a maximum frequent itemset is pointed by the DP ( domain pointer). Then according to the data structure, the MFI-TD gradually reduces the weight of historical transaction supporting number, and deletes the obsolete and infrequent itemset branches in PW-tree by using of time decay model. Thus MFI-TD decreases the space complexity and reduces maintenance cost of PW-tree. Experimental results show that MFI-TD has better space efficiency and result accuracy than DSM-MFI algorithm.
The closest string problem is an NP-hard problem, which arises in computational molecular biology and coding theory. Its task is to find a string that minimizes maximum Hamming distance to a given set of strings. In t...
详细信息
The closest string problem is an NP-hard problem, which arises in computational molecular biology and coding theory. Its task is to find a string that minimizes maximum Hamming distance to a given set of strings. In this paper, a compounded genetic and simulated annealing algorithm (CGSA) which combines the merits of genetic algorithms and simulated annealing is presented to solve CSP. An adapting two-point crossover operator and a heuristic gene mutation operator designed by us are used in CGSA. In addition, by analyzing the optimal solution's structural features some rules are designed to pretreat the data, which reduces the problem size. We report computational results which show that the CGSA is capable of finding good solutions in a reasonable amount of time.
In the paper, we discuss some properties of Schnorr-Adleman lattice, and improve a result in [7]. Our results can also be viewed as generalization of some results of [3] and [8] in some sense.
ISBN:
(纸本)0780378407
In the paper, we discuss some properties of Schnorr-Adleman lattice, and improve a result in [7]. Our results can also be viewed as generalization of some results of [3] and [8] in some sense.
暂无评论