1 /****************************************************************************

     2 **

     3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).

     4 ** All rights reserved.

     5 ** Contact: Nokia Corporation (qt-info@nokia.com)

     6 **

     7 ** This file is part of the Qt Linguist of the Qt Toolkit.

     8 **

     9 ** $QT_BEGIN_LICENSE:LGPL$

    10 ** No Commercial Usage

    11 ** This file contains pre-release code and may not be distributed.

    12 ** You may use this file in accordance with the terms and conditions

    13 ** contained in the Technology Preview License Agreement accompanying

    14 ** this package.

    15 **

    16 ** GNU Lesser General Public License Usage

    17 ** Alternatively, this file may be used under the terms of the GNU Lesser

    18 ** General Public License version 2.1 as published by the Free Software

    19 ** Foundation and appearing in the file LICENSE.LGPL included in the

    20 ** packaging of this file.  Please review the following information to

    21 ** ensure the GNU Lesser General Public License version 2.1 requirements

    22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.

    23 **

    24 ** In addition, as a special exception, Nokia gives you certain additional

    25 ** rights.  These rights are described in the Nokia Qt LGPL Exception

    26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.

    27 **

    28 ** If you have questions regarding the use of this file, please contact

    29 ** Nokia at qt-info@nokia.com.

    30 **

    31 **

    32 **

    33 **

    34 **

    35 **

    36 **

    37 **

    38 ** $QT_END_LICENSE$

    39 **

    40 ****************************************************************************/

    41 

    42 #ifndef SIMTEXTH_H

    43 #define SIMTEXTH_H

    44 

    45 const int textSimilarityThreshold = 190;

    46 

    47 #include <QString>

    48 #include <QList>

    49 

    50 QT_BEGIN_NAMESPACE

    51 

    52 class Translator;

    53 

    54 struct Candidate

    55 {

    56     Candidate() {}

    57     Candidate(const QString& source0, const QString &target0)

    58 	: source(source0), target(target0)

    59     {}

    60 

    61     QString source;

    62     QString target;

    63 };

    64 

    65 inline bool operator==( const Candidate& c, const Candidate& d ) {

    66     return c.target == d.target && c.source == d.source;

    67 }

    68 inline bool operator!=( const Candidate& c, const Candidate& d ) {

    69     return !operator==( c, d );

    70 }

    71 

    72 typedef QList<Candidate> CandidateList;

    73 

    74 struct CoMatrix;

    75 /**

    76  * This class is more efficient for searching through a large array of candidate strings, since we only

    77  * have to construct the CoMatrix for the \a stringToMatch once,

    78  * after that we just call getSimilarityScore(strCandidate).

    79  * \sa getSimilarityScore

    80  */

    81 class StringSimilarityMatcher {

    82 public:

    83     StringSimilarityMatcher(const QString &stringToMatch);

    84     ~StringSimilarityMatcher();

    85     int getSimilarityScore(const QString &strCandidate);

    86 

    87 private:

    88     CoMatrix *m_cm;

    89     int m_length;

    90 };

    91 

    92 int getSimilarityScore(const QString &str1, const QString &str2);

    93 

    94 CandidateList similarTextHeuristicCandidates( const Translator *tor,

    95 					      const QString &text,

    96 					      int maxCandidates );

    97 

    98 QT_END_NAMESPACE

    99 

   100 #endif