JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.

ORG

106

A New Approach for Semantic Web Searching Using Fuzzy Logic and Natural Language Processing
Abdul Kadar Mohammad Masum, Md.Ariful Islam Khandaker, Golam Rabiul Alam
Abstract For making information in web understandable and processable to client site machine, the concept of semantic web has taken place. At present most of the information is in English and searching for information in the Web retrieves a lot of unwanted information. But most of the online population lives in non English areas and they want to get exact information supplying keywords in their own languages. In this paper, Fuzzy Logic mechanism has been proposed which retrieves the most informational data desired by a person and NLP retrieves information from the web with the facility of language independent searching. Index Terms Semantic Searching, Fuzzy Logic, Natural Language Processing (NLP), RDF and Ontology. .

1 INTRODUCTION

Search engine scans the HTML documents in the Internet to find words or phrases which match the key words and it retrieves the pages which are matched and displays to us [1]. Some problems arise when such searching is performed such as the search engine retrieves a huge number of unrelated pages and unnecessary pages. The concepts of semantic web which can be considered as intelligence and global database have been evolved to overcome such problems. It is the next step in the evaluation of the World Wide Web (WWW) where the users will be able to use programs that can understand meaning of data [2]. For real view of this visions, a good amount of recent research works have focused on annotating data using ontologies to make data machine-readable and processable. Various new technologies are adopted in the semantic web [3]. In addition to the semantic web, we need the concept of NLP-natural language processing.

web ontology language such as Notation 3 (N3) which can formally describe the semantics of classes and properties used in web documents [5].

1.2 Fuzzy Logic in Semantic Search

Fuzzy ontology have been combined to objects (stored in a database) in order to search new documents semantically correlated to users query [6]. The fuzzy ontology add a new term with the fuzzy membership function in a ontology which calculate the degree of membership value for each document to express their broader and narrower meaning [7]. Each user would have their own choice for collect item from an ontology in this basis here choice is called the membership value of the term what the user wants.

1.3 NLP in Semantic Web

In semantic web data are represented in a manageable format for all type of language. The conversion of the data from one language to another language from RDF means same [8]. So the semantic web applies a useful part for NLP. The Semantic web (a web of things) and the web as we know it today (a web of words), might well remain aligned, but this will heavily depend on advantages deriving from the additional effort of maintaining the two webs parallel. This will in term depends on facilities which are offered to do this and advantages deriving from it [9]. In this paper, we proposed a new method. First we have designed membership function for calculating membership values automatically for a collection of same documents in ontology for Semantic Search. Here same documents mean all the documents that contain same keywords. We have discussed in the existing methods can be recovered with fuzzy ontology system. Secondly weve described an algorithm for NLP in Semantic Search. Finally weve described our proposed method with an algo-

1.1 Semantic web

The semantic web is a web with a meaning [4]. In Semantic, Web information is given explicit meaning, making it easier for machines to automatically process and integrate information available on the Web. The Semantic Web will build on XML's ability to define customized tagging schemes and RDF's flexible approach to representing data. The next element required for the Semantic Web is a

Abdul Kadar Muhammad Masum is with the Department of DBA, International Islamic University Chittagong, Bangladesh-4203. Md.Ariful Islam Khandaker is with the Department of CSE, International Islamic University Chittagong, Bangladesh-4203. Golam Rabiul Alam is with the Department of CSE, International Islamic University Chittagong, Bangladesh-4203.

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

107

rithm and Fuzzy logic and NLP in Semantic Search are also described.

query terms but there are many others terms such as department, education etc. In table (2) the occurrences of the query terms are given.

PROPOSE APPROACH
TABLE 2 OCCURRENCES OF QUERY TERMS IN ALL PART OF IIUC.N3 RDF
DOCUMENT LAYER
WEIGHT PART OF RDF LAYER RDF SCHEMA SUBJECT RDF SCHEMA OBJECT RDF DATA LAYER WEIG HT 3 2 1 OCCURRENCES OF QUERY TERMS IIU BANGLAPRIUNIC GLAVATE VERSITY DESH 1 1 1 1 0 5 1 0 1 1 2 1

