Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,386,852 papers from all fields of science
Search
Sign In
Create Free Account
Most frequent k characters
In information theory, MostFreqKDistance is a string metric technique for quickly estimating how similar two ordered sets or strings are. The scheme…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
40 relations
Approximate string matching
Big data
Bitap algorithm
Damerau–Levenshtein distance
Expand
Broader (1)
Dynamic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A high-performance approach to string similarity using most frequent K characters
André Valdestilhas
,
Tommaso Soru
,
Axel-Cyrille Ngonga Ngomo
OM@ISWC
2017
Corpus ID: 7914196
The amount of available data has been growing significantly over the last decades. Thus, linking entries across heterogeneous…
Expand
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)
ACCEPT & CONTINUE