| /**************************************************************************** |
| ** |
| ** Copyright (C) 2011 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$ |
| ** GNU Lesser General Public License Usage |
| ** 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. |
| ** |
| ** GNU General Public License Usage |
| ** Alternatively, this file may be used under the terms of the GNU General |
| ** Public License version 3.0 as published by the Free Software Foundation |
| ** and appearing in the file LICENSE.GPL included in the packaging of this |
| ** file. Please review the following information to ensure the GNU General |
| ** Public License version 3.0 requirements will be met: |
| ** http://www.gnu.org/copyleft/gpl.html. |
| ** |
| ** Other Usage |
| ** Alternatively, this file may be used in accordance with the terms and |
| ** conditions contained in a signed written agreement between you and Nokia. |
| ** |
| ** |
| ** |
| ** |
| ** |
| ** $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 |