MorphDict.h

Go to the documentation of this file.

//
//  This file is part of DDC.
// 
//  DDC is free software: you can redistribute it and/or modify
//  it under the terms of the GNU Lesser General Public License as published by
//  the Free Software Foundation, either version 3 of the License, or
//  (at your option) any later version.
// 
//  DDC is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU Lesser General Public License for more details.
// 
//  You should have received a copy of the GNU Lesser General Public License
//  along with DDC.  If not, see <http://www.gnu.org/licenses/>.
//
// ==========  Dialing Lemmatizer (www.aot.ru)
// ==========  Copyright by Alexey Sokirko, Bryan Jurish (2011)

#ifndef AhoKorasickMorph_h
#define AhoKorasickMorph_h


#include "MorphAutomat.h"
#include "../MorphWizardLib/FormInfo.h"



struct CLemmaInfoAndLemma 
{
    int                     m_LemmaStrNo;
    CLemmaInfo      m_LemmaInfo;

    bool operator < (const CLemmaInfoAndLemma& X) const 
    {
        if (m_LemmaInfo.m_FlexiaModelNo != X.m_LemmaInfo.m_FlexiaModelNo)
            return m_LemmaInfo.m_FlexiaModelNo < X.m_LemmaInfo.m_FlexiaModelNo;

        return m_LemmaStrNo < X.m_LemmaStrNo;
    };

};




class CMorphDict   
{
        
protected:
        
    CMorphAutomat*                          m_pFormAutomat;

    vector<int>                                     m_ModelsIndex;
        
        

    struct IsLessMorphInterp 
    {
        const CShortStringHolder& m_SearchInfos;

        IsLessMorphInterp(const CShortStringHolder& SearchInfos) : m_SearchInfos(SearchInfos) {};

        bool    operator () (const CLemmaInfoAndLemma& _X1, const char* _X2) const
        {
            const char* base1 = m_SearchInfos[_X1.m_LemmaStrNo].GetString();

            return strcmp(base1, _X2) < 0;
        };
        bool    operator () (const char* _X1, const CLemmaInfoAndLemma& _X2) const
        {
            const char* base2 = m_SearchInfos[_X2.m_LemmaStrNo].GetString();

            return strcmp(_X1, base2) < 0;
        };
        bool    operator () (const CLemmaInfoAndLemma& _X1, const CLemmaInfoAndLemma& _X2) const
        {
            const char* base1 = m_SearchInfos[_X1.m_LemmaStrNo].GetString();
            const char* base2 = m_SearchInfos[_X2.m_LemmaStrNo].GetString();

            return strcmp(base1, base2) < 0;
        };


    };
    IsLessMorphInterp m_SearchInfoLess;
    void    GetLemmaInfos (const string& Text, size_t TextPos, vector<CAutomAnnotationInner>& Infos) const;
    void    CreateModelsIndex();

public:
    vector<CFlexiaModel>            m_FlexiaModels;
    vector<CAccentModel>            m_AccentModels;
    CShortStringHolder                      m_Bases;
    vector<CLemmaInfoAndLemma>      m_LemmaInfos;
    StringVector                            m_Prefixes;
    vector<BYTE>                            m_NPSs;

    CMorphDict(MorphLanguageEnum Language);
    virtual ~CMorphDict();
    void    InitAutomat(CMorphAutomat*      pFormAutomat);

    //  loading & saving
    bool    Load(string GrammarFileName);
    bool    Save(string GrammarFileName) const;
        
        
    void    PredictBySuffix (const string& Text, size_t& TextOffset, size_t MinimalPredictSuffixlen, vector<CAutomAnnotationInner>& Infos) const;
    string  GetAllMorphInterpsStr (const string& Text,const size_t TextPos, bool bFullInterp) const;
};



#endif

/*--- emacs style variables ---
 * Local Variables:
 *  mode: C++
 *  c-file-style: "ellemtel"
 *  c-basic-offset: 4
 *  tab-width: 8
 *  indent-tabs-mode: nil
 * End:
 */