simtexth.h

Go to the documentation of this file.

// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
 
#ifndef SIMTEXTH_H
#define SIMTEXTH_H
 
const int textSimilarityThreshold = 190;
 
#include <QString>
#include <QList>
 
QT_BEGIN_NAMESPACE
 
class Translator;
 
struct Candidate
{
    Candidate() {}
    Candidate(const QString &c, const QString &s, const QString &d, const QString &t,
              const QString &i, const QString &l)
        : context(c), source(s), label(l), id(i), disambiguation(d), translation(t)
    {}
 
    QString context;
    QString source;
    QString label;
    QString id;
    QString disambiguation;
    QString translation;
};
 
inline bool operator==( const Candidate& c, const Candidate& d ) {
    return c.translation == d.translation && c.source == d.source && c.context == d.context
           && c.disambiguation == d.disambiguation;
}
inline bool operator!=( const Candidate& c, const Candidate& d ) {
    return !operator==( c, d );
}
 
typedef QList<Candidate> CandidateList;
 
struct CoMatrix
{
    CoMatrix(const QString &str);
    CoMatrix() {}
 
    /*
      The matrix has 20 * 20 = 400 entries.  This requires 50 bytes, or 13
      words.  Some operations are performed on words for more efficiency.
    */
    union {
        quint8 b[52];
        quint32 w[13];
    };
};
 
/**
 * This class is more efficient for searching through a large array of candidate strings, since we only
 * have to construct the CoMatrix for the \a stringToMatch once,
 * after that we just call getSimilarityScore(strCandidate).
 * \sa getSimilarityScore
 */
class StringSimilarityMatcher {
public:
    StringSimilarityMatcher(const QString &stringToMatch);
    int getSimilarityScore(const QString &strCandidate);
 
private:
    CoMatrix m_cm;
    int m_length;
};
 
/**
 * Checks how similar two strings are.
 * The return value is the score, and a higher score is more similar
 * than one with a low score.
 * Linguist considers a score over 190 to be a good match.
 * \sa StringSimilarityMatcher
 */
static inline int getSimilarityScore(const QString &str1, const QString &str2)
{
    return StringSimilarityMatcher(str1).getSimilarityScore(str2);
}
 
CandidateList similarTextHeuristicCandidates( const Translator *tor,
                                              const QString &text,
                                              int maxCandidates );
 
QT_END_NAMESPACE
 
#endif