Online Tool

Q-gram (n-gram) Similarity Algorithm

Submit two text strings to see how they match with the Q-gram (n-gram) similarity algorithm. No registration. No logging.


What Is The 

Q-gram (n-gram) Similarity Algorithm

The Q-gram (n-gram) similarity algorithm is a string-matching algorithm that is used to compare two strings and determine their similarity. It does this by dividing each string into substrings of length Q (where Q is a positive integer), and then comparing the substrings to determine how many of them are the same in both strings. The result is a measure of the similarity of the two strings, with a higher value indicating a greater degree of similarity. The Q-gram algorithm is often used in natural language processing and other fields where the comparison of strings is important. It is a fast and efficient algorithm that can be used to quickly compare large amounts of text data.

At Tilores we use the Q-gram (also known as n-gram) algorithm as one of the potential data record matching algorithms for entity resolution. These can be combined with other matching algorithms to allow fine-tuned data matching and deduplication. 

More reading about the Q-gram (n-gram) (Wikipedia) 


Fuzzy Matching Algorithm Tools

Unlock the value trapped in your messy, inconsistent and duplicate-riddled data. Let Tilores be your data "source of truth". 

Compare all

Compare Fuzzy Matching Algorithms

Other Fuzzy Matching Algorithm Tools

Are we missing a fuzzy matching algorithm you would like to test?



When you need to do fuzzy matching on high-volume data in real-time, you need a built-for-purpose technology: enter Tilores.

Consistently fast search response times

Built for unlimited serverless scaling

Real-time data ingestion and simultaneous search.

Configure matching rules easily in the UI

Data privacy compliant by design

Identity resolution for fraud prevention, KYC and marketing.

Get the latest updates

©2023 Tilores, All right reserved.