A Constraints-based Semantic Mapping Method from Natural Language Questions to OWL

GAO Ming-xia; LIU Chun-nian

您当前的位置：

首页 >

文章列表页 >

A Constraints-based Semantic Mapping Method from Natural Language Questions to OWL

更新时间：2025-07-16

- A Constraints-based Semantic Mapping Method from Natural Language Questions to OWL
- Acta Electronica Sinica Vol. 35, Issue 8, Pages: 1598-1602(2007)
- 作者机构：
  
  北京工业大学计算机学院,多媒体与智能软件北京市重点实验室,北京,100022
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP312
- Published：2007
- 稿件说明：
移动端阅览
GAO Ming-xia, LIU Chun-nian. A Constraints-based Semantic Mapping Method from Natural Language Questions to OWL[J]. Acta Electronica Sinica, 2007, 35(8): 1598-1602.
DOI：

GAO Ming-xia, LIU Chun-nian. A Constraints-based Semantic Mapping Method from Natural Language Questions to OWL[J]. Acta Electronica Sinica, 2007, 35(8): 1598-1602. DOI：

摘要

OWL已经成为重要的知识表示和交换方式.OWL驱动的问答系统是比搜索引擎更具挑战性的研究.本文致力于解决为自然语言问题获取正确的OWL解释.考虑到问题理解的复杂性

影响因素的多样性

本文提出一种基于约束的语义映射方法.该方法分解问题成为变量

索引OWL知识成为变量域

抽象约束形成函数.并建立了目标函数完成问题变量在候选OWL知识库中获取合理解释的过程.该方法基于网络智能研究院知识库和问题集进行了初步评估.实验结果表明:和传统基于关键字匹配的算法比较

本文提出的方法使可解释问题比例增加了18%左右.

Abstract

The goal of an on-line ontology-based question-answering system is to automatically derive answers from ontology knowledge bases without demanding additional information or intervention from users.This paper focuses on solving mapping task from question variable to OWL elements

which belongs to component of question understanding in question answering system.The paper presents a principled approach

which builds on tokens of question and syntax or semantic relations from NLP into set of variables and functions of constrain

and a sound optimization-based assigning mechanism to find sound substitute in OWL knowledge for question variables.A preliminary evaluation on the International WIC Institute knowledge and questions is presented.

关键词

Keywords

references

Views

1418

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Barebones Multi-Objective Particle Swarm Optimizer for Constrained Optimization Problems

Verification of(≠,=)Constrained Workflow Robustness Based on Satisfiability Counting

Constrained Least Square Bidirectional Associative Memory

Counting Workflow Satisfiability(≠,=) and Its #P Completeness

Related Author

ZHANG Jian-hua

REN Yong-qiang

GONG Dun-wei

ZHANG Yong

WANG Gang

WANG Zhong-peng

PAN Zhi-gang

PENG Yan-bing

Related Institution

School of Information and Electrical Engineering, China University of Mining and Technology

Xuzhou Air Force College

School of Information and Electrical EngineeringChina University of Mining and TechnologyXuzhouJiangsu 221116China

Xuzhou Air Force CollegeXuzhouJiangsu 221002China

浙江科技学院信息与电子工程学院

⁰