Skip to search formSkip to main contentSkip to account menu

String metric

Known as: String distance measure, String distance, String similarity function 
In mathematics and computer science, a string metric (also known as a string similarity metric or string distance function) is a metric that measures… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
Ajax (programming)Approximate string matchingComputer scienceDamerau–Levenshtein distance

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Automatic Playlist Continuation using Subprofile-Aware Diversification
The ACM RecSys Challenge 2018 involves the task of automatic playlist continuation (APC), aiming to help users to create and… 
2016
2016
Comparative analysis of string similarity and corpus-based similarity for automatic essay scoring system on e-learning gamification
Essay assessment within e-learning need to be conducted manually by human expert. This process takes time and costly. Hence… 
2014
2014
Solution Algorithm of String Similarity Based on Improved Levenshtein Distance
When calculating the similarity of strings, the Levenshtein Distance(LD) algorithm only considers the operating times and ignores… 
2010
2010
Large-scale semi-supervised learning for natural language processing
Natural Language Processing (NLP) develops computational approaches to processing language data. Supervised machine learning has… 
2010
2010
A Machine Learning Approach to Linking FOAF Instances
The friend of a friend (FOAF) vocabulary is widely used on the Web to describe individual people and their properties. Since FOAF… 
Review
2009
Review
2009
KOSIMap: Ontology Alignments Results for OAEI 2009
Ontology mapping has been recognised as an important approach to identifying similar information in heterogeneous ontologies. The… 
2008
2008
Applications of corpus-based semantic similarity and word segmentation to database schema matching
In this paper, we present a method for database schema matching: the problem of identifying elements of two given schemas that… 
2007
2007
OWL-CM: OWL Combining Matcher based on Belief Functions Theory
In this paper we propose a new tool called OWL-CM (OWL Combining Matcher) that deals with uncertainty inherent to ontology… 
2000
2000
Automatic keyword extraction with relational clustering and Levenshtein distances
Alternating cluster estimation (ACE) is a generalized clustering model. Relational ACE is a modification of ACE that can be used… 
1985
1985
Syntactic pattern recognition for the recognition of bright spots
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)