lexical_chain.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 _LEXCHAIN
#define _LEXCHAIN

#include "freeling/morfo/relation.h"
#include "freeling/morfo/language.h"

namespace freeling {


  class lexical_chain {
  public:

    lexical_chain(relation *r, const freeling::word &w, const freeling::sentence &s,
                  int n_paragraph, int n_sentence, int position);

    ~lexical_chain();

    bool compute_word(const freeling::word &w, const freeling::sentence &s, const freeling::document &doc,
                      int n_paragraph, int n_sentence, int position);

    double get_score();

    int get_number_of_words() const;

    const std::list<word_pos> &get_words() const;

    std::list<word_pos> get_ordered_words() const;

    std::wstring toString();

  private:
    double score;
    std::unordered_map<std::wstring, std::pair<int, word_pos*> > unique_words;
    std::list<word_pos> words;
    relation * rel;
    std::list<related_words> relations;
  };

} // namespace

#endif