In-place differential file compression of non-aligned files with applications to file distribution, backups, and string similarity

2004 ◽  
Author(s):  
D. Shapira ◽  
J.A. Storer
Keyword(s):  
String Similarity ◽  
File Distribution

File distribution in networks with multimedia storage servers

Networks ◽  
2001 ◽  
Vol 38 (3) ◽  
pp. 140-149 ◽  
Author(s):  
Jeong-dong Ryoo ◽  
Shivendra S. Panwar
Keyword(s):  
Multimedia Storage ◽  
Storage Servers ◽  
File Distribution

scholarly journals UniMelb at SemEval-2016 Task 3: Identifying Similar Questions by combining a CNN with String Similarity Measures

2016 ◽  
Author(s):  
Timothy Baldwin ◽  
Huizhi Liang ◽  
Bahar Salehi ◽  
Doris Hoogeveen ◽  
Yitong Li ◽  
...  
Keyword(s):  
Similarity Measures ◽  
String Similarity ◽  
String Similarity Measures

QRP03-2: Fast Stochastic Analysis of P2P File Distribution Architectures

2006 ◽  
Author(s):  
Damiano Carra ◽  
Renato Lo Cigno ◽  
Ernst W. Biersack
Keyword(s):  
Stochastic Analysis ◽  
File Distribution

Efficient and Scalable Processing of String Similarity Join

2013 ◽  
Vol 25 (10) ◽  
pp. 2217-2230 ◽  
Author(s):  
Chuitian Rong ◽  
Wei Lu ◽  
Xiaoli Wang ◽  
Xiaoyong Du ◽  
Yueguo Chen ◽  
...  
Keyword(s):  
Similarity Join ◽  
String Similarity

A New LCS-Neutrosophic Similarity Measure for Text Information Retrieval

2020 ◽  
pp. 258-280
Author(s):  
Misturah Adunni Alaran ◽  
AbdulAkeem Adesina Agboola ◽  
Adio Taofiki Akinwale ◽  
Olusegun Folorunso
Keyword(s):  
Information Retrieval ◽  
Similarity Measure ◽  
Information Search ◽  
Longest Common Subsequence ◽  
Data Set ◽  
String Similarity ◽  
True Match ◽  
Neutrosophic Logic ◽  
Common Subsequence ◽  
Text Information

The reality of human existence and their interactions with various things that surround them reveal that the world is imprecise, incomplete, vague, and even sometimes indeterminate. Neutrosophic logic is the only theory that attempts to unify all previous logics in the same global theoretical framework. Extracting data from a similar environment is becoming a problem as the volume of data keeps growing day-in and day-out. This chapter proposes a new neutrosophic string similarity measure based on the longest common subsequence (LCS) to address uncertainty in string information search. This new method has been compared with four other existing classical string similarity measure using wordlist as data set. The analyses show the performance of proposed neutrosophic similarity measure to be better than the existing in information retrieval task as the evaluation is based on precision, recall, highest false match, lowest true match, and separation.

Sign in / Sign up

Export Citation Format

Share Document