Abstract

In sematic Web data are represented in Resource Description Framework (RDF) in triple format (Subject, relation, Object) and retrieved using structured query such as SPARQL. These structured queries require complex syntax to formulate. In view of this therefore, several approaches have been researched to enables semantic formulation of natural language to structure query. The process involves the representation of natural language query to structured triple format. However, dues complex nature of natural language, one natural language query may have more than one possible triple format; therefore an effective semantic triple ranking framework is needed for semantic triple ranking. In this study, semantic triple ranking mechanism is proposed. The approach is based on using levenshtien string matching algorithm a reverse engineering approach. The result of the proposed triple ranking has increased precision to 0.04 and recall 0.06.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.