In this paper we are considering all the documents written in RDF format. If there is a collection of RDF documents in ontology and searching is performed with some keywords by a user then documents can be retrieved from the ontology with their membership values which documents contain all the keywords. There are three step of calculation for the membership value of the document. Step-1: Calculate the weight value of all query terms in an RDF document. Step-2: Calculate the Membership value of each keyword in each RDF document. Step-3: Calculate the membership values for each document including keyword membership value and compare with all documents. The main information of each RDF statement is carried by the subject and object. The verb here just represents the relation between subject and object. So we perform operation on Subject and Object for the query terms in each RDF statement. But we dont consider Verb as a query term. Now were considering the weighted value of different layer of RDF N3 document for each Subject and Object. The weighted value of different layer of RDF N3 is shown below: TABLE 1 WEIGHT VALUE OF DIFFERENT PARTS OF RDF N3 LAYER
Part of RDF N3 Layer RDF Schema Subject RDF Schema Object RDF data layer Weight value 3 2 1

By using equation no. 1 now we can calculate total weighted values for each query term from table 2 that is given in table 3.

TABLE 3 WEIGHTED VALUES FOR QUERY TERMS IN IIUC.N3 RDF DOCUMENT.

Weight Part of RDF layer RDF Schema Subject RDF Schema Object RDF data layer Total Weight 3 2 1 Weight of query term in diff part of RDF layer Iiuc bangladesh private university (Li*Wi) (Li*Wi) (Li*Wi) (Li*Wi) (1*3)=3 (1*3)=3 (1*3)=3 (1*3)=3 (0*2)=0 (5*1)=5 8 (1*2)=2 (0*1)=0 5 (1*2)=2 (1*1)=1 6 (2*2)=4 (1*1)=1 8

Here we consider RDF Schema rdfs:SubclassOf for indicating Ontology but there are many other RDF Schemas available for RDF N3 document. In table 1 subject of RDF schema rdfs:SubclassOf is given weighted value 3 and the Object of that schema is given weighted value 2. For example <uri:iiuc><rdfs:SubclassOf><uri:university> is a RDF Schema statement. The Subject part of RDF Schema in this statement is iiuc and The Object part of RDF Schema is university. The weighted value for iiuc is 3 and weighted value for university is 2. The equation for calculating total weighted values of a query term in RDF N3 document is:

If we consider the keywords Semantic and Fuzzy are supplied such as Semantic+Fuzzy for searching document. Then any document which contain two of the keywords, for example if Document 1 and Document 2 contain both the keywords Semantic and Fuzzy the weighted value of both keyword in Document 1 and Document 2 is given in the following table: TABLE 4 WEIGHT VALUE FOR KEYWORD SEMANTIC AND FUZZY IN DOC1 AND DOC2.
Weight of keyword in Doc 1 Fuzzy 8 Semantic 3 Weight of keyword in Doc 2 Fuzzy 6 Semantic 2

Q weignt

1 Where, Li = Number of occurrences of a query term in RDF Layer Part i. K= Total number of Parts in a RDF layer (here k=3). Wi= Weighted value for the Part i in RDF Layer. Now we calculate the weight value for each query term for a RDF N3 document iiuc.n3 . We have calculated only for iiuc bangladesh, private, and university

Li *Wi . (1)

i k

We have designed a membership function to assign automatic membership value to each keyword in a document when search is occurring. The function is:

Automatic

kw kw .....(2)
i 1 1

jd ik

Where , kw = The weight value of the keyword in a document which membership value is calculated. i k
= Summing of the weight values of all keywords in a document k= Number of keywords which is supplied for searching. d = Number of documents which contain all the supplied
1

kw
i

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

108
Automatic value 0.6 and Semantic is: manually it is given membership value 0.4

keywords. j d i k = Total summation of weight values of all key-

3 / 11

kw
1 1

=0.27 and

