International Journal of Hospitality and Tourism Systems

2017 | Volume 10 | Issue Issue 2

Comparison of String Similarity Algorithms to Measure Lexical Similarity

1. Sagar J. Gandhi – Student, Mca Prog., Shrimad Rajchandra Instt. Of Mgt. And Comp. Applicn. Of Utu, Bardoli, Gujarat.

2. Mihirraj M. Thakor – Student, Mca Prog., Shrimad Rajchandra Instt. Of Mgt. And Comp. Applicn. Of Utu, Bardoli, Gujarat.

3. Jikitsha Sheth – Student, Mca Prog., Shrimad Rajchandra Instt. Of Mgt. And Comp. Applicn. Of Utu, Bardoli, Gujarat.

4. Hariom I. Pandit – Student, Mca Prog., Shrimad Rajchandra Instt. Of Mgt. And Comp. Applicn. Of Utu, Bardoli, Gujarat.

5. Hemin S. Patel – Student, Mca Prog., Shrimad Rajchandra Instt. Of Mgt. And Comp. Applicn. Of Utu, Bardoli, Gujarat.

Received
22-Feb-2018 		Accepted
- 		Published
22-Feb-2018
Abstract
A string similarity represents the lexical similarity between two words. This can be further exploited to identify similarity between questions. Several string similarity algorithm exists in literature. In this paper the authors have implemented five string similarity algorithms viz. Dice coefficient, Jaccard similarity, Levenshtein distance, Jaro distance and Cosine similarity. The results of these algorithms are further compared with human judges to determine, which of them resembles the human way to dissimilarize the given strings. The experimentation is done over 1000 English word pairs.
Keywords N.A.
Locked
Subscribed
Open Access
Open Access
Articles Journal Info Editorial Board Guidelines Pricing Info Peer Review & Publication Policy Submit Manuscript