2007 IEEE 23rd International Conference on Data Engineering 2007
DOI: 10.1109/icde.2007.367882
|View full text |Cite
|
Sign up to set email alerts
|

Ontology-Based Constraint Recognition for Free-Form Service Requests

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
5
1
1

Relationship

4
3

Authors

Journals

citations
Cited by 15 publications
(14 citation statements)
references
References 6 publications
0
14
0
Order By: Relevance
“…+ 05] and some work on free-form query processing [Vic06,AME07]. We nevertheless still have much work to do, even on fundamental WoK components such as creating a sharable data-frame library, constructing data frames for relationship sets, finding ways to more easily produce instance recognizers, developing processes for reverse-engineering additional genres of semi-structured sources into KBs, investigating bootstrapping as a way to construct extraction ontologies, enhancing query processing, incorporating reasoning, and addressing performance scalability.…”
Section: Resultsmentioning
confidence: 99%
“…+ 05] and some work on free-form query processing [Vic06,AME07]. We nevertheless still have much work to do, even on fundamental WoK components such as creating a sharable data-frame library, constructing data frames for relationship sets, finding ways to more easily produce instance recognizers, developing processes for reverse-engineering additional genres of semi-structured sources into KBs, investigating bootstrapping as a way to construct extraction ontologies, enhancing query processing, incorporating reasoning, and addressing performance scalability.…”
Section: Resultsmentioning
confidence: 99%
“…In this case, the web of KBs would directly support question answering-returning answers to questions and links to pages to verify answers. Indeed, as explained elsewhere [AME07], users can successfully pose free-form questions in an interface to a web of KBs. We further note that when building a KB is appropriate, none of the overhead is wasted.…”
Section: Discussionmentioning
confidence: 99%
“…For each ontology, the broker applies all the recognizers in the data frames to the request and ranks the ontology according to the number of matches the ontology has with the request. (More details about request-ontology matching and ranking can be found elsewhere [2].) The broker then selects the ontologies with the highest rank as a means to find OBWSs that can service the request.…”
Section: Request-oriented Architecturementioning
confidence: 99%