words for all document which contain all keywords. is the membership function for all keyword. Now using the equation no 2 we can calculate the membership value for keywords in a document. Now we calculate the membership value from table 4 for keywords Fuzzy and Semantic for doc1 and doc2. TABLE 5 TOTAL WEIGHTED VALUES FOR KEYWORDS SEMANTIC AND FUZZY IN DOC1 AND DOC2.
Automatic

Fuzzy Weight in Doc 1 Weight in Doc 2

Semantic

Total weight in doc

Total weight in all doc

kw
1

i k

kw
1 1

j d i k

8 6

3 2

11 8 (11+8)=19

For document 2: The membership value for keyword Fuzzy is: and Automatic 6 / 8 0.75manually it is given membership value 0.6 and Semantic is Automatic 2 / 8 0.25and manually it is given membership value 0.4. We have made a calculation for finding the richest document among 4 documents. That was the first step of calculation. The calculation is done for each document as mentioned earlier that this is done for a large collection of document in Ontology. If the keyword Semantic have weighted values 13, 17,and 7 in doc 1,doc 2, and doc 3 respectively. Now we calculate the membership value of keyword Semantic for each document using equation no 3. TABLE 7 MEMBERSHIP VALUE OF TERM SEMANTIC IN EACH DOCUMENT.
Document Weight of Semantic 13 17 2 Membership Semantic 0.27 0.35 0.04 value of

For document 1: The membership

value

for

keyword

Fuzzy

is:

Doc 1 Doc 2 Doc 3

Automatic

8 / 19

=0.42 and the membership value for key-

=0.15 word Semantic is: Automatic For document 2: The membership value for keyword Fuzzy is: Automatic 6 / 19 0.35 and the membership value for keyword Semantic is: Automatic 2 / 19 0.11 If user set manually membership value of keyword then we calculate the automatic membership value of that keyword in the document by the following equation: i k Automatic kwi kwi.(5) 1 Where, kwi = Sum of weight of all keywords in the document. kwi= The weight of the keyword no i which is supplied for searching in the document. k= Number of keywords supplied to search the document. One can assign the membership value for keyword, Such as 0.6 for Semantic and 0.4 for Fuzzy. Now we need to calculate the membership value of the keywords for document. Assume doc1 and doc2 contain both keywords and their weight values that are given in the following table: TABLE 6 TOTAL WEIGHT VALUE FOR KEYWORDS SEMANTIC AND FUZZY IN DOC1 AND DOC2.
Document Weight of keyword in Doc 1 Weight of keyword in Doc 2 Fuzzy 8 6 Semantic 3 2 Sum of weight 11 8

3 / 19

From table 7 membership value of doc1 is 0.27, doc2 is 0.35, doc3 is 0.04, doc4 is 0.14 and doc5 is 0.2 so the most useful document for keyword Semantic is document 2 because its membership value is highest. Now at this time the following steps have to be performed for automatic membership value assignment in a document, Step 1: Find the automatic membership value for each keyword for each document using equation no 3. Step 2: Find the Minimum membership value of the keyword for each document individually. Step 3: Calculate the fuzzy MIN operation between every two pair of keywords for each document individually. Step 4: Calculate the total sum of all fuzzy MIN operation from step 3 for each document individually. Step 5: Finally calculate summation of Minimum membership value of keywords from step 2 with total sum of all fuzzy MIN operation from step 4 for each document individually. Here is an example for three keywords kw1, kw2, kw3 which are supplied by a user for searching the best document. Suppose the documents doc1, doc2 and doc3 contain these three keywords with various weighted values. The weight values of keywords are given in following table:

Using equation no 5 we can calculate membership value for each documents keywords. For document 1: The membership value for keyword Fuzzy is:

TABLE 8 WEIGHTED VALUES OF KW1, KW2 AND KW3IN EACH DOCUMENT.

Document KW1 Weight value KW2 KW3

Automatic

8 / 11

=0.73 and manually it is given membership

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

109

doc 1 doc 2 doc 3

6 8 3

4 8 4

5 3 6

