A Framework for Name Search and Spell Check for Social Network Application using Regular Expression & Hashing

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2016 by IJCTT Journal
Volume-34 Number-4
Year of Publication : 2016
Authors : Ritesh Kothari, Nishchol Mishra, SanjeevSharma, Jitendra Singh Verma
  10.14445/22312803/IJCTT-V34P132

MLA

Ritesh Kothari, Nishchol Mishra, SanjeevSharma, Jitendra Singh Verma "A Framework for Name Search and Spell Check for Social Network Application using Regular Expression & Hashing". International Journal of Computer Trends and Technology (IJCTT) V34(4):174-178, April 2016. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
String matching takes place an important role in the field of information retrieval, spell checking, dictionary and many more. Some of them can be either web based applications or desktop based applications. These different applications can use the concept of two types of string matching techniques one isexact and another is approximate string matching techniques. This paper deals with both the string matching techniques mentioned above. Objective of this paper is to shows the use of string matching techniques in retrieving the relevant information efficiently. Therefore to fulfil this requirement we have proposed a name search framework’ regular expression and hashing based name search’ (REHNS) including the spell check feature. Proposed names search framework will not only give the relevant names while it will also suggest the correct spelling of name, if found incorrect. For getting better results we have applied regular expression, hashing technique and edit method. Proposed system suggests the best similar name for mistyped names as well as gives the names in an alphabetical order in quick time. This is very helpful to people if they are searching the names starting with a particular letter.

References
[1]. Konheim, Alan (2010). Hashing for storage data management". Hashing in Computer Science: Fifty Years of Slicing and Dicing. Wiley Interscience. ISBN 9780470344736.
[2] Zhenglu Yang Jianjun Yu Masaru Kitsuregawa, “Fast Algorithms for Top-k Approximate String Matching”, Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Page No. 1467-1473, 2010.
[3] Gonzalo Navarro Ricardo Baeza-Yates Erkki Sutinen Jorma Tarhio, “Indexing Methods for Approximate String Matching” IEEE Data Engineering Bulletin, volume no. 24, 2000.
[4] Gonjalo Navarro, “A guided tour to approximate string matching”, Dept. of Computer Science, University of Chile Blanco Encalada 2120 Santiago Chile, ACM Computing Surveys (CSUR) Surveys Homepage archive, Volume 33 Issue 1, Page No 31-88, March 2001.
[5] Christian Charras Thierry Lecroq, “Handbook of Exact String- Matching Algorithms”Handbook of Exact String Matching Algorithms, King's College Publications,2004.
[6] Burak YILDIZ, Fatih EMEKCİ. “Name spell check framework for social networks” Turkish Journal of Electrical Engineering & Computer Sciences, Final Version: 201, accepted/published online: 05.07.2014.
[7]Yahoo Webscope dataset Yahoo! N-Grams, ver. 2.0,research.yahoo.com/Academic_Relations.
[8] Jan Goyvaerts, “Regular Expressions the Complete Tutorial”, Lulu.com, 2006, edition 2007.
[9] Ivan Bjerre Damgard,“A design principal for hash functions”, Springer-Verlag, page no. 416-427, 1998.
[10] Youssef Bassil, “Parallel Spell-Checking Algorithm Based on Yahoo! N-Grams Dataset” International Journal of Research and Reviews in Computer Science (IJRRCS), ISSN: 2079-2557, Vol. 3, No. 1, February 2012.

Keywords
string matching, spell correction, name search, social networking.