期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Ontology-based question expansion for question similarity calculation
1
作者 刘里 樊孝忠 +1 位作者 齐全 刘小明 《Journal of Beijing Institute of Technology》 EI CAS 2011年第2期244-248,共5页
A new ontology-based question expansion (OBQE) method is proposed for question similarity calculation in a frequently asked question (FAQ) answering system. Traditional question similarity calculation methods use ... A new ontology-based question expansion (OBQE) method is proposed for question similarity calculation in a frequently asked question (FAQ) answering system. Traditional question similarity calculation methods use "word" to compose question vector, that the semantic relations between words are ignored. OBQE takes the relation as an important part. The process of the new system is:① to build two-layered domain ontology referring to WordNet and domain corpse;② to expand question trunks into domain cases;③ to use domain case composed vector to calculate question similarity. The experimental result shows that the performance of question similarity calculation with OBQE is being improved. 展开更多
关键词 ONTOLOGY conception extraction question expansion question trunk question similarity calculation
在线阅读 下载PDF
Robust Integrated Models for Chinese Predicate-Argument Structure Analysis
2
作者 罗彦彦 浅原正幸 松本裕治 《China Communications》 SCIE CSCD 2012年第3期10-18,共9页
Predicate-Argument (PA) structure anal- ysis is often divided into three subtasks: predicate sense disambiguation, argument identification and argument classification mostly been modeled in To date, they have isol... Predicate-Argument (PA) structure anal- ysis is often divided into three subtasks: predicate sense disambiguation, argument identification and argument classification mostly been modeled in To date, they have isolation. However, this approach neglects logical constraints between them. We therefore exploite integrating predicate sense disambiguation with the latter two subtasks respectively, which verifies that the automatic predicate sense disambiguation could help the se- mantic role labeling task. In addition, a dual de- composition algorithm is used to alleviate the er- ror propagation between argument identification subtask and argument classification subtask by benefitting the argument identification subtask greatly. Experiment results show that our ap- proach leads to a better performance with PA a- nalysis than other pipeline approaches. 展开更多
关键词 semantic role labeling PA structureanalysis dual decomposition joint learning
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部