value is the highest considering the keywords kw1, kw2 and kw3. Manually membership value assignment If the membership value of each keyword is user defined such as kws1=0.2, kws2=0.3 and kws3=0.5 and there is any document which automatic membership value for the three keywords are all the same. The document is the perfect document. But if there is no document like exactly perfect then what will be the nearly perfect document? Here is an example for three keywords and four different documents. Assume the weighted values for keywords in four documents are like below: TABLE 10 WEIGHT VALUE OF KW1, KW2 AND KW3IN EACH DOCUMENT.
Weight value Document Doc 1 Doc 2 Doc 3 Kw1 4 3 4 Kw2 2 3 4 Kw3 4 4 8

Now apply the five steps for calculating document membership value. Step 1: calculate the membership values of keywords kw1, kw2 and kw3 for each document using equation no 3 if we use equation no 4 the result will be same. We get TABLE 9 MEMBERSHIP VALUES OF KW1, KW2 AND KW3 IN EACH DOCUMENT.
Membership value of the keyword Document KW1 Doc 1 Doc 2 Doc 3 0.13 0.17 0.06 KW2 0.09 0.17 0.09 KW3 0.11 0.06 0.13

Step 2: Find out the Minimum membership value of the keywords for each document-using table 5.16. Doc1 Minimum = 0.09 Doc2 Minimum = 0.06 Doc3 Minimum = 0.06 Step 3: Calculate the fuzzy MIN operation among every two pair of keywords for each document-using table 9. Doc1 Doc2 Doc 3 MIN(kw1,kw2)=0.09MIN(kw1,kw2)=0.17 MIN(kw1,kw2)=0.06 MIN(kw1,kw3)=0.11 MIN(kw1,kw3)=0.06 MIN(kw1,kw3)=0.06 MIN(kw2,kw3)=0.09 MIN(kw2,kw3)=0.06 MIN(kw2,kw3)=0.06 Step 4: Calculate the total sum of all fuzzy MIN operation from step 3 for each document. Doc1 Doc2 Doc3 Total MIN = 0.29 Total MIN = 0.29 Total MIN = 0.21 Step 5: Finally calculate summation of minimum membership values of keywords from step 2 with total sum of all fuzzy MIN operations from step 4 for each document. Doc1 Sum = Minimum +Total MIN =0.09+0.29 =0.38 Doc2 Sum = Minimum +Total MIN =0.06+0.29 =0.35 Doc3 Sum = Minimum +Total MIN =0.06+0.21 =0.27 Doc1 Doc2 Doc3 Total =0.38 Total =0.35 Total =0.27 From step 5 it is seen that the Doc1, which total sum is the largest among Doc2 and Doc3. So the best document is Doc1 among these three documents and its membership

Step 1: Considering the automatic membership value for each keyword using equation no 5 we get TABLE 11 MEMBERSHIP VALUE OF KW1, KW2 AND KW3 IN EACH DOCUMENT.
Document Doc 1 Doc 2 Doc 3 Membership value of the keyword KW1 0.4 0.3 0.25 KW2 0.2 0.3 0.25 KW3 0.4 0.4 0.5

Step 2: Now find the difference of membership values between manually given membership value and automatic membership value. Here, kws1=0.2, kws2=0.2 and kws3=0.5 Doc1 Doc2 Doc3 |kw1-kws1|= 0.2 |kw1-kws1|=0.1 |KW1-KWS1|= 0.05 |kw2-kws2|= 0.1 |kw2-kws2|=0.1 |KW2-KWS2|= 0.05 |KW3-KWS3|= 0.0 |kw3-kws3|= 0.1 |kw3-kws3|=0.1 Step 3: Find the total value of differences for each keyword from step 2 and select the lowest total value. The lowest total value is the nearly perfect document. Doc1 Doc2 Doc 3 Total =0.4 Total =0.3 Total =0.1 From step 3 its seen that Doc3 is the nearly perfect document comparing with manually given membership keyword value.

2.1 Translator Devolopement

We have actually made a keyword dictionary. In the dictionary, every pair of English and Bangla keyword is stored there with their same meaning. When a translation is occured with a keyword then it searches in its dictionary database with the keyword, which is supplied for translating. Finally it matches the keyword meaning and returns the translated keyword into desired language.

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

110

