FreeLing
3.1
|
00001 00002 // 00003 // FreeLing - Open Source Language Analyzers 00004 // 00005 // Copyright (C) 2004 TALP Research Center 00006 // Universitat Politecnica de Catalunya 00007 // 00008 // This library is free software; you can redistribute it and/or 00009 // modify it under the terms of the GNU General Public 00010 // License as published by the Free Software Foundation; either 00011 // version 3 of the License, or (at your option) any later version. 00012 // 00013 // This library is distributed in the hope that it will be useful, 00014 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00015 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00016 // General Public License for more details. 00017 // 00018 // You should have received a copy of the GNU General Public 00019 // License along with this library; if not, write to the Free Software 00020 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 00021 // 00022 // contact: Lluis Padro (padro@lsi.upc.es) 00023 // TALP Research Center 00024 // despatx C6.212 - Campus Nord UPC 00025 // 08034 Barcelona. SPAIN 00026 // 00028 00029 #ifndef _DICTIONARY 00030 #define _DICTIONARY 00031 00032 #include <map> 00033 00034 #include "freeling/windll.h" 00035 #include "freeling/morfo/language.h" 00036 #include "freeling/morfo/processor.h" 00037 #include "freeling/morfo/database.h" 00038 #include "freeling/morfo/suffixes.h" 00039 00040 namespace freeling { 00041 00048 00049 class WINDLL dictionary : public processor { 00050 00051 private: 00053 bool AffixAnalysis; 00054 bool InverseDict; 00055 bool RetokenizeContractions; 00056 00058 affixes* suf; 00059 00061 database* morfodb; 00062 database* inverdb; 00063 00064 // list of default preferences of lemma/pos in case the tagger leaves residual ambiguity 00065 std::map<std::wstring,std::wstring> lemma_prefs; 00066 std::map<std::wstring,std::wstring> pos_prefs; 00067 00070 bool check_contracted(const std::wstring &, std::wstring, 00071 std::wstring, std::list<word> &) const; 00072 00074 std::list<std::wstring> tag_combinations(std::list<std::wstring>::const_iterator, std::list<std::wstring>::const_iterator) 00075 const; 00077 bool parse_dict_entry(const std::wstring &, std::list<std::pair<std::wstring,std::list<std::wstring> > >&) const; 00079 std::wstring compact_data(const std::list<std::pair<std::wstring,std::list<std::wstring> > > &) const; 00080 00082 bool less(const std::wstring &, const std::wstring &, const std::map<std::wstring,std::wstring> &) const; 00084 void sort_list(std::list<std::wstring> &, const std::map<std::wstring,std::wstring> &) const; 00085 00086 public: 00088 dictionary(const std::wstring &, const std::wstring &, bool, const std::wstring &, bool invDic=false, bool retok=true); 00090 ~dictionary(); 00091 00093 void add_analysis(const std::wstring &, const analysis &); 00095 void remove_entry(const std::wstring &); 00096 00098 void search_form(const std::wstring &, std::list<analysis> &) const; 00102 bool annotate_word(word &, std::list<word> &, bool override=false) const; 00106 void annotate_word(word &) const; 00108 std::list<std::wstring> get_forms(const std::wstring &, const std::wstring &) const; 00109 00111 void analyze(sentence &) const; 00112 00114 using processor::analyze; 00115 }; 00116 00117 } // namespace 00118 00119 #endif