<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Automatic Resume Parsing using Greywolf Algorithm Integrated with Strategically Constructed Semantic Skill Ontologies</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Ayush</forename><surname>Kumar</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">National Institute of Technology</orgName>
								<address>
									<settlement>Tiruchirappalli</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Gerard</forename><surname>Deepak</surname></persName>
							<affiliation key="aff1">
								<orgName type="institution" key="instit1">Manipal Institute of Technology Bengaluru</orgName>
								<orgName type="institution" key="instit2">Manipal Academy of Higher Education</orgName>
								<address>
									<settlement>Manipal</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Sheeba</forename><surname>Priyadarshini</surname></persName>
							<affiliation key="aff2">
								<orgName type="institution">CHRIST (Deemed to be University)</orgName>
								<address>
									<settlement>Bangalore</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Automatic Resume Parsing using Greywolf Algorithm Integrated with Strategically Constructed Semantic Skill Ontologies</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">2737909C8B568460274877DFCFCB5103</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T08:18+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Resume matching</term>
					<term>Natural Language Processing</term>
					<term>Greywolf Algorithm</term>
					<term>Ontology</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The quest for finding the right candidate for their post has made the recruiters employ several methods since the beginning of corporate job recruitment. Apart from the skills and the quality of interview, a thing that matters the most and forms the basis of selection is the candidate's resume. Recruiters and companies have a tough time dealing with the several thousands resumes of the candidates which apply, as manually scanning them and finding the right selection can be tough most of the time. In this paper, Natural Language Processing(NLP) methods have been integrated with ontologies to improve the pace and quality of the recruitment process by proposing an automatic resume parser model. The resume of a candidate, along with his LinkedIn and GitHub profiles are weighted and using the Greywolf algorithm, the global maxima of the most deserving and qualified candidate are found and are recommended with a high accuracy of 96.13%.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Modern world demands optimization for almost all the tasks which are manually tiring and take a lot of time to complete. Resume matching and parsing is one of the tasks which, if automated can save a lot of time and human labor. In this highly competitive and dynamic world, the recruiters must select only a handful of candidates among the several thousand applicants which flood the company for a vacant post. The candidates, along with their technical skills and interview performance, are judged based on their resumes, which is the description of the skills of the candidate. The conventional error prone method of manually skimming all the individual resumes and shortlisting the candidates without a formal weighting algorithm is usually error prone and may lead to many discrepancies as it is also prone to corruption and favoritism. Automatic Resume Parsing (ARP) based on NLP and Machine Learning methods can be very useful for the transparent judging process and for faster results.</p><p>The proposed system aims to automate the entire selection process by integrating the social media presence of the candidate along with his/her GitHub and LinkedIn profiles which are meant to be professional. Some recruiters do not consider the social media profiles of the candidates, but it may form an important part as LinkedIn may be needed after joining the company and a candidate with an already proficient presence may perform better than others. Hence, many such aspects are considered and weighted in this system making it fool-proof and robust which considers all-round qualities of the candidate.</p><p>Motivation: The motivation behind this work is to reduce and eliminate the time taken for resume parsing and matching along with the malpractices that may happen in the case of manual resume parsing if left unregulated. Human energy and time are valuable and should be saved in order to maximize the efficiency of the organization. ARP can also result in elimination of the unskilled candidates who appear for the interview process despite human checking which may be erroneous at times. Hence, this system and model will form an essential part of the recruitment process and will result in an overall efficient and transparent recruitment system.</p><p>Contribution: The information stored in the resume is reasonably structured in most of the cases but not always. Also, the level of structuring is not enough for direct processing and so, the information is retrieved and is stored in a structured form of an ontology. Segmentation, Standardization and Structuring of the information is done and Greywolf optimization algorithm is used to maximize the objective function which is the weighted relevance of the candidate with the vacant job position. Hybrid resume matching and ranking is performed, and the identification and recommendation values are found to be in a best-in-class range. An overall accuracy of 96.13% is obtained for this ARP system with a dataset of Indian resumes.</p><p>Organization: The remainder of the paper is organized as follows: Section 2 consists of the relevant Literature Review. In Section 3, the System Architecture is described. Ontology modeling and conceptualization is dealt in Section 4. Section 5 consists of the Implementation, Results, and Discussions. The paper is finally concluded in Section 6.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Literature Review</head><p>Bhatia et al., <ref type="bibr" target="#b0">[1]</ref> have parsed the LinkedIn resumes of several candidates and have achieved an accuracy of 73% for applicant recommendation. They have also used BERT sentence pair arrangement to perform positioning dependent on their appropriateness to the set of working responsibilities. Then, they have presented a start to finish answer for positioning up-and-comers dependent on their appropriateness to a set of working responsibilities. Amin et al., <ref type="bibr" target="#b1">[2]</ref> have analyzed resumes presented by the applicants are then contrasted and the activity profile prerequisite posted by the organization spotter by utilizing strategies like AI and Natural Language Processing (NLP). A web application has been proposed by them which is supposed to support the activity candidate applicants just as the enrollment specialists to utilize it for requests for employment and screening of resumes. Yan et al., <ref type="bibr" target="#b2">[3]</ref> have suggested the advantages to get familiar with the inclination of the two scouts and employment searchers from past meeting chronicles and expect such inclination is useful to improve work continue coordinating. Along these lines, they concluded that selection representatives and abilities to be sure have inclination and such inclination can improve work continue coordinating hands on showcase. Le et al., <ref type="bibr" target="#b3">[4]</ref> have considered the decent variety of occupation necessities and the multifaceted nature of employment searchers' capacities which set forward higher prerequisites for the precision and interpretability of Person-Job Fit framework. They have proposed an Interpretable Person-Job Fit use profound intelligent portrayal figuring out how to consequently become familiar with the reliance between a resume and occupation necessities without depending on an away from of employment searcher's capacities and sends the advancing issue as a figuring out how to rank issue. Das et al., <ref type="bibr" target="#b4">[5]</ref> have addressed the problem of Named Entity Extraction based on big data tools for parsing resume. Deepak et al., <ref type="bibr" target="#b5">[6]</ref> have proposed a Resume Parser System using the Firefly algorithm which accomplished Named Entity Recognition effectively. Mirjalili et al., <ref type="bibr" target="#b6">[7]</ref> have proposed the grey Wolf optimizer which is highly suitable for finding the global maxima or the minima of a function. This method has outperformed several of the existing methods and is one of the most efficient optimization algorithms. Tobing et al., <ref type="bibr" target="#b7">[8]</ref> have proposed resume parsing system based on special headers in Indonesian language specifically for parsing resumes in Indonesia. Papers <ref type="bibr" target="#b8">[9]</ref><ref type="bibr" target="#b9">[10]</ref><ref type="bibr" target="#b10">[11]</ref><ref type="bibr" target="#b11">[12]</ref><ref type="bibr" target="#b12">[13]</ref><ref type="bibr" target="#b13">[14]</ref><ref type="bibr" target="#b14">[15]</ref><ref type="bibr" target="#b15">[16]</ref><ref type="bibr" target="#b16">[17]</ref><ref type="bibr" target="#b17">[18]</ref> discuss the various uses of Ontologies in various fields.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Proposed System Architecture</head><p>The ARP system consists of several preprocessing steps for the efficient computation of the rank of the resume, as the tool must be robust enough to handle all the exceptions that occur. As Resumes of different candidates are in different format or style, a segmentation step must be performed where the text extracted from the PDF resume is split into several subcategories which carry meaningful information. All the attributes like Education. Soft Skills, Technical Skills, Certifications are extracted here. these attributes are also present in the Ontology which is used for the efficient comparison of the text and weighting of the skills. The clustering is done such as all the information, which is unnecessary to consider, like Name, Contact, Email etc., are placed in a single cluster, and other valuable information is placed in another. The text is then standardized to match all the input resumes for efficient computation. After structuring and integrating the weights of the skills with the relevant GitHub and LinkedIn profiles, the profile is the compared with the skill ontology. Using the insights from the Ideal Resume from the company's perspective and the skill ontology, the resumes are ranked using a hybrid form of Greywolf Algorithm and the results are displayed.</p><p>The system architecture of the AMD system is shown in Fig. <ref type="figure" target="#fig_0">1</ref>. Each resume from the database is taken through a rigorous preprocessing step which converts all the structured and unstructured data present in the resume to a properly structured form ready for usage in the algorithm. The data from the PDF is extracted. After the preprocessing stage, the qualification of the candidate is weighed using a novel weighing metric which evaluate the candidate's profile and assigns him a score. These are then integrated with the GitHub and LinkedIn profile of the candidate, and an overall score describing the social media presence of the candidate is also added to the net score which always is an advantage to the recruiter. These profiles are then taken through the Greywolf algorithm which uses an innovative methodology to rank these resumes and returns the best person possible. The weighing is done using the Ontology of the skills and the jobs, and these features are linked with the profile strategically. Overall, the process of Named Entity Recognition is carried on with the novel algorithm, and the list of the top candidates is obtained. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Ontology Modeling</head><p>A dynamic Ontology is created with the complete data out the job and the skills required for it with complete details and all the possible attributes. The classes are formed by the jobs and the postings, and the instances of the class are the skills required which come under a separate class housing all the skills required and their strategic categorization. For example, an ontology is built for an FMCG company and all the posts in the domain of Administration, Marketing, Engineering, and several others are spanned in the ontology which makes this ARP system the best and a comprehensive solution for all the job requirements for the company. All the posts are covered, and the respective skills required for them are matched with those classes which can then be integrated using a suitable measure and the process of resume parsing can be carried on effectively. The overall efficiency of the ARP system can be improved, as compared to other methods, the usage of ontology can be far more efficient and accurate, as the skills can be better explained using RDF schema. A hierarchical classification is done for the job and the skills are aptly arranged so that while weighting the skills, there is no error as candidates often have extraordinary skills which are not expected, and using data mining, an efficient ontology can be created which then houses all the skills and relevant skills can get their deserved recognition. The description of skills is shown in Table <ref type="table">1</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 1</head><p>Definition of Skills &lt;AnnotationAssertion&gt; &lt;AnnotationProperty abbreviatedIRI="rdfs:label"/&gt; &lt;Literal&gt;Soft Skills&lt;/Literal&gt; &lt;/AnnotationAssertion&gt; &lt;AnnotationAssertion&gt; &lt;AnnotationProperty abbreviatedIRI="rdfs:comment"/&gt; &lt;Literal&gt;Soft skills are a cluster of productive personality traits that characterize one's relationships in a milieu. These skills can include social graces, communication abilities, language skills, personal habits, cognitive or emotional empathy, time management, teamwork and leadership traits.&lt;/Literal&gt; &lt;/AnnotationAssertion&gt; &lt;AnnotationAssertion&gt; &lt;AnnotationProperty abbreviatedIRI="rdfs:isDefinedBy"/&gt;&lt;Literal&gt;Adaptability&lt;/Literal&gt; &lt;AnnotationProperty abbreviatedIRI="rdfs:isDefinedBy"/&gt; &lt;Literal&gt;Communication&lt;/Literal&gt; &lt;AnnotationProperty abbreviatedIRI="rdfs:isDefinedBy"/&gt;&lt;Literal&gt;Enthusiasm&lt;/Literal&gt; &lt;AnnotationProperty abbreviatedIRI="rdfs:isDefinedBy"/&gt;&lt;Literal&gt;Reliability&lt;/Literal&gt; &lt;AnnotationProperty abbreviatedIRI="rdfs:isDefinedBy"/&gt;&lt;Literal&gt;Teamwork&lt;/Literal&gt; &lt;/AnnotationAssertion&gt; Entity graphs for the classes of the ontology can be created for easy representation, and hence, they are an effective method of representation of the class. The relationships between the objects and the classes are represented in a graphical format. A semantic network is formed by means of ontologies which are very efficient in terms of representing and retrieving the knowledge in a structured matter. Several properties are represented as attributes of the classes. The ontology is created in XML format, and then a method of transfiguration from XML to OWL is proposed to enhance the efficiency of the ontology. Fig. <ref type="figure">2</ref> shows the entity graph of a related skillset.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 2: Entity Graph of Soft Skills</head><p>Ontologies can be used to use the ranking attributes which can be detrimental for the job post like the Current pay, expected pay, experience etc. These are the metrics needs to be considered while deciding the salary of the candidate, and hence, they also should be considered for resume parsing. Location, Work Gap, Education, and Experience should be considered, and hence, these details must be collected from the candidate. If not available, average values should be assigned to them, and the overall score of the candidate should be reduced for not mentioning these essential details as this indicates the lack of professionalism. The skill ontology is visualized using an online ontology visualization tool called WebVOWL. This is done by creating the .owl file of the ontology first, and then uploading it to the portal. The result of visualization is shown in Figure <ref type="figure" target="#fig_1">3</ref>. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Implementation</head><p>The algorithm for Automatic Resume Parsing has been designed using the Greywolf Algorithm and implemented in Windows 10 operating system. The implementation was done on a computer with Intel i5 processor and includes 8GB of RAM. The dataset used for the implementation purpose is the Resume Corpus Collection. The pool of resumes is collected and used for implementation of this novel ARP system. Tokenizing the data obtained from the Data Extraction step of the Resume PDF is the first step of implementation. Then, the Segmentation and Structuring of the Data occurs which makes the data ready for processing. The final result of the algorithm is the filtering of the resumes and remove the resumes which are not suitable for the job post and which do not satisfy the minimum eligibility criteria for the job. The resumes are weighed, and the relative scores are used for the first stage processing, as there are several other factors which need to be considered while offering the job to the deserving candidate. The main aim is to select the set of highly qualified resumes which could be interviewed. The algorithm involves the novel Greywolf algorithm with many changes to suit the process of resume parsing. Table <ref type="table">2</ref> shows the proposed algorithm.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 2 Algorithm for Automatic Resume Parsing begin</head><p>Step 1: From the database containing applicant's resumes, each resume is denoted as a dictionary with the unique ID assigned by the recruiter as the variable name. The dictionary has the parameters as keys and the values as the Weight computed by the entry in the user resume.</p><p>Step 2: Let f(x) = (x1, x2,...,xn) be the objective function</p><p>Step 3: A list of resumes list_resume = [R1, R2, R3 ... Rn] is formed</p><p>Step 4: The consolidated weights of the resumes are calculated using the weights of the criterion and the value computed earlier.</p><p>Step 5: A constant λ is defined as the resume ranking coefficient and Candidate_List is defined as the list of selected candidates.</p><p>Step 6: The values for the coefficient vectors are initialized</p><p>Step 7:The top 3 resumes using their consolidated values are initialized as Xα, Xβ, Xδ</p><p>Step 7:iter = 0, saturation = number of candidates required for the job for candidate in range(0,saturation): while (iter &lt; max_iter) The algorithm starts with the extraction of data from the database pool. A unique ID is allotted, and the resume is taken in the form of a dictionary. The objective function is defined, and it is the value of the qualifications and the relevance of the candidate with respect to the job. The list of resumes is taken and a constant λ is defined. The Greywolf algorithm is used for this implementation. The variable saturation is the total number of candidates to be selected. The top 3 resumes using their consolidated values are initialized as alpha resume, beta resume, and the delta resume. For all the resumes in this selection, the position of the resume is updated according to the position of the alpha resume, beta resume, and the delta resumes. The coefficient is updated, and the loop continues till the value of the maximum (highest similarity with the ideal resume) of the function is computed. The postprocessing step is then carried out, and the results are visualized.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">Results and Evaluation</head><p>A confusion matrix is formed for this system, as this is basically a classification task. So, there may be some resumes which may be misclassified. The four metrics which are considered are Precision, Recall, Accuracy, and the False Positive Rate.</p><p>Precision is defined as a proportion of the recommended resumes that are truly highly qualified. Precision is measured by the formula given in Equation <ref type="formula">1</ref>.</p><formula xml:id="formula_0">𝑃𝑟𝑒𝑐𝑖𝑠𝑖𝑜𝑛 = 𝑇𝑃 𝑇𝑃 + 𝐹𝑃 − (1)</formula><p>Recall can be defined as the proportion of the recommended resumes predicted w.r.t total number of highly qualified candidates available in the application pool. is measured by the formula given in Equation <ref type="formula">2</ref>.</p><formula xml:id="formula_1">𝑅𝑒𝑐𝑎𝑙𝑙 = 𝑇𝑃 𝑇𝑃 + 𝐹𝑁 − (2)</formula><p>Accuracy can be described as in Equation <ref type="formula" target="#formula_2">3</ref>.</p><formula xml:id="formula_2">𝐴𝑐𝑐𝑢𝑟𝑎𝑐𝑦 = 𝑇𝑃 + 𝑇𝑁 𝑇𝑃 + 𝑇𝑁 + 𝐹𝑃 + 𝐹𝑁 −<label>(3)</label></formula><p>The False Positive Rate (FPR) is the number candidates who do not have the relevant skills, but are identified as highly-qualified by the system (all FPs), divided by the total number of rejected candidates. False Positive Rate (FPR) is defined as follows in Equation <ref type="formula">4</ref>.</p><formula xml:id="formula_3">𝐹𝑃𝑅 = 𝐹𝑃 𝑇𝑁 + 𝐹𝑃 − (4)</formula><p>where the parameters are defined in Table <ref type="table" target="#tab_0">3</ref>.   The proposed ARP system using Greywolf Algorithm gives an overall average accuracy of 96.13%. The proposed approach is better than many other existing approaches for Resume Parsing because the proposed system incorporates the data and its attributes in the form of an Ontology which is efficient. Also, the Greywolf algorithm is better than other optimization algorithms. Hence, the maxima of the function predicting the qualifications of the candidate is computed in an efficient manner, and the ARP system is efficient enough to yield such a high accuracy.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusions</head><p>A robust and efficient APR system is the need of the hour because of the high number of applicants applying for a job position and the smaller number of posts. The recruiting process needs to be optimized and automated because this can prevent the wasting of resources such as time and human effort. The experimental results have indicated that the APR system proposed can be dynamically integrated with the current recruitment process and the screening of resumes can be done with high accuracy. The application of ontology can be improved by using a universal ontology for all the job purposes regardless of the industry so that the accuracy can be improved. Also, the data segmentation and structuring can be improved which can result in an even higher accuracy and more precision. Overall, the Greywolf algorithm is an efficient methodology for optimization purposes and integrated with ontology, it can be used for several other purposes. An overall average accuracy of 96.13% is obtained which shows that the results obtained are best-in-class and can be incorporated in real-time recruitment process.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: System Architecture</figDesc><graphic coords="3,115.44,362.88,378.24,231.60" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Visualization of Ontology</figDesc><graphic coords="5,86.76,211.08,420.72,253.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head></head><label></label><figDesc>for i in range(1,n): Update the position by X(iter+1) = (X1 + X2 + X3) / 3 end for iter Update the values for the coefficient vectors Update Xα, Xβ, Xδ iter = iter + 1 end while Candidate_List.append(Xα) list_resume.remove(Xα) end for Step 8: Post processing the results and visualization end</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Evaluation of the ARP System</figDesc><graphic coords="8,155.76,72.00,297.60,216.36" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="4,86.16,525.24,275.64,216.12" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 3</head><label>3</label><figDesc></figDesc><table><row><cell>Parameter definition</cell><cell></cell></row><row><cell>TP -True Positive</cell><cell>Number of candidates who are qualified and</cell></row><row><cell></cell><cell>are considered qualified by the system.</cell></row><row><cell>TN -True Negative</cell><cell>Number of candidates who are not qualified</cell></row><row><cell></cell><cell>and are rightfully rejected by the system.</cell></row><row><cell>FP -False Positive</cell><cell>Number of qualified candidates which are</cell></row><row><cell></cell><cell>rejected by the system.</cell></row><row><cell>FN -False Negative</cell><cell>Number of undeserving candidates which are</cell></row><row><cell></cell><cell>identified wrongly as qualified by the system.</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 4</head><label>4</label><figDesc>Performance Measures of the proposed ARP systemTable4shows the results obtained for the Performance Measures of the proposed algorithm. The average accuracy is 96.13% and the average FPR of the ARP algorithm is 3.88%. The parameters increase with the increasing number of applications taken into consideration as expected by a neural network system. The graph of Precision vs Number of Resumes, Recall vs Number of Resumes, and Accuracy vs Number of Resumes are depicted in Fig.4.</figDesc><table><row><cell>Number of</cell><cell>Precision%</cell><cell>Recall%</cell><cell>Accuracy %</cell><cell>FPR%</cell></row><row><cell>Resumes</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>20</cell><cell>98.36</cell><cell>96.62</cell><cell>97.49</cell><cell>2.52</cell></row><row><cell>40</cell><cell>98.21</cell><cell>96.31</cell><cell>97.26</cell><cell>2.75</cell></row><row><cell>60</cell><cell>97.59</cell><cell>95.87</cell><cell>96.73</cell><cell>3.28</cell></row><row><cell>80</cell><cell>96.42</cell><cell>93.88</cell><cell>95.15</cell><cell>4.87</cell></row><row><cell>100</cell><cell>95.23</cell><cell>92.89</cell><cell>94.06</cell><cell>5.96</cell></row><row><cell>Average</cell><cell>97.16</cell><cell>95.11</cell><cell>96.13</cell><cell>3.88</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">End-to-End Resume Parsing and Finding Candidates for a Job Description using BERT</title>
		<author>
			<persName><forename type="first">V</forename><surname>Bhatia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Rawat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">R</forename><surname>Shah</surname></persName>
		</author>
		<idno type="arXiv">arXiv:1910.03089</idno>
		<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Web Application for Screening Resume</title>
		<author>
			<persName><forename type="first">S</forename><surname>Amin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Jayakar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sunny</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Babu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kiruthika</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gurjar</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Nascent Technologies in Engineering (ICNTE) IEEE</title>
				<imprint>
			<date type="published" when="2019">2019. 2019</date>
			<biblScope unit="page" from="1" to="7" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Interview Choice Reveals Your Preference on the Market: To Improve Job-Resume Matching through Profiling Memories</title>
		<author>
			<persName><forename type="first">R</forename><surname>Yan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Le</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zhao</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</title>
				<meeting>the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="914" to="922" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Towards Effective and Interpretable Person-Job Fitting</title>
		<author>
			<persName><forename type="first">R</forename><surname>Le</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Yan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 28th ACM International Conference on Information and Knowledge Management</title>
				<meeting>the 28th ACM International Conference on Information and Knowledge Management</meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="1883" to="1892" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">A CV Parser Model using Entity Extraction Process and Big Data Tools</title>
		<author>
			<persName><forename type="first">P</forename><surname>Das</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Pandey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">S</forename><surname>Rautaray</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Information Technology and Computer Science</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="page" from="21" to="31" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">A novel firefly driven scheme for resume parsing and matching based on entity linking paradigm</title>
		<author>
			<persName><forename type="first">G</forename><surname>Deepak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Teja</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Santhanavijayan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Discrete Mathematical Sciences and Cryptography</title>
		<imprint>
			<biblScope unit="volume">23</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="157" to="165" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Grey wolf optimizer</title>
		<author>
			<persName><forename type="first">S</forename><surname>Mirjalili</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Mirjalili</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lewis</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Advances in engineering software</title>
		<imprint>
			<biblScope unit="volume">69</biblScope>
			<biblScope unit="page" from="46" to="61" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Catapa Resume Parser: End to End Indonesian Resume Extraction</title>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">C L</forename><surname>Tobing</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">R</forename><surname>Suhendra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Halim</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2019 3rd International Conference on Natural Language Processing and Information Retrieval (NLPIR 2019)</title>
				<meeting>the 2019 3rd International Conference on Natural Language Processing and Information Retrieval (NLPIR 2019)<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="68" to="74" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Personalized and Enhanced Hybridized Semantic Algorithm for web image retrieval incorporating ontology classification, strategic query expansion, and content-based analysis</title>
		<author>
			<persName><forename type="first">Gerard</forename><surname>Deepak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">Sheeba</forename><surname>Priyadarshini</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Computers &amp; Electrical Engineering</title>
		<imprint>
			<biblScope unit="volume">72</biblScope>
			<biblScope unit="page" from="14" to="25" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">GenMOnto: A strategic domain ontology modelling approach for conceptualisation and evaluation of collective knowledge for mapping genomes</title>
		<author>
			<persName><forename type="first">K</forename><surname>Shreyas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Deepak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Santhanavijayan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Statistics and Management Systems</title>
		<imprint>
			<biblScope unit="volume">23</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="445" to="452" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">QuantQueryEXP: A novel strategic approach for query expansion based on quantum computing principles</title>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">S</forename><surname>Kaushik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Deepak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Santhanavijayan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Discrete Mathematical Sciences and Cryptography</title>
		<imprint>
			<biblScope unit="volume">23</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="573" to="584" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">OntoDisco: Improving Web Service Discovery by Hybridization of Ontology Focused Concept Clustering and Interface Semantics</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">N</forename><surname>Pushpa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Deepak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Thriveni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">R</forename><surname>Venugopal</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)</title>
				<meeting><address><addrLine>Bangalore, India</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2020-07">2020. July. 2020. 2020</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">An intelligent inventive system for personalised webpage recommendation based on ontology semantics</title>
		<author>
			<persName><forename type="first">Gerard</forename><surname>Deepak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ansaf</forename><surname>Ahmed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Skanda</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Intelligent Systems Technologies and Applications</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="issue">1-2</biblScope>
			<biblScope unit="page" from="115" to="132" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">A hybridized semantic trust-based framework for personalized web page recommendation</title>
		<author>
			<persName><forename type="first">G</forename><surname>Deepak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">N</forename><surname>Shwetha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">N</forename><surname>Pushpa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Thriveni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">R</forename><surname>Venugopal</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Computers and Applications</title>
		<imprint>
			<biblScope unit="page" from="1" to="11" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">MEXIN: multidialectal ontology supporting NLP approach to improve government electronic communication with the Mexican Ethnic Groups</title>
		<author>
			<persName><forename type="first">F</forename><surname>Ortiz-Rodriguez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Tiwari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Panchal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">M</forename><surname>Medina-Quintero</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Barrera</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">The 23rd Annual International Conference on Digital Government Research</title>
				<imprint>
			<date type="published" when="2022">2022. 2022</date>
			<biblScope unit="page" from="461" to="463" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<title level="m" type="main">Tools, Languages, Methodologies for Representing Semantics on the Web of Things</title>
		<editor>Mehta, S., Tiwari, S., Siarry, P., &amp; Jabbar, M. A.</editor>
		<imprint>
			<date type="published" when="2022">2022</date>
			<publisher>John Wiley &amp; Sons</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">AISHE-Onto: a semantic model for public higher education universities</title>
		<author>
			<persName><forename type="first">R</forename><surname>Panchal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Swaminarayan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Tiwari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ortiz-Rodriguez</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">The 22nd Annual International Conference on Digital Government Research</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="545" to="547" />
		</imprint>
	</monogr>
	<note>DG. O2021</note>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">EGODO ontology: sharing, retrieving, and exchanging legal documentation across e-government</title>
		<author>
			<persName><forename type="first">F</forename><surname>Ortiz-Rodriguez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">M</forename><surname>Medina-Quintero</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Tiwari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Villanueva</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Futuristic Trends for Sustainable Development and Sustainable Ecosystems</title>
				<imprint>
			<publisher>IGI Global</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="261" to="276" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