We have applied both concepts of Fuzzy Logic and NLP in semantic web for semantic searching. The algorithm steps are given below: Step 1: Request for information with some keywords and inform about desired language in which you want information. Step 2: Identify the keywords in which language it is written with the help of NLP. Step 3: Translate the keyword with help of NLP into desired language if input keyword language is not same as desired language other wise no need to translate. Step 4: Apply the concept of Fuzzy Logic with the keyword from step 3 and retrieve the related information from searching ontology. Step 5: Select the best information from searched results and display it to the user.

<uri/university><rdf/type><rdf/class>. <uri/bangladesh private university><rdfs/subclassof><uri/university>. <uri/iiuc><rdfs/subclassof><uri/bangladesh private university>. <uri/IIUC><uri/is>a<uri/Private university>. <uri/http://www.iiuc.ac.ed><rdfs/rdfn3><iiuc.n3>. <uri/ web site of IIUC> <uri/is><uri/http://www.iiuc.ac.ed>. <uri/It's><rdfs/equivalentto><uri/IIUC>. <uri/It's parmanent campus><uri/is>;<uri/situated>in<uri/shitakundo>. <uri/It><rdfs/sameas><uri/IIUC>. <uri/here><rdfs/sameas><uri/IIUC>. <uri/It><uri/have>many<uri/depertment modern science>,<uri/business administration>. <uri/here><uri/provide><uri/smart>,<uri/education>.

If the information is in bangla then we represent information in RDF as :

IMPLEMENTATION

3. 1 Parser Designing
We design a parser which can parse information written in any language specially in English or in Bangla . The parser can understated which statement is in bangla and which is in English. Parser represents bangla statement as Subject, Object and Verb and represents English statement as Subject, Verb and Object.

Representation in RDF format @prefix rdf: <http://www.w3.org/1999/02/22-rdfsyntax-ns#>. @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>. @prefix uri: <http://www.iiuc.ac.ed/#>. <uri/university><rdf/type><rdf/class>.

3.2 Knowledge Space Construction

The knowledge space is constructed such that a program can access it. In the knowledge space the information or resource is contained in a document. Here RDF statements are used. Each RDF statement is a resource defining triples. Each resource must have at least three properties. These are rdf:subject, rdf:object, and rdf:predicate. Each RDF statement in an ontology can define a class and the properties and the relationships of these class with other classes. For example, an RDF statement is as follows: <#IIUC><#is><#a private university> Here all these triples-IIUC, is, and a private university are qualified by the usage of URIs. The data structure stores the subject (IIUC), the object (a private university), and the verb (is) and relates them. So, there are two principal components of data structure. These are concept and link. Concepts: Concepts are also called KObjects. They contain information of each class. They contain information of each class. Here IIUC and a private university are qualified to be concepts. Links: Links are also called relationships. Links establish relationships among the KObjects.

3.3 The University Ontology

In Bangladesh ontology we assume that the University a sub ontology of Bangladesh. In Bangladesh there are different kinds of Universities such as, Public University, Private University. So Public University and Private University are the sub ontology of University ontology.
Public University University Private Universi-

Fig. 3. The University ontology under Bangladesh ontology

3.4 The Techniques of the Semantic Search

This paper is done for a large knowledge space that is large number of similar documents are exist in an Ontological knowledge space. Suppose one wants to get that document or document which membership value is 6.0 or more than 0.6 up to 1.0. Then he or she easily can get the

A simple example of data representation in RDF format is given bellow:

@prefix rdf: <http://www.w3.org/1999/02/22-rdfsyntax-ns#>. @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>. @prefix uri: <http://www.iiuc.ac.ed/#>.

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

111

documents. But in simple semantic search normally we will get a large number of documents if there are a huge number of similar documents. There is one example: The keywords required for the above information are: Bangladesh, University and Private. The keywords will be input as .The searching algorithm will translate the keywords into Bangladesh+University+Private with the help of machinetranslator. Then, the algorithm will first search in Bangladesh ontology. It will get the following result:
Keywords Ontology Bangladesh+University+Private Bangladesh+University+Private

