dependencies.h

Go to the documentation of this file.

//
//    FreeLing - Open Source Language Analyzers
//
//    Copyright (C) 2004   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 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
//    General Public License for more details.
//
//    You should have received a copy of the GNU 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 _DEP_TXALA
#define _DEP_TXALA

#include <string>
#include <map>
#include <set>
#include <vector>

#include "freeling/windll.h"
#include "freeling/morfo/language.h"
#include "freeling/morfo/processor.h"
#include "freeling/morfo/semdb.h"
#include "freeling/morfo/dep_rules.h"
#include "freeling/morfo/dependency_parser.h"



class completer {
 private:
  std::map<std::pair<std::wstring,std::wstring>,std::list<completerRule> > chgram;
  std::set<std::wstring> active_flags;
  completerRule find_grammar_rule(const std::vector<parse_tree *> &, const size_t);
  parse_tree * applyRule(const completerRule &, parse_tree *, parse_tree *);
  bool matching_condition(parse_tree::iterator, const std::list<std::wstring> &, boost::u32regex &) const;
  bool matching_context(const std::vector<parse_tree *> &, const size_t, const completerRule &) const;
  bool matching_operation(const std::vector<parse_tree *> &, const size_t, completerRule &) const;
  bool match_side(const int, const std::vector<parse_tree *> &, const size_t, const std::vector<std::wstring> &, const size_t) const;
  void extract_conds(std::wstring &, std::list<std::wstring> &, boost::u32regex &) const;
  bool match_pattern(parse_tree::iterator, const std::wstring &) const;
  bool enabled_rule(const completerRule &) const;

 public:  
  completer(const std::wstring &);
  parse_tree complete(parse_tree &, const std::wstring &);

};



class depLabeler {

 private:
  // set of rules
  std::map<std::wstring, std::list<ruleLabeler> > rules;
  // "unique" labels
  std::set<std::wstring> unique;
  // semantic database to check for semantic conditions in rules
  semanticDB * semdb;
  // parse a condition and create checkers.
  rule_expression* build_expression(const std::wstring &);

 public:
  depLabeler(const std::wstring &);
  ~depLabeler();
  void label(dep_tree*);
  void label(dep_tree*, dep_tree::iterator);
};




class WINDLL dep_txala : public dependency_parser {

 private:
  completer comp; 
  depLabeler labeler;
  // Root symbol used by the chunk parser when the tree is not complete.
  std::wstring start;
  dep_tree* dependencies(parse_tree::iterator, parse_tree::iterator);

 public:   
  dep_txala(const std::wstring &, const std::wstring &);

  void analyze(sentence &);
  void analyze(std::list<sentence> &);
  sentence analyze(const sentence &);
  std::list<sentence> analyze(const std::list<sentence> &);
};

#endif