dictionary.h

Go to the documentation of this file.

//
//    FreeLing - Open Source Language Analyzers
//
//    Copyright (C) 2014   TALP Research Center
//                         Universitat Politecnica de Catalunya
//
//    This library is free software; you can redistribute it and/or
//    modify it under the terms of the GNU Affero General Public
//    License as published by the Free Software Foundation; either
//    version 3 of the License, or (at your option) any later version.
//
//    This library 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
//    Affero General Public License for more details.
//
//    You should have received a copy of the GNU Affero General Public
//    License along with this library; if not, write to the Free Software
//    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
//    contact: Lluis Padro (padro@lsi.upc.es)
//             TALP Research Center
//             despatx C6.212 - Campus Nord UPC
//             08034 Barcelona.  SPAIN
//

#ifndef _DICTIONARY
#define _DICTIONARY

#include <map>

#include "freeling/windll.h"
#include "freeling/morfo/language.h"
#include "freeling/morfo/processor.h"
#include "freeling/morfo/database.h"
#include "freeling/morfo/suffixes.h"
#ifndef NO_LIBFOMA
  #include "freeling/morfo/compounds.h"
#endif

namespace freeling {


  class WINDLL dictionary : public processor {

  private:
    bool InverseDict;

    bool RetokenizeContractions;
    bool AffixAnalysis;
    bool CompoundAnalysis;

    affixes *suf;

    #ifndef NO_LIBFOMA

      compounds *comp;
    #endif

    database *morfodb;
    database *inverdb;

    bool check_contracted(const std::wstring &, std::wstring, 
                          std::wstring, std::list<word> &) const;

    std::list<std::wstring> tag_combinations(std::list<std::wstring>::const_iterator, std::list<std::wstring>::const_iterator)
      const;
    bool parse_dict_entry(const std::wstring &, std::list<std::pair<std::wstring,std::list<std::wstring> > >&) const;
    std::wstring compact_data(const std::list<std::pair<std::wstring,std::list<std::wstring> > > &) const;

  public:
    dictionary(const std::wstring &Lang, const std::wstring &dicFile, 
               const std::wstring &sufFile, const std::wstring &compFile,
               bool invDic=false, bool retok=true);
    ~dictionary();

    void add_analysis(const std::wstring &, const analysis &);
    void remove_entry(const std::wstring &);

    void set_retokenize_contractions(bool); 
    void set_affix_analysis(bool);
    void set_compound_analysis(bool);

    bool has_affixes() const;
    bool has_compounds() const;
    
    void search_form(const std::wstring &, std::list<analysis> &) const;
    bool annotate_word(word &, std::list<word> &, bool override=false) const;
    void annotate_word(word &) const;
    std::list<std::wstring> get_forms(const std::wstring &, const std::wstring &) const;

    void dump_dictionary(std::wostream &, bool keysonly=false) const;

    void analyze(sentence &) const;

    using processor::analyze;
  };

} // namespace

#endif