Fig. 4. Result for input Bangla keyword and outputs English document.

In figure 4, iiuc.n3 is a RDF document which contain information in English and its automatically membership value is 1.0 here. There is no set value in the accuracy box.

The normal semantic search engine cant identify specific document when there are more than one same documents exist in Ontology. But when using the fuzzy degree of membership in Ontology then it can take some enhanced inference as user wants.

Fig. 5 Result for input bangla and output English document with accuracy value.

4 EXPERMENTAL RESULT
This simulation software is build to dynamically create new ontology. In this section, we have shown the output result only for Bangladesh ontology. The important parts of our software are two special options for searching documents. User can search document selecting Genuine Search option or Advance Search option. This software by default works as Genuine Search. Genuine Search finds the document from user input keywords and outputs automatically the best document. If the Advance search option is selected then the software waits for inputting the membership value of each keyword by which user wants to get the document. In Advance Search option user can set keywords membership value manually. The experimental results of our simulation software are given below: Input Keywords: In Bangla and Output Document: In English If we search by writing keyword in bangla such as, and select English web option for finding English document and click on the Semantic Search button. Then search engine, first translates the keywords into English keywords like bangladesh+university+private. Then search its database and finds the documents which contain all the keywords after this calculates the degree of membership value for all documents and finally it returns the best document to the user.

Now in figure 5, If the user set the value 80 in accuracy box all the documents are shown with ranking. Here membership value of aiub.n3 is 0.8 or near to 0.8. So it is placed in last position. According to membership value, the output documents here iiuc.n3, nsu.n3, iub.n3 and aiub.n3 all are the English document in RDF format. In figure 4 if we click on the document iiuc.n3 then the RDF parser is invoked with document iiuc.n3 and parser parses the document then show the information to user via browser.

Fig. 6. View the information in iiuc.n3 by RDF parser

In figure 6, by this parser we can also view the information of any document just putting documents name in parser text box and have to click on the Click for browse button. Input Keywords: In English and Output Document: In Bangla If we search by writing key word in English such as, bangladesh+university+private and select Bangla web option for finding Bangla documents and click on the Semantic Search button. Then search engine first, translates the keyword into Bangla keyword. Then searches its database and finds the best document to display the result to the users which is shown in following figure.

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

112

Fig. 7. Result for input English keyword and output bangla document.

Fig. 10. Interface for input keywords membership value.

If in figure 9 membership values are set to each keyword as10 for Bangladesh, 25 for university, 25 for public, 40 for engineering and user is to click on the Semantic Search button.

Fig. 8. View the information in bangla.n3 document by RDF parser

In figure 7, the output result for input English keyword and output bangla document is shown. Here bangla.n3 is a document which contains information in Bangla. If we want to view the document bangla.n3 shown in fig 5. Input Keywords: In English with their membership value and Output Document: In English For Advance Search users have to select the Advance Search option. If in fig 9 input keyword is in English such as, bangladesh+university+public+engineering and select English web for English document and click on the Set Semantic button to set membership value in each keyword.

Fig. 11. Output result for given membership value of keyword

From figure 11 weve got two documents engunv2.n3 and engunv5.n3 here both membership value is 1.0. The information in this document exists as user set membership of keyword preference. If we set a value in accuracy box in figure 10 which is shown in figure 12 then the output result is changed and the result is shown in figure 13.

Fig. 12. Output result for membership value keyword and accuracy value.

Fig 9: Interface for input keyword in Advance Search option.

Now users have to set membership value manually in each keyword in fig 10 as percentage and total sum of percentage must be equal to 100.

Fig. 13.Output result for membership value keyword with accuracy value.

From figure 13 we see the result that the document whose membership value is in 1.0 to 0.8 with the consideration

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 6, JUNE 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

113

of keywords membership value which we have supplied in figure 12.

CONCLUSION

