1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the Qt Linguist of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#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& source0, const QString &target0)
: source(source0), target(target0)
{}
QString source;
QString target;
};
inline bool operator==( const Candidate& c, const Candidate& d ) {
return c.target == d.target && c.source == d.source;
}
inline bool operator!=( const Candidate& c, const Candidate& d ) {
return !operator==( c, d );
}
typedef QList<Candidate> CandidateList;
struct CoMatrix;
/**
* 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);
~StringSimilarityMatcher();
int getSimilarityScore(const QString &strCandidate);
private:
CoMatrix *m_cm;
int m_length;
};
int getSimilarityScore(const QString &str1, const QString &str2);
CandidateList similarTextHeuristicCandidates( const Translator *tor,
const QString &text,
int maxCandidates );
QT_END_NAMESPACE
#endif
|