The Semantic Web has often been called ambitious, and while it may not achieve all of its goals it seems likely that it will achieve at least some [10]. In the near future, more RDF content and Semantic Web Services are likely to become available, along with interesting and novel ways to use them. We will likely see some good progress on the more advanced Semantic Semantic Web is somewhat an automation of the traditional Web. For automating the Web, a good number of technologies may be employed. Among these technologies, Fuzzy Logic and Natural Language Processing is a dominating among them. In this paper, we tried to explore the contribution of Fuzzy Logic and NLP in creating Semantic Web and the portion of Fuzzy Logic Specially addressing the overloaded nature of terms in ontology, the Fuzzy Ontology allows the use of ontologies for information retrieval may extended way. Also the portion, of NLP, which is emphasized, in this paper, is machine translation. Actually machine translation or inter-language text conversion can play a tremendous role in Semantic Web. Because, in this case, the Web as well as the users of the Web would be able to free from any classification of the languages and any language can be utilized in either case.

Systems", in IST Transactions of Information Technology- Theory and Applications, Vol. 1, No. 1 (2), ISSN 1913-8822, pp. 1-7, Date Published: July 2010 [9] Luca Dini, CELI s.r.l., Corso Moncalieri 21, 10131-Torino, Italia. NLP Technology and Semantic web. Risks, Technologies, and Challenges, 1999. [10] Esmail, K. Abul, H. A Categorization Scheme for Semantic Search Engines. Semantic web Research Laboratiory, Computer Engineering Dept. Sharif University of Technology, Teharn, Iran, 2006.

First A. Author Abdul Kadar Muhammad obtained Bsc Degree on Computer Science & Engineering from International Islamic University Chittagong, Bangladesh. He is now working as Assistant Professor in this university and doing Msc in CSE in United International University of Bangladesh. Second B. Author Md.Ariful Islam Khandaker obtained Bsc Degree on Computer Science & Engineering from Khulna University of Engineering & Technology which is one of the top classes Engineering Universitie of Bangladesh. Now he is persuing Msc Degree on Computer Science & Engineering from another renowned university of Bangladesh naemed Chittagong University of Engineerin & Technology. He is now teaching in a university named International Islamic University Chittagong, Bangladesh as a Lecturer in CSE Department.He is working with Semantic Web now. Third C. Author Golam Rabiul Alam obtained Bsc Degree on Computer Science & Engineering from Khulna University, Bangladesh. He is now working as Assistant Professor in this university and doing Msc in CSE in Dhaka University of Bangladesh.

REFERENCES
[1] Walter R, Francisco J. L, Pedro R. M, and Javier N, Exploring the Advances in Semantic Search Engines , International Symposium on Distributed Computing and Artificial Intelligence 2010 (DCAI-2010), Advances in Intelligent and Soft-Computing. Springer, 2010, vol. 79, p. 613-620. Eetu Makela Survey of Semantic Search Research Semantic Computing Research Group, Helsinki Institute for Information Technology (HIIT), Helsinki University of Technology, Media Technology, and University of Helsinki. Myungjin Lee1, Wooju Kim1, June Seok Hong and Sangun Park, Semantic association-based search and Visualization method on the semantic web Portal, International Journal of Computer Networks & Communications (IJCNC), Vol.2, No.1, January 2010 Sheth, A.Ramkrishnan, C. Thomas, C. Semantic for The Semantic Web: The Implicit, the Formal and the Powerful, Intl Journal on Semantic Web & Information Systems, 1(1), 1-18, Jan-March,2005. Makela, E. Survey of Semantic Search Research, Semantic Computing Research Group, Helsinki Institute for Information Technology (HIIT), 2006. Nazmul Hasan Adopting the Concept of Fuzzy Logic In Semantic Web Department of Computer Science & Engineering, Chittagong University of Engineering and Technology, Chittagong-4349, Bangladesh, 2007. Silvia Calegari and Elie Sanchez A Fuzzy Ontology-Approach to improve Semantic Information Retrieval Dipartimento Di Informatica, Sistemistica e Comunicazione Universit`a di Milano Bicocca V.le Sarca 336/14, 20126 Milano (Italia). Ahmed. Z, S. Majeed, T. Dandekar: "Towards Design and Implementation of a Language Technology based Information Processor for PDM

[2]

[3]

[4]

[5]

[6]

[7]

[8]