sp.cpp

#include "logger.h"
#include "sp.h"
#include "hi_constants.h"
#include <iterator>
#include <algorithm>
#include <functional>
#include "lexer.h"
#include <numeric>

/*PUBLIC*/
interpreter::interpreter(const unsigned char toa,const std::string& timestamp,const preprocessor *pp){
	nr_of_nodes_=0;
	toa_=toa;
	timestamp_=timestamp;
	pp_=pp;
	db *sqlite=NULL;
	sqlite=db_factory::get_instance();
	query_result *query_result=NULL;
	query_result=sqlite->exec_sql("SELECT * FROM SETTINGS WHERE KEY = 'ref_symbol';");
	if(query_result!=NULL){
		ref_symbol=*query_result->field_value_at_row_position(0,"value");
		delete query_result;
	}
	query_result=sqlite->exec_sql("SELECT * FROM SETTINGS WHERE KEY = 'ref_stem';");
	if(query_result!=NULL){
		ref_stem=*query_result->field_value_at_row_position(0,"value");
		delete query_result;
	}
	query_result=sqlite->exec_sql("SELECT * FROM SETTINGS WHERE KEY = 'ref_tag';");
	if(query_result!=NULL){
		ref_tag=*query_result->field_value_at_row_position(0,"value");
		delete query_result;
	}
}

interpreter::~interpreter(){
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"destructing interpreter");
	destroy_node_infos();
}

int interpreter::set_node_info(const std::string& symbol, const lexicon& word){
	node_info nodeinfo;
	db *sqlite=NULL;
	unsigned int rule_step_failed=0;

	nodeinfo.node_id=++nr_of_nodes_;
	nodeinfo.symbol=symbol;
	if(word.lexeme.empty()==false){
		if(word.gcat.empty()==true){
			throw std::runtime_error("No way that I set an empty gcat for a node.");
		}
		nodeinfo.expression=word;
	}
	nodeinfo.left_child=0;
	nodeinfo.right_child=0;
	if(nodeinfo.expression.morphalytics!=NULL) nodeinfo.expression.morphalytics->set_node_id(nodeinfo.node_id);
	node_infos.push_back(nodeinfo);
	return nodeinfo.node_id;
}

int interpreter::set_node_info(const std::string& symbol, const node_info& node){
	lexicon word;
	node_info nodeinfo;
	db *sqlite=NULL;
	unsigned int rule_step_failed=0;

	word.gcat=symbol;
	nodeinfo.node_id=++nr_of_nodes_;
	if(word.gcat.empty()==true){
		throw std::runtime_error("No way that I set an empty gcat for a node.");
	}
	nodeinfo.symbol=symbol;
	if(word.lexeme.empty()==false) nodeinfo.expression=word;
	nodeinfo.left_child=0;
	nodeinfo.right_child=node.node_id;
	if(nodeinfo.expression.morphalytics!=NULL) nodeinfo.expression.morphalytics->set_node_id(nodeinfo.node_id);
	node_infos.push_back(nodeinfo);
	if(nodeinfo.right_child!=0){//This means that no checks can be set up for nonterminal->terminal symbol rules
		rule_step_failed=check_prerequisite_symbols(nodeinfo,get_node_info(nodeinfo.right_child));
		if(rule_step_failed!=0){
			throw missing_prerequisite_symbol(nodeinfo.symbol,get_node_info(nodeinfo.right_child).symbol);
		}
	}
	return nodeinfo.node_id;
}

int interpreter::set_node_info_left(const std::string& symbol, const node_info& node){
	lexicon word;
	node_info nodeinfo;
	db *sqlite=NULL;
	unsigned int rule_step_failed=0;

	word.gcat=symbol;
	nodeinfo.node_id=++nr_of_nodes_;
	if(word.gcat.empty()==true){
		throw std::runtime_error("No way that I set an empty gcat for a node.");
	}
	nodeinfo.symbol=symbol;
	if(word.lexeme.empty()==false) nodeinfo.expression=word;
	nodeinfo.left_child=node.node_id;
	nodeinfo.right_child=0;
	if(nodeinfo.expression.morphalytics!=NULL) nodeinfo.expression.morphalytics->set_node_id(nodeinfo.node_id);
	node_infos.push_back(nodeinfo);
	if(nodeinfo.right_child!=0){//This means that no checks can be set up for nonterminal->terminal symbol rules
		rule_step_failed=check_prerequisite_symbols(nodeinfo,get_node_info(nodeinfo.right_child));
		if(rule_step_failed!=0){
			throw missing_prerequisite_symbol(nodeinfo.symbol,get_node_info(nodeinfo.right_child).symbol);
		}
	}
	return nodeinfo.node_id;
}

unsigned int interpreter::check_prerequisite_symbols(const node_info& parent_node, const node_info& child_node){
	bool valid_combination=false;
	db *sqlite=NULL;
	query_result *rule_to_rule_map=NULL;
	std::vector<unsigned int> main_nodes_found_by_symbol,main_subtree_nodes_found_by_symbol;
	const std::pair<const unsigned int,field> *rule_entry=NULL,*rule_entry_failure_copy=NULL;
	unsigned int current_step=0,successor=0,failover=0,rule_step_failed=0;
	std::map<unsigned int,bool> empty_ref_node_id_parents;

	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking prerequisite symbols for parent symbol:"+parent_node.symbol+", child symbol:"+child_node.symbol);
	sqlite=db_factory::get_instance();
	rule_to_rule_map=sqlite->exec_sql("SELECT * FROM RULE_TO_RULE_MAP WHERE PARENT_SYMBOL = '"+parent_node.symbol+"' AND HEAD_ROOT_SYMBOL = '"+child_node.symbol+"' AND (NON_HEAD_ROOT_SYMBOL = '' OR NON_HEAD_ROOT_SYMBOL IS NULL) ORDER BY STEP;");
	if(rule_to_rule_map!=NULL){
		rule_entry=rule_to_rule_map->first_value_for_field_name_found("step","1");
		while(rule_entry!=NULL){
			rule_entry_failure_copy=rule_entry;
			current_step=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"step")->c_str());
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"step:"+std::to_string(current_step));
			failover=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"failover")->c_str());
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"failover:"+std::to_string(failover));
			successor=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"successor")->c_str());
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"successor:"+std::to_string(successor));
			main_nodes_found_by_symbol.clear();
			main_subtree_nodes_found_by_symbol.clear();
			if(*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"parent_symbol")==parent_node.symbol
				&&*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"head_root_symbol")==child_node.symbol){
				if(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_symbol")->empty()==false){
					if(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_lookup_subtree_symbol")->empty()==true)
						get_nodes_by_symbol(child_node,*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_symbol"),*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_lexeme"),empty_ref_node_id_parents,main_nodes_found_by_symbol);
					else{
						get_nodes_by_symbol(child_node,*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_lookup_subtree_symbol"),std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
						for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
							get_nodes_by_symbol(get_node_info(main_subtree_node),*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_symbol"),*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_lexeme"),empty_ref_node_id_parents,main_nodes_found_by_symbol);
						}
					}
				}
				else{
					throw std::runtime_error("Main node symbol is empty for parent symbol "+parent_node.symbol+", head root symbol "+child_node.symbol+" and empty or NULL non-head root symbol in RULE_TO_RULE_MAP db table.");
				}
				if(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_symbol")->empty()==false
						&&main_nodes_found_by_symbol.empty()==false){
						if(successor==0||successor<current_step){
							valid_combination=false;
							break;
						}
						else if(successor==current_step){
							valid_combination=true;
							break;
						}
						else{
							valid_combination=true;
						}
				}
				else if(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_symbol")->empty()==false
						&&main_nodes_found_by_symbol.empty()==true){
						if(failover==0||failover<current_step){
							valid_combination=false;
							break;
						}
						else if(failover==current_step){
							valid_combination=true;
							break;
						}
						else{
							valid_combination=false;
						}
				}
				else{
					throw std::runtime_error("Main node symbol is empty for parent symbol "+parent_node.symbol+", head root symbol "+child_node.symbol+" and empty or NULL non-head root symbol in RULE_TO_RULE_MAP db table.");
				}
				if(valid_combination==true){
					if(successor>current_step){
						rule_entry=rule_to_rule_map->value_for_field_name_found_after_row_position(rule_entry->first,"step",*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"successor"));
					}
					else if(successor!=0&&successor<=current_step){
						throw std::runtime_error("You have a successor branch loop for parent symbol "+parent_node.symbol+", head root symbol "+child_node.symbol+" and empty/NULL non-head root symbol at step "+std::to_string(current_step)+". Sorry, no loops are allowed in the rule to rule map.");
					}
					else{
						rule_entry=NULL;
					}
				}
				else{
					if(failover>current_step){
						rule_entry=rule_to_rule_map->value_for_field_name_found_after_row_position(rule_entry->first,"step",*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"failover"));
					}
					else if(failover!=0&&failover<current_step){
						throw std::runtime_error("You have a failover branch loop for parent symbol "+parent_node.symbol+", head root symbol "+child_node.symbol+" and empty/NULL non-head root symbol at step "+std::to_string(current_step)+". Sorry, no loops are allowed in the rule to rule map.");
					}
					else{
						rule_entry=NULL;
						if(failover==current_step&&rule_to_rule_map->nr_of_result_rows()==current_step) valid_combination=true;
					}
				}
			}
			else{
				throw std::runtime_error("No entry found for parent symbol "+parent_node.symbol+", head root symbol "+child_node.symbol+" and empty or NULL non-head root symbol in RULE_TO_RULE_MAP db table.");
			}
		}
		if(valid_combination==true){
			rule_step_failed=0;
		}
		else{
			rule_step_failed=std::atoi(rule_entry_failure_copy->second.field_value.c_str());
		}
		delete rule_to_rule_map;
	}
	return rule_step_failed;
}

const node_info& interpreter::get_node_info(unsigned int node_id){
	//TODO: consider returning a copy instead of reference even though it's a performance penalty
	//but references become invalid if the node_infos vector grows and gets reallocated
	if(node_id>0) return node_infos.at(node_id-1);//Make use of out_of_range exception
}

node_info& interpreter::get_private_node_info(unsigned int node_id){
	if(node_id>0) return node_infos.at(node_id-1);//Make use of out_of_range exception
}

int interpreter::combine_nodes(const std::string& symbol, const node_info& left_node, const node_info& right_node){
	node_info nodeinfo, new_phrase_head_root, new_phrase_non_head_root;
	db *sqlite=NULL;
	query_result *functors=NULL, *rule_to_rule_map=NULL,*main_symbol_entry=NULL,*main_symbol_root_entry=NULL,*dependent_symbol_entry=NULL,*dependent_symbol_root_entry=NULL;
	unsigned int rule_step_failed=0;
	const std::pair<const unsigned int,field> *rule_entry=NULL;
	std::vector<unsigned int> head_leafs, non_head_leafs;
	std::string head_leaf_words, non_head_leaf_words;

	nodeinfo.node_id=0;
	//TODO: Head first - head last determination
	if(true){//If language is head first
		new_phrase_head_root=left_node;
		new_phrase_non_head_root=right_node;
	}
	else if(false){//If language is head last
		new_phrase_head_root=right_node;
		new_phrase_non_head_root=left_node;
	}
	else ;//TODO: What if none of them -like a programming language?
	if(new_phrase_head_root.node_id!=0&&new_phrase_non_head_root.node_id!=0){
		/*TODO:valamit kezdeni kell azzal ha a left_node->symbol='QPro' ill. ha az object_node-nak van gyereke*/
		if(toa_&HI_SEMANTICS){
			sqlite=db_factory::get_instance();
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"Looking for symbols for parent:"+symbol+", head root:"+new_phrase_head_root.symbol+", non-head root:"+new_phrase_non_head_root.symbol);
			rule_to_rule_map=sqlite->exec_sql("SELECT * FROM RULE_TO_RULE_MAP WHERE PARENT_SYMBOL = '"+symbol+"' AND HEAD_ROOT_SYMBOL = '"+new_phrase_head_root.symbol+"' AND NON_HEAD_ROOT_SYMBOL = '"+new_phrase_non_head_root.symbol+"';");
			if(rule_to_rule_map!=NULL){
			/* TODO: Instead of the current validation, the head node needs to be validated against
			* all child nodes of the right_node having a non-empty expression. This would ensure that
			* all constituents are checked against each other and not only the new head of the phrase and
			* the object of the phrase. E.g. 'list big small files!' is contradictory but now only
			* big<->files, small<->files and list<->files are validated and not small<->files, big<->small,
			* big<->files, list<->files.*/
				rule_step_failed=is_valid_combination(symbol,new_phrase_head_root,new_phrase_non_head_root);
				if(rule_step_failed!=0){
					//TODO:depending of head first or head last left-to-right (lr) or right-to-left (rl) method needs to be called to collect leafs
					get_leafs_of_node_lr(new_phrase_head_root,head_leafs);
					get_leafs_of_node_lr(new_phrase_non_head_root,non_head_leafs);
					for(auto&& i:head_leafs){
						if(get_node_info(i).expression.morphalytics!=NULL&&get_node_info(i).expression.morphalytics->is_mocked()==false&&get_node_info(i).expression.word.empty()==false)
							head_leaf_words+=get_node_info(i).expression.morphalytics->word()+" ";
					}
					if(head_leaf_words.empty()==false) head_leaf_words.pop_back();
					for(auto&& i:non_head_leafs){
						if(get_node_info(i).expression.morphalytics!=NULL&&get_node_info(i).expression.morphalytics->is_mocked()==false&&get_node_info(i).expression.word.empty()==false)
							non_head_leaf_words+=get_node_info(i).expression.morphalytics->word()+" ";
					}
					if(non_head_leaf_words.empty()==false) non_head_leaf_words.pop_back();
					throw invalid_combination(head_leaf_words,non_head_leaf_words);
				}
				delete rule_to_rule_map;
			}
		}
		nodeinfo.symbol=symbol;
		nodeinfo.node_id=++nr_of_nodes_;
		//TODO: Head first - head last determination
		if(true){//If language is head first
			nodeinfo.left_child=new_phrase_head_root.node_id;
			nodeinfo.right_child=new_phrase_non_head_root.node_id;
		}
		else if(false){//If language is head last
			nodeinfo.left_child=new_phrase_non_head_root.node_id;
			nodeinfo.right_child=new_phrase_head_root.node_id;
		}
		else ;//TODO: What if none of them -like a programming language?
		node_infos.push_back(nodeinfo);
		validated_nodes.push_back(nodeinfo.node_id);
	}
	return nodeinfo.node_id;
}

std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> >* interpreter::is_valid_expression(node_info& main_node, node_info& dependent_node){
	std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> > *functors=NULL;

	if(main_node.expression.lexeme.empty()==false){//testing for leaves being leaves indeed
		if(dependent_node.node_id!=0){
			functors=functors_found_for_dependencies(dependent_node,main_node);
			if(functors!=NULL){
				if(functors->count(functors->begin()->first)==functors->size()){//check if one or more than one functor was found
					if(main_node.expression.lexicon_entry==true&&functors->begin()->first.first!=main_node.expression.lexeme){
						throw std::runtime_error("Functor "+functors->begin()->first.first+" and main node lexeme "+main_node.expression.lexeme+" don't match.");
					}
				}
				else if(functors->count(functors->begin()->first)<functors->size()){//More than one functor is acceptable as an intermediate result
				}
				else{
					throw std::runtime_error("More functors found for "+functors->begin()->first.first+" with key "+functors->begin()->first.second+" than the number of functors found altogether.");
				}
			}
		}
	}
	return functors;
}

std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> >* interpreter::functors_found_for_dependencies(const node_info& dependent_node, node_info& main_node){
	std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> > *functors_found=NULL;
	std::set<std::tuple<std::string,std::string,unsigned int,std::string> > functors_deps_found_unique;
	std::string d_key_list,functor;
	query_result *functors=NULL;
	std::vector<std::pair<unsigned int,std::string> > dependency_stack;
	db *sqlite=NULL;
	field field;

	if(main_node.expression.lexicon_entry==true){
		functor=main_node.expression.lexeme;
	}
	else{
		functor=main_node.expression.gcat;
	}
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"functor to be found for dependency "+dependent_node.expression.lexeme+":"+functor);
	functors_found=new std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> >();
	if(dependent_node.expression.gcat=="CON"){
		find_functors_for_dependency("CON","",main_node.expression.dependencies,*functors_found,dependency_stack);
	}
	else if(dependent_node.expression.lexicon_entry==false){
		find_functors_for_dependency(dependent_node.expression.gcat,"",main_node.expression.dependencies,*functors_found,dependency_stack);
	}
	else{
		find_functors_for_dependency(dependent_node.expression.lexeme,"",main_node.expression.dependencies,*functors_found,dependency_stack);
	}
	if(functors_found->empty()==true){
		return NULL;
	}
	//generate d_key_list string which lists the d_keys of functors_found like: ('1', '2', ..., '3')
	d_key_list="(";
	for(std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> >::const_iterator j=functors_found->begin();
			j!=functors_found->end();++j){
		if(j->first.first==functor&&d_key_list.find("'"+j->first.second+"'")==std::string::npos){
			d_key_list+="'"+j->first.second+"',";
		}
	}
	if(d_key_list.back()==',') d_key_list.resize(d_key_list.length()-1);//remove last ','
	d_key_list+=")";
	sqlite=db_factory::get_instance();
	functors=sqlite->exec_sql("SELECT * FROM FUNCTORS WHERE FUNCTOR = '"+functor+"' AND D_KEY IN "+d_key_list+";");
	if(functors==NULL){
		throw std::runtime_error("Functor "+functor+" not found in FUNCTOR db table.");
	}
	delete functors;
	for(auto i=functors_found->begin();i!=functors_found->end();){
		if(i->first.first==functor&&functors_deps_found_unique.find(std::make_tuple(i->first.first,i->first.second,i->second.first,i->second.second))==functors_deps_found_unique.end()){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dependency "+i->second.second+" with node id "+std::to_string(dependent_node.node_id)
			+" and depolex row id "+std::to_string(i->second.first)
			+" for functor "+i->first.first+" with d_key "+i->first.second
			+" with node id "+std::to_string(main_node.node_id)+" found");
			functors_deps_found_unique.insert(std::make_tuple(i->first.first,i->first.second,i->second.first,i->second.second));
			++i;
		}
		else{
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dependency "+i->second.second+" with node id "+std::to_string(dependent_node.node_id)
			+" and depolex row id "+std::to_string(i->second.first)
			+" for functor "+i->first.first+" with d_key "+i->first.second
			+" with node id "+std::to_string(main_node.node_id)+" erased");
			i=functors_found->erase(i);
		}
	}
	return functors_found;
}

void interpreter::find_functors_for_dependency(const std::string& dependency, const std::string& d_key, const query_result* dependencies,
		std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> >& functors_found,
		std::vector<std::pair<unsigned int,std::string> >& dependency_stack){
	const std::pair<const unsigned int,field> *depolex_entry=NULL;
	std::string lexeme,lexeme_d_key;
	std::vector<std::pair<unsigned int,std::string> >::const_iterator j;

	if(dependencies!=NULL){
		depolex_entry=dependencies->first_value_for_field_name_found("semantic_dependency",dependency);
		if(d_key.empty()==false){
			while(depolex_entry!=NULL&&*dependencies->field_value_at_row_position(depolex_entry->first,"semantic_dependency")==dependency
					&&*dependencies->field_value_at_row_position(depolex_entry->first,"ref_d_key")!=d_key){
				depolex_entry=dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"semantic_dependency",dependency);
			}
		}
		while(depolex_entry!=NULL){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"looking for functor with dependency "
			+*dependencies->field_value_at_row_position(depolex_entry->first,"semantic_dependency")+" with d_key "
			+*dependencies->field_value_at_row_position(depolex_entry->first,"d_key"));
			lexeme=*dependencies->field_value_at_row_position(depolex_entry->first,"lexeme");
			lexeme_d_key=*dependencies->field_value_at_row_position(depolex_entry->first,"d_key");
			for(j=dependency_stack.begin();j!=dependency_stack.end();++j){
				if(j->first==depolex_entry->first&&j->second==depolex_entry->second.field_value) break;
			}
			if(j==dependency_stack.end()){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"push to dependency stack the row index:"+std::to_string(depolex_entry->first)+" and semantic dependency:"+depolex_entry->second.field_value);
				dependency_stack.push_back(std::make_pair(depolex_entry->first,depolex_entry->second.field_value));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting in functors_found an entry with row id "+std::to_string(dependency_stack.begin()->first)+", functor="+lexeme+" d_key="+lexeme_d_key);
				functors_found.insert(std::make_pair(std::make_pair(lexeme,lexeme_d_key),*dependency_stack.begin()));
				find_functors_for_dependency(lexeme,lexeme_d_key,dependencies,functors_found,dependency_stack);
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"pop from dependency stack the row index:"+std::to_string(depolex_entry->first)+" and semantic dependency:"+depolex_entry->second.field_value);
				dependency_stack.pop_back();
			}
			depolex_entry=dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"semantic_dependency",dependency);
			if(d_key.empty()==false){
				while(depolex_entry!=NULL&&*dependencies->field_value_at_row_position(depolex_entry->first,"semantic_dependency")==dependency
						&&*dependencies->field_value_at_row_position(depolex_entry->first,"ref_d_key")!=d_key){
					depolex_entry=dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"semantic_dependency",dependency);
				}
			}
		}
	}
}

void interpreter::get_nodes_by_symbol(const node_info& root_node, const std::string symbol, const std::string lexeme, std::map<unsigned int,bool>& lookup_nodes_reached, std::vector<unsigned int>& nodes_found){
	//root_node: root node of the subtree in which the node should be found by the symbol
	//symbol: symbol of the node by which the node should be found
	//nodes_found: node ids of the nodes found

	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"get nodes by symbol: root_node.symbol:"+root_node.symbol+", symbol:"+symbol+", lexeme:"+lexeme);
	if(symbol.empty()==false){
		auto lookup_node_reached=lookup_nodes_reached.find(root_node.node_id);
		bool is_lookup_node_reached=false;
		if(lookup_node_reached!=lookup_nodes_reached.end()){
			lookup_node_reached->second=true;
			is_lookup_node_reached=true;
		}
		else{
			for(lookup_node_reached=lookup_nodes_reached.begin();lookup_node_reached!=lookup_nodes_reached.end();++lookup_node_reached){
				if(lookup_node_reached->second==true){
					is_lookup_node_reached=true;
					lookup_node_reached=lookup_nodes_reached.end();
					break;
				}
			}
		}
		if(root_node.ref_to_context==true&&root_node.ref_node_ids.empty()==false){
			for(unsigned int i:root_node.ref_node_ids){
				node_info ref_node=get_node_info(i);
				if(lookup_nodes_reached.empty()==true||is_lookup_node_reached==true){
					if(ref_node.symbol==symbol&&lexeme.empty()==true
						||lexeme.empty()==true&&ref_node.expression.morphalytics!=NULL&&ref_node.expression.morphalytics->gcat()==symbol
						||lexeme.empty()==true&&ref_node.expression.morphalytics!=NULL&&ref_node.expression.morphalytics->is_mocked()==false&&ref_node.expression.morphalytics->has_feature(symbol)==true
						||lexeme.empty()==false&&ref_node.expression.morphalytics!=NULL&&ref_node.expression.morphalytics->gcat()==symbol&&ref_node.expression.lexeme==lexeme){
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"node_found_by_symbol '"+symbol+"':"+std::to_string(ref_node.node_id));
						nodes_found.push_back(ref_node.node_id);
					}
				}
				if(ref_node.left_child!=0)get_nodes_by_symbol(get_node_info(ref_node.left_child),symbol,lexeme,lookup_nodes_reached,nodes_found);
				if(ref_node.right_child!=0)get_nodes_by_symbol(get_node_info(ref_node.right_child),symbol,lexeme,lookup_nodes_reached,nodes_found);
			}
		}
		else{
			if(lookup_nodes_reached.empty()==true||is_lookup_node_reached==true){
				if(root_node.symbol==symbol&&lexeme.empty()==true
					||lexeme.empty()==true&&root_node.expression.morphalytics!=NULL&&root_node.expression.morphalytics->gcat()==symbol
					||lexeme.empty()==true&&root_node.expression.morphalytics!=NULL&&root_node.expression.morphalytics->is_mocked()==false&&root_node.expression.morphalytics->has_feature(symbol)==true
					||lexeme.empty()==false&&root_node.expression.morphalytics!=NULL&&root_node.expression.morphalytics->gcat()==symbol&&root_node.expression.lexeme==lexeme){
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"node_found_by_symbol '"+symbol+"':"+std::to_string(root_node.node_id));
					nodes_found.push_back(root_node.node_id);
				}
			}
			if(root_node.left_child!=0)get_nodes_by_symbol(get_node_info(root_node.left_child),symbol,lexeme,lookup_nodes_reached,nodes_found);
			if(root_node.right_child!=0)get_nodes_by_symbol(get_node_info(root_node.right_child),symbol,lexeme,lookup_nodes_reached,nodes_found);
		}
		if(lookup_node_reached!=lookup_nodes_reached.end()){
			lookup_node_reached->second=false;
		}
	}
	else{
		throw std::runtime_error("Do you want me to look for empty symbols in parser tree? Stop.");
	}
}

void interpreter::find_dependencies_for_node(const unsigned int node_id, t_map_of_node_ids_and_d_keys_to_nr_of_deps& dependencies_found,
	std::multimap<std::pair<std::string,unsigned int>,std::tuple<std::string,unsigned int,unsigned int,unsigned int,unsigned int,unsigned int> >& optional_dependencies_checked,
	std::multimap<std::pair<unsigned int,unsigned int>,std::string>& dependencies_not_found){
	std::pair<unsigned int,unsigned int> dependency_for_d_key_found;
	std::string d_key="0",functor;
	unsigned int d_counter=0;
	const std::pair<const unsigned int,field> *depolex_entry=NULL;
	std::vector<p_m1_node_id_m2_d_key> node_d_key_route;
	p_m1_node_id_m2_d_key parent_node;
	//TODO: shall dependencies_found_via_optional_paths be a map instead of multimap?
	std::multimap<unsigned int,std::tuple<unsigned int,unsigned int,unsigned int,unsigned int> > dependencies_found_via_optional_paths;
	std::set<unsigned int> unique_optional_dependency_paths;

	const node_info& node=get_node_info(node_id);
	if(node.expression.dependencies!=NULL){
		if(node.expression.lexicon_entry==true){
			functor=node.expression.lexeme;
		}
		else{
			functor=node.expression.gcat;
		}
		depolex_entry=node.expression.dependencies->first_value_for_field_name_found("lexeme",functor);
		while(depolex_entry!=NULL&&functor==*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"lexeme")
				&&d_key!=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")){
			d_key=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key");
			d_counter=std::atoi(node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_counter")->c_str());
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking top level entry for functor "+functor+" d_key "+d_key);
			if(node_dependency_traversal_stack.empty()==false){
				parent_node=node_dependency_traversal_stack.top();
				auto traversal_node=node_dependency_traversal_stack_tree.find(std::make_pair(node_dependency_traversal_stack.size(),parent_node));
				if(traversal_node!=node_dependency_traversal_stack_tree.end()&&node.node_links.find(parent_node.first)!=node.node_links.end()){
					traversal_node->second.push_back(std::make_pair(node_id,std::atoi(d_key.c_str())));
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"push_back to vector of node_id "+std::to_string(parent_node.first)+" with d_key "+std::to_string(parent_node.second)+" the node_id "+std::to_string(node_id)+" with d_key "+d_key);
				}
				if(dependencies_found.empty()==false){
					auto traversal_node_dependencies=node_dependency_traversals.find(parent_node);
					if(traversal_node_dependencies==node_dependency_traversals.end()){
						node_dependency_traversals.insert(std::make_pair(parent_node,dependencies_found));
					}
					else{
						traversal_node_dependencies->second.clear();
						traversal_node_dependencies->second.insert(dependencies_found.begin(),dependencies_found.end());
					}
				}
				if(optional_dependencies_checked.empty()==false){
					auto traversal_node_odependencies=node_odependency_traversals.find(parent_node);
					if(traversal_node_odependencies==node_odependency_traversals.end()){
						node_odependency_traversals.insert(std::make_pair(parent_node,optional_dependencies_checked));
					}
					else{
						traversal_node_odependencies->second.clear();
						traversal_node_odependencies->second.insert(optional_dependencies_checked.begin(),optional_dependencies_checked.end());
					}
				}
			}
			dependencies_found.clear();
			optional_dependencies_checked.clear();
			node_dependency_traversal_stack.push(std::make_pair(node_id,std::atoi(d_key.c_str())));
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"pushed to stack node_id "+std::to_string(node_id)+" with d_key "+d_key);
			auto traversal_node=node_dependency_traversal_stack_tree.find(std::make_pair(node_dependency_traversal_stack.size(),std::make_pair(node_id,std::atoi(d_key.c_str()))));
			if(traversal_node==node_dependency_traversal_stack_tree.end()){
				node_d_key_route.clear();
				node_dependency_traversal_stack_tree.insert(std::make_pair(std::make_pair(node_dependency_traversal_stack.size(),std::make_pair(node_id,std::atoi(d_key.c_str()))),node_d_key_route));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting in traversal tree at level "+std::to_string(node_dependency_traversal_stack.size())+": node_id "+std::to_string(node_id)+" with d_key "+d_key+" the node_d_key_route");
			}
			else{
				throw std::runtime_error("What shall I do in this case? A previously processed node with its functor/d_key gets processed again. There may be a conflict in the rule_to_rule_map table.");
			}
			find_dependencies_for_functor(std::to_string(node.node_id),d_key,d_counter,node.node_id,d_key,dependencies_found,optional_dependencies_checked,dependencies_found_via_optional_paths,dependencies_not_found);
			unique_optional_dependency_paths.clear();
			for(auto&& i:dependencies_found_via_optional_paths){
				//if there are more than one optional dependency paths leading to the same real dependency,
				//select the first one and collect them in a set
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking uniqueness of optional dependency with path nr "+std::to_string(i.first)
				+" and node id "+std::to_string(std::get<0>(i.second))
				+" d_key "+std::to_string(std::get<1>(i.second))
				+" dependent node id "+std::to_string(std::get<2>(i.second))
				+" odep level "+std::to_string(std::get<3>(i.second)));
				bool duplicate_found=false;
				for(auto&& j:unique_optional_dependency_paths){
					auto optional_dependency_path=dependencies_found_via_optional_paths.find(j);
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"against optional dependency with path nr "+std::to_string(j)
					+" and node id "+std::to_string(std::get<0>(optional_dependency_path->second))
					+" d_key "+std::to_string(std::get<1>(optional_dependency_path->second))
					+" dependent node id "+std::to_string(std::get<2>(optional_dependency_path->second))
					+" odep level "+std::to_string(std::get<3>(optional_dependency_path->second)));
					if(i.first!=j&&std::get<0>(i.second)==std::get<0>(optional_dependency_path->second)
						&&std::get<1>(i.second)==std::get<1>(optional_dependency_path->second)
						&&std::get<2>(i.second)==std::get<2>(optional_dependency_path->second)){
						duplicate_found=true;
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"duplicate found");
					}
				}
				if(duplicate_found==false){
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting optional dependency in unique optional dependency paths");
					unique_optional_dependency_paths.insert(i.first);
				}
			}
			for(std::map<std::pair<std::string,unsigned int>,std::tuple<std::string,unsigned int,unsigned int,unsigned int,unsigned int,unsigned int> >::iterator j=optional_dependencies_checked.begin();j!=optional_dependencies_checked.end();){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"looking for optional dependency in unique odep paths with path nr "+std::to_string(std::get<3>(j->second))
				+" and functor "+j->first.first
				+" d_key "+std::to_string(j->first.second)
				+" d_counter "+std::to_string(std::get<5>(j->second))
				+" parent node id "+std::get<0>(j->second)
				+" parent d_key "+std::to_string(std::get<1>(j->second))
				+" parent d_counter "+std::to_string(std::get<2>(j->second))
				+" odep level "+std::to_string(std::get<4>(j->second)));
				auto unique_optional_dependency_path=unique_optional_dependency_paths.find(std::get<3>(j->second));
				if(unique_optional_dependency_path==unique_optional_dependency_paths.end()){
					//if there are more than one optional dependency paths leading to the same real dependency,
					//keep only the first ones selected into unique_optional_dependency_paths, delete all others
					j=optional_dependencies_checked.erase(j);
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"deleting optional dependency: no unique optional dependency path found");
				}
				else if(std::get<4>(j->second)>std::get<3>(dependencies_found_via_optional_paths.find(*unique_optional_dependency_path)->second)){
					//Cut off optional dependencies checked out that stem from a real dependency but lead to no other real dependency
					//TODO: if there are more than one entries with the same path nr in dependencies_found_via_optional_paths
					//find the entry with the greatest odep level and carry out the comparison with that.
					//That will mean that the optional dependency being iterated over was inserted in its container AFTER
					//finding the last real dependency that was registered in dependencies_found_via_optional_paths.
					j=optional_dependencies_checked.erase(j);
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"deleting optional dependency: odep level in optional_dependencies_checked is greater for this functor than in dependencies_found_via_optional_paths");
				}
				else{
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"optional dependency path is unique: leave it as it is");
					++j;
				}
			}
			parent_node=node_dependency_traversal_stack.top();
			if(dependencies_found.empty()==false){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting dependencies found into dependency traversals of parent node id "+std::to_string(parent_node.first)+" with d_key "+std::to_string(parent_node.second));
				auto traversal_node_dependencies=node_dependency_traversals.find(parent_node);
				if(traversal_node_dependencies==node_dependency_traversals.end()){
					node_dependency_traversals.insert(std::make_pair(parent_node,dependencies_found));
				}
				else{
					traversal_node_dependencies->second.clear();
					traversal_node_dependencies->second.insert(dependencies_found.begin(),dependencies_found.end());
				}
			}
			else{
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"there are no dependencies found to insert into dependency traversals");
			}
			dependencies_found.clear();
			if(optional_dependencies_checked.empty()==false){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting optional dependencies checked into optional dependency traversals of parent node id "+std::to_string(parent_node.first)+" with d_key "+std::to_string(parent_node.second));
				auto traversal_node_odependencies=node_odependency_traversals.find(parent_node);
				if(traversal_node_odependencies==node_odependency_traversals.end()){
					node_odependency_traversals.insert(std::make_pair(parent_node,optional_dependencies_checked));
				}
				else{
					traversal_node_odependencies->second.clear();
					traversal_node_odependencies->second.insert(optional_dependencies_checked.begin(),optional_dependencies_checked.end());
				}
			}
			else{
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"there are no optional dependencies checked to insert into optional dependency traversals");
			}
			optional_dependencies_checked.clear();
			node_dependency_traversal_stack.pop();
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"popped dependency traversal stack");
			if(node_dependency_traversal_stack.empty()==false){//restore dependencies_found and optional_dependencies_checked using node_dependency_traversal_stack.top()
				parent_node=node_dependency_traversal_stack.top();
				auto traversal_node_dependencies=node_dependency_traversals.find(parent_node);
				auto traversal_node_odependencies=node_odependency_traversals.find(parent_node);
				dependencies_found.clear();
				if(traversal_node_dependencies!=node_dependency_traversals.end()){
					dependencies_found.insert(traversal_node_dependencies->second.begin(),traversal_node_dependencies->second.end());
				}
				optional_dependencies_checked.clear();
				if(traversal_node_odependencies!=node_odependency_traversals.end()){
					optional_dependencies_checked.insert(traversal_node_odependencies->second.begin(),traversal_node_odependencies->second.end());
				}
			}
			while(depolex_entry!=NULL&&*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")==d_key){
				depolex_entry=node.expression.dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"lexeme",functor);
			}
		}
	}
}

const std::pair<const unsigned int,field>* interpreter::followup_dependency(const unsigned int previous_dependency_row_index,const std::string& lexeme,const std::string& d_key,const bool previous_dependency_found,const query_result& dependencies){
	std::string next_counter;
	const std::pair<const unsigned int,field> *depolex_entry=NULL;

	if(previous_dependency_found==true){
		next_counter=*dependencies.field_value_at_row_position(previous_dependency_row_index,"d_successor");
	}
	else{
		next_counter=*dependencies.field_value_at_row_position(previous_dependency_row_index,"d_failover");
	}
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"next counter: "+next_counter);
	if(std::atoi(next_counter.c_str())>0&&std::atoi(next_counter.c_str())>std::atoi(dependencies.field_value_at_row_position(previous_dependency_row_index,"d_counter")->c_str())){
		depolex_entry=dependencies.value_for_field_name_found_after_row_position(previous_dependency_row_index,"lexeme",lexeme);
		while(depolex_entry!=NULL&&*dependencies.field_value_at_row_position(depolex_entry->first,"d_key")==d_key
				&&*dependencies.field_value_at_row_position(depolex_entry->first,"d_counter")!=next_counter){
			depolex_entry=dependencies.value_for_field_name_found_after_row_position(depolex_entry->first,"lexeme",lexeme);
		}
	}
	return depolex_entry;
}

void interpreter::find_dependencies_for_functor(const std::string& parent_node_id, const std::string& parent_d_key, const unsigned int parent_d_counter,
		const unsigned int node_id, const std::string& d_key,
		t_map_of_node_ids_and_d_keys_to_nr_of_deps& dependencies_found,
		std::multimap<std::pair<std::string,unsigned int>,std::tuple<std::string,unsigned int,unsigned int,unsigned int,unsigned int,unsigned int> >& optional_dependencies_checked,
		std::multimap<unsigned int,std::tuple<unsigned int,unsigned int,unsigned int,unsigned int> >& dependencies_found_via_optional_paths,
		std::multimap<std::pair<unsigned int,unsigned int>,std::string>& dependencies_not_found){
	const std::pair<const unsigned int,field> *depolex_entry=NULL;
	std::string semantic_dependency,ref_d_key,d_counter="0",manner,d_failover,d_successor;
	std::multimap<unsigned int,unsigned int>::const_iterator dependency_matrix_entry;
	std::map<unsigned int,unsigned int>::const_iterator j;
	t_map_of_node_ids_and_d_keys_to_nr_of_deps::iterator dependencies_found_entry;
	std::set<unsigned int> d_counter_validated_dependencies,d_key_validated_dependencies;
	bool dependency_found_for_functor=false,node_being_processed=false;
	std::stack<p_m1_node_id_m2_d_key> traversal_stack;

	const node_info& node=get_node_info(node_id);
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking dependency for functor "+node.expression.lexeme+" d_key "+d_key);
	if(node.expression.gcat=="CON"){
		depolex_entry=node.expression.dependencies->first_value_for_field_name_found("lexeme","CON");
//		Just copied here as a reminder once CON is allowed to have more than one d_key
//		while(depolex_entry!=NULL&&*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")!=d_key){
//			depolex_entry=node.expression.dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"lexeme","CON");
//		}
	}
	else if(node.expression.lexicon_entry==false){
		depolex_entry=node.expression.dependencies->first_value_for_field_name_found("lexeme",node.expression.gcat);
		while(depolex_entry!=NULL&&*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")!=d_key){
			depolex_entry=node.expression.dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"lexeme",node.expression.gcat);
		}
	}
	else{
		depolex_entry=node.expression.dependencies->first_value_for_field_name_found("lexeme",node.expression.lexeme);
		while(depolex_entry!=NULL&&*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")!=d_key){
			depolex_entry=node.expression.dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"lexeme",node.expression.lexeme);
		}
	}
	if(depolex_entry==NULL){
		//throw exception as for each functor there must be one entry with at least NULL dependency
		throw std::runtime_error("Exiting, no dependency entry found for functor "+node.expression.lexeme+" in DEPOLEX db table.");
	}
	while(depolex_entry!=NULL&&*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")==d_key){
		d_counter=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_counter");
		semantic_dependency=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"semantic_dependency");
		ref_d_key=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"ref_d_key");
		manner=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"manner");
		d_failover=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_failover");
		d_successor=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_successor");
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking dependency entry "+semantic_dependency+" ref_d_key "+ref_d_key+" for functor "+node.expression.lexeme+" d_key "+d_key+" d_counter "+d_counter);
		if(semantic_dependency.empty()==false&&ref_d_key.empty()==false&&(manner.empty()==true||manner=="0"||manner=="1"||manner=="2")){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"looking up depolex entry with row id "+std::to_string(depolex_entry->first)+" in dep.val.matrix");
			d_counter_validated_dependencies.clear();
			//Insert the corresponding entry into dependencies_found to indicate that the node id is already being checked
			dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(d_key.c_str())),std::make_tuple(parent_node_id,0,0,std::atoi(parent_d_key.c_str()),parent_d_counter)));
			for(dependency_matrix_entry=node.dependency_validation_matrix.lower_bound(depolex_entry->first);
					dependency_matrix_entry!=node.dependency_validation_matrix.upper_bound(depolex_entry->first);
					++dependency_matrix_entry){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dvm entry row index:"+std::to_string(dependency_matrix_entry->first)+", dep.node id:"+std::to_string(dependency_matrix_entry->second));
				//If the row_id of the depolex_entry is found among the row_ids stored in the dep.vld.matrix
				//then the field values match as well since both row_ids refer to the corresponding
				//field in the node.expression.dependencies attribute.
				if(d_key_validated_dependencies.find(dependency_matrix_entry->second)==d_key_validated_dependencies.end()){
					d_counter_validated_dependencies.insert(dependency_matrix_entry->second);
					d_key_validated_dependencies.insert(dependency_matrix_entry->second);
					find_dependencies_for_functor(std::to_string(node_id),d_key,std::atoi(d_counter.c_str()),get_node_info(dependency_matrix_entry->second).node_id,ref_d_key,dependencies_found,optional_dependencies_checked,dependencies_found_via_optional_paths,dependencies_not_found);
				}
			}
			if((manner.empty()==true||manner=="0")&&d_counter_validated_dependencies.size()==1
					||manner=="1"&&d_counter_validated_dependencies.size()>=1
					||manner=="2"&&d_counter_validated_dependencies.size()>1){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dependency "+semantic_dependency+" checked for functor "+node.expression.lexeme);
				dependency_found_for_functor=true;
			}
			else if((manner.empty()==true||manner=="0")&&d_counter_validated_dependencies.size()==0
					||manner=="1"&&d_counter_validated_dependencies.size()<1
					||manner=="2"&&d_counter_validated_dependencies.size()<=1){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dependency check for "+semantic_dependency+" returned FALSE for functor "+node.expression.lexeme+" with d_key "+d_key);
				if(std::atoi(d_failover.c_str())>=std::atoi(d_counter.c_str())){
					find_dependencies_for_functor(std::to_string(node_id),d_key,std::atoi(d_counter.c_str()),node_id,d_key,semantic_dependency,ref_d_key,dependencies_found,optional_dependencies_checked,dependencies_found_via_optional_paths,dependencies_not_found);
				}
				dependency_found_for_functor=false;
			}
			else{
				throw dependency_counter_manner_validation_failed(node.expression.lexeme);
			}
			dependencies_found_entry=dependencies_found.find(std::make_pair(node_id,std::atoi(d_key.c_str())));
			if(dependency_found_for_functor==true){
				if(dependencies_found_entry!=dependencies_found.end()){
					std::get<2>(dependencies_found_entry->second)+=d_counter_validated_dependencies.size();
					if(std::atoi(d_successor.c_str())==0||std::atoi(d_successor.c_str())>std::atoi(d_counter.c_str())){
						std::get<1>(dependencies_found_entry->second)+=d_counter_validated_dependencies.size();
					}
					else{
						//Don't increase counter for found dependencies: this indicates a deliberate error on the success branch
					}
				}
				else{
					dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(d_key.c_str())),std::make_tuple(parent_node_id,d_counter_validated_dependencies.size(),d_counter_validated_dependencies.size(),std::atoi(parent_d_key.c_str()),parent_d_counter)));
				}
			}
			else{
				if(dependencies_found_entry!=dependencies_found.end()){
					//No manner condition was fulfilled, don't increase the number of dependencies found
					//but increase the number of dependencies to be found
					if(d_failover.empty()==true||d_failover=="0"||std::atoi(d_failover.c_str())<std::atoi(d_counter.c_str())){
						if(manner.empty()==true||manner=="0"||manner=="1"){
							std::get<2>(dependencies_found_entry->second)+=1;
						}
						else if(manner=="2"){
							std::get<2>(dependencies_found_entry->second)+=2;
						}
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"insert into dependencies_not_found: "+semantic_dependency);
						dependencies_not_found.insert(std::make_pair(std::make_pair(node.node_id,std::atoi(d_key.c_str())),semantic_dependency));
					}
				}
				else{
					dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(d_key.c_str())),std::make_tuple(parent_node_id,0,0,std::atoi(parent_d_key.c_str()),parent_d_counter)));
				}
			}
		}
		else if(semantic_dependency.empty()==true&&ref_d_key.empty()==true){
			//A leaf in the dependency tree is found so the semantic dependency is empty. As such, there's no
			//functor-dependency pair to be checked in the dep.vld.matrix so let's go on with the next dependency.
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"leaf dependency "+semantic_dependency+" checked for functor "+node.expression.lexeme+" and has no further dependency");
			dependencies_found_entry=dependencies_found.find(std::make_pair(node_id,std::atoi(d_key.c_str())));
			if(dependencies_found_entry!=dependencies_found.end()){
				//Don't increase the number of dependencies (++dependencies_found_entry->second;), NULL dependency is considered as found but not counted
				//dependency_found_for_functor=true;//TODO: consider if setting this flag is ok here or should it be set to true anyway for leaves?
			}
			else{
				dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(d_key.c_str())),std::make_tuple(parent_node_id,0,0,std::atoi(parent_d_key.c_str()),parent_d_counter)));
				//dependency_found_for_functor=false;//TODO: consider if setting this flag is ok here or should it be set to true anyway for leaves?
			}
			dependency_found_for_functor=true;
		}
		else{
			throw std::runtime_error("Inconsistent setup of manner, semantic_dependency and ref_d_key for lexeme "+node.expression.lexeme+", d_key "+d_key+" and d_counter "+d_counter+" in DEPOLEX db table.");
		}
		if(node.expression.gcat=="CON"||node.expression.lexicon_entry==false){
			depolex_entry=followup_dependency(depolex_entry->first,node.expression.gcat,d_key,dependency_found_for_functor,*node.expression.dependencies);
		}
		else{
			depolex_entry=followup_dependency(depolex_entry->first,node.expression.lexeme,d_key,dependency_found_for_functor,*node.expression.dependencies);
		}
	}
	//Commented out the code below as it was meant to support graphs with more than one head. A minimal example for that
	//is when A and B nodes are head (main) nodes and C is a dependency of both but A and B are not related to each other at all.
	//The course of development did not follow that idea and now it poses a problem for nodes with a functor having more than one
	//d_key. Let's extend the previous example to a diamond shape where A is the root, B and C are dependencies of A but
	//B is a dependency of A's functor with d_key 1 and C is a dependency of A's functor with d_key 2. D is a dependency of B and C.
	//When this function processes the dependencies of D (if any), in the end it'll check the node links of D and finds either B or C
	//depending on which direction is processed first. So find_dependencies_for_node() will be called for the node D, registering B or C
	//as it's main node, connecting the nodes in a way like A->B->D->C (or A->C->D->B) which is wrong since it should either be A->B->D
	//or A->C->D.
	/*for(j=node.node_links.begin();j!=node.node_links.end();++j){
		node_being_processed=false;
		for(dependencies_found_entry=dependencies_found.begin();dependencies_found_entry!=dependencies_found.end();++dependencies_found_entry){
			if(dependencies_found_entry->first.first==j->first){
				node_being_processed=true;
				break;
			}
		}
		if(node_being_processed==false){
			traversal_stack=node_dependency_traversal_stack;
			while(traversal_stack.empty()==false){
				auto stack_top_node=traversal_stack.top();
				auto stack_top_node_dependencies=node_dependency_traversals.find(stack_top_node);
				if(stack_top_node_dependencies!=node_dependency_traversals.end()){
					for(auto dependency_entry=stack_top_node_dependencies->second.begin();dependency_entry!=stack_top_node_dependencies->second.end();++dependency_entry){
						if(dependency_entry->first.first==j->first){
							node_being_processed=true;
							break;
						}
					}
					if(node_being_processed==true) break;
				}
				traversal_stack.pop();
			}
		}
		if(node_being_processed==false){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"finding dependencies for node with node id "+std::to_string(j->first));
			find_dependencies_for_node(j->first,dependencies_found,optional_dependencies_checked);
		}
	}*/
}

void interpreter::find_dependencies_for_functor(const std::string& parent_node_id, const std::string& parent_d_key,const unsigned int parent_d_counter,
		const unsigned int node_id, const std::string& node_d_key, const std::string& functor, const std::string& d_key,
		t_map_of_node_ids_and_d_keys_to_nr_of_deps& dependencies_found,
		std::multimap<std::pair<std::string,unsigned int>,std::tuple<std::string,unsigned int,unsigned int,unsigned int,unsigned int,unsigned int> >& optional_dependencies_checked,
		std::multimap<unsigned int,std::tuple<unsigned int,unsigned int,unsigned int,unsigned int> >& dependencies_found_via_optional_paths,
		std::multimap<std::pair<unsigned int,unsigned int>,std::string>& dependencies_not_found){
	const std::pair<const unsigned int,field> *depolex_entry=NULL;
	std::string semantic_dependency,ref_d_key,d_counter="0",manner,d_failover,d_successor;
	std::multimap<unsigned int,unsigned int>::const_iterator dependency_matrix_entry;
	std::map<unsigned int,unsigned int>::const_iterator j;
	t_map_of_node_ids_and_d_keys_to_nr_of_deps::iterator dependencies_found_entry;
	std::set<unsigned int> d_counter_validated_dependencies,d_key_validated_dependencies,checked_d_counters;
	bool dependency_found_for_functor=false;
	unsigned int nr_of_skipped_opa_rules=0,nr_of_rules=0,path_nr=0,odep_level=0;

	const node_info& node=get_node_info(node_id);
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking dependency for optional functor "+functor+" d_key "+d_key);
	depolex_entry=node.expression.dependencies->first_value_for_field_name_found("lexeme",functor);
	if(depolex_entry==NULL){
		//throw exception as for each functor there must be one entry with at least NULL dependency
		throw std::runtime_error("Exiting, no dependency entry found for functor "+functor+" in DEPOLEX db table.");
	}
	while(depolex_entry!=NULL&&*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")!=d_key){
		depolex_entry=node.expression.dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"lexeme",functor);
	}
	while(depolex_entry!=NULL&&*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")==d_key){
		++nr_of_rules;
		if(std::atoi(node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"optional_parent_allowed")->c_str())==true){
			d_counter=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_counter");
			semantic_dependency=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"semantic_dependency");
			ref_d_key=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"ref_d_key");
			manner=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"manner");
			d_failover=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_failover");
			d_successor=*node.expression.dependencies->field_value_at_row_position(depolex_entry->first,"d_successor");
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking dependency entry "+semantic_dependency+" ref_d_key "+ref_d_key+" for functor "+functor+" d_key "+d_key+" d_counter "+d_counter);
			if(semantic_dependency.empty()==false&&ref_d_key.empty()==false&&(manner.empty()==true||manner=="0"||manner=="1"||manner=="2")){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"looking up depolex entry with row id "+std::to_string(depolex_entry->first)+" in dep.val.matrix");
				d_counter_validated_dependencies.clear();
				//Insert the corresponding entry into optional_dependencies_checked to indicate that the node id is already being checked
				if(dependencies_found_via_optional_paths.empty()==true) path_nr=1;
				else path_nr=dependencies_found_via_optional_paths.rbegin()->first+1;
				odep_level=optional_dependencies_checked.size()+1;
				optional_dependencies_checked.insert(std::make_pair(std::make_pair(functor,std::atoi(d_key.c_str())),std::make_tuple(parent_node_id,std::atoi(parent_d_key.c_str()),parent_d_counter,path_nr,odep_level,std::atoi(d_counter.c_str()))));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"optional dependency level:"+std::to_string(odep_level)+", path_nr "+std::to_string(path_nr));
				for(dependency_matrix_entry=node.dependency_validation_matrix.lower_bound(depolex_entry->first);
					dependency_matrix_entry!=node.dependency_validation_matrix.upper_bound(depolex_entry->first);
					++dependency_matrix_entry){
					//If the row_id of the depolex_entry is found among the row_ids stored in the dep.vld.matrix
					//then the field values match as well since both row_ids refer to the corresponding
					//field in the node.expression.dependencies attribute.
					if(d_key_validated_dependencies.find(dependency_matrix_entry->second)==d_key_validated_dependencies.end()){
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting dependency node id "+std::to_string(dependency_matrix_entry->second)+" of dependency "+get_node_info(dependency_matrix_entry->second).expression.lexeme+" d_counter_validated_dependencies");
						d_counter_validated_dependencies.insert(dependency_matrix_entry->second);
						d_key_validated_dependencies.insert(dependency_matrix_entry->second);
						find_dependencies_for_functor(functor,d_key,std::atoi(d_counter.c_str()),get_node_info(dependency_matrix_entry->second).node_id,ref_d_key,dependencies_found,optional_dependencies_checked,dependencies_found_via_optional_paths,dependencies_not_found);
					}
				}
				if((manner.empty()==true||manner=="0")&&d_counter_validated_dependencies.size()==1
						||manner=="1"&&d_counter_validated_dependencies.size()>=1
						||manner=="2"&&d_counter_validated_dependencies.size()>1){
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dependency "+semantic_dependency+" checked for functor "+functor);
					dependency_found_for_functor=true;
				}
				else if((manner.empty()==true||manner=="0")&&d_counter_validated_dependencies.size()==0
						||manner=="1"&&d_counter_validated_dependencies.size()<1
						||manner=="2"&&d_counter_validated_dependencies.size()<=1){
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dependency check for "+semantic_dependency+" returned FALSE for functor "+functor+" with d_key "+d_key);
					if((std::atoi(d_failover.c_str())>=std::atoi(d_counter.c_str()))){
						find_dependencies_for_functor(functor,d_key,std::atoi(d_counter.c_str()),node_id,node_d_key,semantic_dependency,ref_d_key,dependencies_found,optional_dependencies_checked,dependencies_found_via_optional_paths,dependencies_not_found);
					}
					dependency_found_for_functor=false;
				}
				else{
					throw dependency_counter_manner_validation_failed(functor);
				}
				dependencies_found_entry=dependencies_found.find(std::make_pair(node_id,std::atoi(node_d_key.c_str())));
				if(dependency_found_for_functor==true){
					unsigned int nr_of_deps_to_add=0;
					if(dependencies_found_entry!=dependencies_found.end()){
						//shall path_nr be recalculated here or the previously calculated value should be used?
						if(dependencies_found_via_optional_paths.empty()==true) path_nr=1;
						else path_nr=dependencies_found_via_optional_paths.rbegin()->first+1;
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"path nr "+std::to_string(path_nr)+" when dependency found");
						for(auto&& i:d_counter_validated_dependencies){
							bool dependency_already_found_for_node_id=false;
							for(auto&& j:dependencies_found_via_optional_paths){
								logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking if dependency "+semantic_dependency+", ref_d_key "+ref_d_key+" with node_id "+std::to_string(i)+" for functor "+get_node_info(node_id).expression.lexeme+" node_id "+std::to_string(node_id)+", d_key "+node_d_key+" is registered");
								if(std::get<0>(j.second)==node_id
									&&std::get<1>(j.second)==std::atoi(node_d_key.c_str())
									&&std::get<2>(j.second)==i){
									dependency_already_found_for_node_id=true;
									break;
								}
							}
							if(dependency_already_found_for_node_id==false){
								logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"register dependency "+semantic_dependency+", ref_d_key "+ref_d_key+" with node_id "+std::to_string(i)+" for functor "+get_node_info(node_id).expression.lexeme+" node_id "+std::to_string(node_id)+", d_key "+node_d_key
								+" with optional functor "+functor+" and optional dependency level:"+std::to_string(odep_level)+" on path nr "+std::to_string(path_nr));
								dependencies_found_via_optional_paths.insert(std::make_pair(path_nr,std::make_tuple(node_id,std::atoi(node_d_key.c_str()),i,odep_level)));
								++nr_of_deps_to_add;
							}
						}
						if(nr_of_deps_to_add>0){
							std::get<2>(dependencies_found_entry->second)+=nr_of_deps_to_add;
							if(std::atoi(d_successor.c_str())==0||std::atoi(d_successor.c_str())>std::atoi(d_counter.c_str())){
								std::get<1>(dependencies_found_entry->second)+=nr_of_deps_to_add;
							}
							else{
								//Don't increase counter for found dependencies: this indicates a deliberate error on the success branch
							}
						}
					}
					else{
						//shall path_nr be recalculated here or the previously calculated value should be used?
						if(dependencies_found_via_optional_paths.empty()==true) path_nr=1;
						else path_nr=dependencies_found_via_optional_paths.rbegin()->first+1;
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"path nr "+std::to_string(path_nr)+" when dependency not found");
						for(auto&& i:d_counter_validated_dependencies){
							bool dependency_already_found_for_node_id=false;
							for(auto&& j:dependencies_found_via_optional_paths){
								if(std::get<0>(j.second)==node_id
									&&std::get<1>(j.second)==std::atoi(node_d_key.c_str())
									&&std::get<2>(j.second)==i){
									dependency_already_found_for_node_id=true;
									break;
								}
							}
							if(dependency_already_found_for_node_id==false){
								logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"register dependency "+semantic_dependency+" for functor "+get_node_info(node_id).expression.lexeme+" node_id "+std::to_string(node_id)+" with optional functor "+functor
								+"optional dependency level:"+std::to_string(odep_level));
								dependencies_found_via_optional_paths.insert(std::make_pair(path_nr,std::make_tuple(node_id,std::atoi(node_d_key.c_str()),i,odep_level)));
								++nr_of_deps_to_add;
							}
						}
						if(nr_of_deps_to_add>0){
							dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(node_d_key.c_str())),std::make_tuple(parent_node_id,nr_of_deps_to_add,nr_of_deps_to_add,std::atoi(parent_d_key.c_str()),parent_d_counter)));
						}
					}
				}
				else{//Don't increase dependencies_found_entry.second.second i.e. the counter for expected dependencies to be found as nothing is expected to be found for an optional dependency
					if(dependencies_found_entry!=dependencies_found.end()){
						//No manner condition was fulfilled, nothing to add
					}
					else{
						dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(node_d_key.c_str())),std::make_tuple(std::string(),0,0,0,0)));
					}
				}
				if(dependencies_found_via_optional_paths.empty()==true||path_nr>dependencies_found_via_optional_paths.rbegin()->first){
					//If no real dependency was found on the path branching from this optional dependency,
					//delete this optional dependency from the list of odeps that are part of a path
					//that leads to a real dependency.
					for(auto&& i=optional_dependencies_checked.lower_bound(std::make_pair(functor,std::atoi(d_key.c_str())));
							i!=optional_dependencies_checked.upper_bound(std::make_pair(functor,std::atoi(d_key.c_str())));){
						if(std::get<4>(i->second)==odep_level){
							logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"deleting optional dependency with functor "+i->first.first+" and d_key "+std::to_string(i->first.second));
							i=optional_dependencies_checked.erase(i);
						}
						else{
							++i;
						}
					}
				}
			}
			else if(semantic_dependency.empty()==true&&ref_d_key.empty()==true){
				//A leaf in the dependency tree is found so the semantic dependency is empty. As such, there's no
				//functor-dependency pair to be checked in the dep.vld.matrix so let's go on with the next dependency.
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"leaf dependency "+semantic_dependency+" checked for functor "+functor+" and has no further dependency");
				dependencies_found_entry=dependencies_found.find(std::make_pair(node_id,std::atoi(node_d_key.c_str())));
				if(dependencies_found_entry!=dependencies_found.end()){
					//Don't increase the number of dependencies (++dependencies_found_entry->second;), NULL dependency is considered as found but not counted
					//dependency_found_for_functor=true;//TODO: consider if setting this flag is ok here or should it be set to true anyway for leaves?
				}
				else{
					dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(node_d_key.c_str())),std::make_tuple(std::string(),0,0,0,0)));
					//dependency_found_for_functor=false;//TODO: consider if setting this flag is ok here or should it be set to true anyway for leaves?
				}
				dependency_found_for_functor=true;
			}
			else{
				throw std::runtime_error("Inconsistent setup of manner, semantic_dependency and ref_d_key for lexeme "+functor+", d_key "+d_key+" and d_counter "+d_counter+" in DEPOLEX db table.");
			}
		}
		else{
			++nr_of_skipped_opa_rules;
		}
		depolex_entry=followup_dependency(depolex_entry->first,functor,d_key,dependency_found_for_functor,*node.expression.dependencies);
	}
	if(nr_of_rules>0&&nr_of_rules==nr_of_skipped_opa_rules){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dependency "+semantic_dependency+" checked for functor "+functor+" but has no further dependency");
		dependencies_found_entry=dependencies_found.find(std::make_pair(node_id,std::atoi(node_d_key.c_str())));
		if(dependencies_found_entry!=dependencies_found.end()){
			//Don't increase the number of dependencies as earlier:
			//++dependencies_found_entry->second.first;
			//++dependencies_found_entry->second.second;
			//as NULL dependency is considered as found but not counted
		}
		else{
			dependencies_found.insert(std::make_pair(std::make_pair(node_id,std::atoi(node_d_key.c_str())),std::make_tuple(std::string(),0,0,0,0)));
		}
	}
}

unsigned int interpreter::nr_of_dependencies_to_be_found(){
	unsigned int nr_of_non_ref_leafs=0;
	db *sqlite=NULL;
	query_result *gcats=NULL;

	sqlite=db_factory::get_instance();
	gcats=sqlite->exec_sql("SELECT DISTINCT GCAT FROM GCAT;");
	if(gcats==NULL){
		throw std::runtime_error("GCAT db table is empty.");
	}
	for(auto&& i:node_infos){
		if(i.expression.lexeme.empty()==false&&i.ref_node_ids.empty()==true&&gcats->first_value_for_field_name_found("gcat",i.expression.gcat)!=NULL){
			++nr_of_non_ref_leafs;
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"Dependency to be found:"+i.expression.lexeme);
		}
	}
	delete gcats;
	return nr_of_non_ref_leafs;
}

transgraph* interpreter::longest_match_for_semantic_rules_found(std::multimap<std::pair<unsigned int,unsigned int>,std::string>& dependencies_not_found){
	t_map_of_node_ids_and_d_keys_to_nr_of_deps dependencies_found;
	std::multimap<std::pair<std::string,unsigned int>,std::tuple<std::string,unsigned int,unsigned int,unsigned int,unsigned int,unsigned int> > optional_dependencies_checked;
	std::vector<unsigned int> verbs_found;
	std::map<unsigned int,std::pair<unsigned int,unsigned int> > map_of_node_ids_to_total_nr_of_deps_and_d_key;
	std::map<unsigned int,std::pair<unsigned int,unsigned int> >::iterator node_id_with_longest_match_and_d_key;
	std::set<unsigned int> nodes_to_be_validated;
	unsigned int nr_of_dependencies_found=0,total_nr_of_dependencies=0,d_key=0,min_nr_of_deps=0;
	t_node_dependency_traversal *node_dependency_traversal=NULL;
	t_pair_of_node_id_and_d_key_with_nr_of_deps *node_id_and_d_key_with_nr_of_deps=NULL;
	std::pair<p_m1_node_id_m2_d_key,t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter> functor_found;
	std::map<p_m1_node_id_m2_d_key,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,std::map<unsigned int,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,unsigned int> > > > longest_traversals;
	db *sqlite=NULL;
	query_result *result=NULL;
	std::map<unsigned int,bool> empty_ref_node_id_parents;

	//TODO: add an entry in the symbols table for the symbol main_verb
	//and think over how to make it customizable for different languages
	sqlite=db_factory::get_instance();
	result=sqlite->exec_sql("SELECT * FROM SETTINGS WHERE key='main_symbol';");
	if(result==NULL) throw std::runtime_error("No main symbol is set up in settings table.");
	std::string main_symbol=*result->field_value_at_row_position(0,"value");
	delete result;
	const node_info& root_node=get_node_info(nr_of_nodes_);
	get_nodes_by_symbol(root_node,main_symbol,std::string(),empty_ref_node_id_parents,verbs_found);
	if(verbs_found.size()==1){
		const node_info& node=get_node_info(*verbs_found.begin());
		find_dependencies_for_node(node.node_id,dependencies_found,optional_dependencies_checked,dependencies_not_found);
		functor_found=calculate_longest_matching_dependency_route(longest_traversals);
		d_key=functor_found.first.second;
		//TODO: min nr of deps is shown differently here than in calculate_longest_matching_dependency_route
		//in case of e.g. the first dependency is not found as in "list peter" instead of "list contacts" on android
		min_nr_of_deps=std::get<2>(functor_found.second);
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"Minimum number of dependencies to match:"+std::to_string(min_nr_of_deps));
		nr_of_dependencies_found=std::get<1>(functor_found.second);
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"Matching nr of dependencies found for functor "+node.expression.lexeme+" with d_key "+std::to_string(d_key)+":"+std::to_string(nr_of_dependencies_found));
		total_nr_of_dependencies=nr_of_dependencies_to_be_found()-1;
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"Total number of dependencies:"+std::to_string(total_nr_of_dependencies));
		if(node.expression.dependencies!=NULL&&nr_of_dependencies_found>=min_nr_of_deps){
			//The original condition if(nr_of_dependencies_found==total_nr_of_dependencies&&nr_of_dependencies_found>=min_nr_of_deps)
			//seems to be too strict as it requires that all dependencies need to be found.
			//Made it looser due to enabling partial analysis to experiment with this condition and see if it fits the bill.
			if(nr_of_dependencies_found!=total_nr_of_dependencies||nr_of_dependencies_found<min_nr_of_deps)
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"Not all dependencies have been found for functor "+node.expression.lexeme);
			return build_transgraph(functor_found.first,std::make_pair(std::to_string(functor_found.first.first),functor_found.first.second),longest_traversals);
		}
		else{
			logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"No matching nr of dependencies found for functor "+node.expression.lexeme+" with any d_key");
			return NULL;
		}
	}
	else{
		if(verbs_found.size()==0)
			throw std::runtime_error("No main verb found.");
		else
			throw std::runtime_error("More than one main verb found.");
	}
}

std::pair<p_m1_node_id_m2_d_key,t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter> interpreter::calculate_longest_matching_dependency_route(std::map<p_m1_node_id_m2_d_key,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,std::map<unsigned int,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,unsigned int> > > >& longest_traversals){
	unsigned int node_level=1;
	t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter nr_of_deps;
	p_m1_node_id_m2_d_key functor_node;
	std::pair<p_m1_node_id_m2_d_key,t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter> functor_found;
	std::map<unsigned int,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,unsigned int> > map_of_node_ids_to_total_nr_of_deps_and_d_key;

	for(auto&& i:node_dependency_traversal_stack_tree){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"tree level: "+std::to_string(i.first.first));
		if(i.first.first==node_level){
			std::get<1>(nr_of_deps)=0;
			std::get<2>(nr_of_deps)=0;
			functor_node=i.first.second;
			map_of_node_ids_to_total_nr_of_deps_and_d_key.clear();
			calculate_longest_matching_dependency_route(node_level,functor_node,map_of_node_ids_to_total_nr_of_deps_and_d_key);
			logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"dependencies with longest match:");
			for(auto&& i:map_of_node_ids_to_total_nr_of_deps_and_d_key){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"functor "+get_node_info(i.first).expression.lexeme+" d_key "+std::to_string(i.second.second)+": "+std::to_string(std::get<1>(i.second.first))+" deps found out of the expected "+std::to_string(std::get<2>(i.second.first))+" deps to be found");
				std::get<1>(nr_of_deps)+=std::get<1>(i.second.first);
				std::get<2>(nr_of_deps)+=std::get<2>(i.second.first);
			}
			longest_traversals.insert(std::make_pair(functor_node,std::make_pair(nr_of_deps,map_of_node_ids_to_total_nr_of_deps_and_d_key)));
		}
	}
	std::get<1>(functor_found.second)=0;
	std::get<2>(functor_found.second)=0;
	functor_found.first.first=0;
	functor_found.first.second=0;
	for(auto&& i:longest_traversals){
	//TODO: two interpretations with the same number of deps must not be allowed.
	//The only exception is when the scripts behind the functors are the same.
	//This logic is missing though here.
		if(functor_found.first.first==0&&functor_found.first.second==0||std::get<1>(i.second.first)>std::get<1>(functor_found.second)){
			functor_found.first=i.first;
			functor_found.second=i.second.first;
		}
	}
	return functor_found;
}

void interpreter::calculate_longest_matching_dependency_route(const unsigned int node_level, const p_m1_node_id_m2_d_key& functor_node,
		std::map<unsigned int,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,unsigned int> >& map_of_node_ids_to_total_nr_of_deps_and_d_key){
	p_m1_tree_level_m2_p_m1_node_id_m2_d_key tree_level_and_functor_node;
	std::map<p_m1_tree_level_m2_p_m1_node_id_m2_d_key,std::vector<p_m1_node_id_m2_d_key> >::const_iterator functor_node_found;
	std::map<unsigned int,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,unsigned int> >::iterator node_id_with_longest_match_and_d_key;
	std::set<unsigned int> nodes_to_be_validated;
	t_node_dependency_traversals::const_iterator functor_node_dependencies;
	t_node_dependency_traversal *node_dependency_traversal=NULL;
	t_pair_of_node_id_and_d_key_with_nr_of_deps *node_id_and_d_key_with_nr_of_deps=NULL;

	tree_level_and_functor_node.first=node_level;
	tree_level_and_functor_node.second=functor_node;
	functor_node_found=node_dependency_traversal_stack_tree.find(tree_level_and_functor_node);
	if(functor_node_found==node_dependency_traversal_stack_tree.end()){
		throw std::runtime_error("Functor node not found in node dependency traversal stack tree.");
	}
	functor_node_dependencies=node_dependency_traversals.find(functor_node);
	if(functor_node_dependencies==node_dependency_traversals.end()){
		throw std::runtime_error("Functor node dependencies not found in node dependency traversals.");
	}
	//1) loop over functor_node_dependencies.map_of_node_ids_and_d_keys_to_nr_of_deps to get the longest matching deps and sum them up
	node_dependency_traversal=new t_node_dependency_traversal(functor_node_dependencies);
	for(t_map_of_node_ids_and_d_keys_to_nr_of_deps::const_iterator i=node_dependency_traversal->map_of_node_ids_and_d_keys_to_nr_of_deps.begin();
			i!=node_dependency_traversal->map_of_node_ids_and_d_keys_to_nr_of_deps.end();++i){
		node_id_and_d_key_with_nr_of_deps=new t_pair_of_node_id_and_d_key_with_nr_of_deps(i);
		//TODO1a: think over if a local, initially empty map_of_node_ids_to_total_nr_of_deps_and_d_key shall be used
		//in the loop and before returning, the result of it shall be merged with the content of the incoming one.
		if(map_of_node_ids_to_total_nr_of_deps_and_d_key.find(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first)==map_of_node_ids_to_total_nr_of_deps_and_d_key.end()
			&&nodes_to_be_validated.find(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first)==nodes_to_be_validated.end()){
			nodes_to_be_validated.insert(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first);
		}
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"for node id "+std::to_string(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first)+" with functor "+get_node_info(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first).expression.lexeme
		+" and d_key "+std::to_string(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.second)+" the nr_of_dependencies_found is: "+std::to_string(std::get<1>(node_id_and_d_key_with_nr_of_deps->nr_of_deps)));
		node_id_with_longest_match_and_d_key=map_of_node_ids_to_total_nr_of_deps_and_d_key.find(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first);
		if(node_id_with_longest_match_and_d_key!=map_of_node_ids_to_total_nr_of_deps_and_d_key.end()){
			if(std::get<1>(node_id_with_longest_match_and_d_key->second.first)<std::get<1>(node_id_and_d_key_with_nr_of_deps->nr_of_deps)){
				node_id_with_longest_match_and_d_key->second.first=node_id_and_d_key_with_nr_of_deps->nr_of_deps;
				node_id_with_longest_match_and_d_key->second.second=node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.second;
			}
			else if(std::get<1>(node_id_with_longest_match_and_d_key->second.first)>0&&std::get<1>(node_id_with_longest_match_and_d_key->second.first)==std::get<1>(node_id_and_d_key_with_nr_of_deps->nr_of_deps)){
				throw std::runtime_error("Ambiguous interpretations found. Sorry, can't handle that yet.");
			}
		}
		else{
			map_of_node_ids_to_total_nr_of_deps_and_d_key.insert(std::make_pair(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first,std::make_pair(node_id_and_d_key_with_nr_of_deps->nr_of_deps,node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.second)));
			nodes_to_be_validated.erase(node_id_and_d_key_with_nr_of_deps->node_id_and_d_key.first);
		}
		delete node_id_and_d_key_with_nr_of_deps;
		node_id_and_d_key_with_nr_of_deps=NULL;
	}
	delete node_dependency_traversal;
	node_dependency_traversal=NULL;
	if(nodes_to_be_validated.empty()==false){
		throw std::runtime_error("Sanity check failed for having all nodes to be validated processed.");
	}
	//2) loop over functor_node_found.second (vector of children) and call recursively for each the method itself
	for(auto&& i:functor_node_found->second){
		//TODO1b: (corollary of TODO1a) think over if the local or the incoming
		//map_of_node_ids_to_total_nr_of_deps_and_d_key shall be passed over here
		calculate_longest_matching_dependency_route(node_level+1,i,map_of_node_ids_to_total_nr_of_deps_and_d_key);
	}
}

unsigned int interpreter::is_valid_combination(const std::string& symbol, const node_info& new_phrase_head_root_ref, const node_info& new_phrase_non_head_root_ref){
	bool valid_combination=false;
	db *sqlite=NULL;
	query_result *rule_to_rule_map=NULL;
	std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> > *functors_found=NULL;
	std::multimap<unsigned int,unsigned int>::const_iterator l;
	std::vector<unsigned int>::const_iterator j,k;
	std::vector<unsigned int> main_nodes_found_by_symbol,dependent_nodes_found_by_symbol,main_subtree_nodes_found_by_symbol,dependency_subtree_nodes_found_by_symbol,prev_main_nodes_found_by_symbol,prev_dependent_nodes_found_by_symbol;
	const std::pair<const unsigned int,field> *rule_entry=NULL,*rule_entry_failure_copy=NULL;
	unsigned int current_step=0,successor=0,failover=0,main_node_id=0,dep_node_id=0,rule_step_failed=0,main_set_op=0,dependent_set_op=0;
	std::multimap<unsigned int,std::pair<unsigned int,unsigned int> > functors_validated_for_nodes;
	node_info *main_node=NULL,*dependent_node=NULL;
	std::multimap<unsigned int,unsigned int> ref_node_ids_to_set;
	std::set<unsigned int>::const_iterator main_ref_node_id,dep_ref_node_id;
	std::map<unsigned int,bool> main_ref_node_id_parents,dep_ref_node_id_parents,empty_ref_node_id_parents;
	std::string main_node_symbol,dependent_node_symbol,prev_main_node_symbol,prev_dependent_node_symbol;
	std::map<unsigned int,std::vector<unsigned int>> main_node_id_to_node_ids_found_by_symbol,prev_main_node_id_to_node_ids_found_by_symbol,dependent_node_id_to_node_ids_found_by_symbol,prev_dependent_node_id_to_node_ids_found_by_symbol;

	sqlite=db_factory::get_instance();
	rule_to_rule_map=sqlite->exec_sql("SELECT * FROM RULE_TO_RULE_MAP WHERE PARENT_SYMBOL = '"+symbol+"' AND HEAD_ROOT_SYMBOL = '"+new_phrase_head_root_ref.symbol+"' AND NON_HEAD_ROOT_SYMBOL = '"+new_phrase_non_head_root_ref.symbol+"' ORDER BY STEP;");
	if(rule_to_rule_map==NULL){
		throw std::runtime_error("No entries found for parent symbol "+symbol+", head root symbol "+new_phrase_head_root_ref.symbol+" and non-head root symbol "+new_phrase_non_head_root_ref.symbol+" in RULE_TO_RULE_MAP db table.");
	}
	rule_entry=rule_to_rule_map->first_value_for_field_name_found("step","1");
	while(rule_entry!=NULL){
		node_info new_phrase_head_root=get_private_node_info(new_phrase_head_root_ref.node_id);
		node_info new_phrase_non_head_root=get_private_node_info(new_phrase_non_head_root_ref.node_id);
		valid_combination=false;
		rule_entry_failure_copy=rule_entry;
		prev_main_node_symbol=main_node_symbol;
		prev_dependent_node_symbol=dependent_node_symbol;
		main_node_symbol=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_symbol");
		dependent_node_symbol=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"dependent_node_symbol");
		current_step=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"step")->c_str());
		failover=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"failover")->c_str());
		successor=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"successor")->c_str());
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"step:"+std::to_string(current_step)+" failover:"+std::to_string(failover)+" successor:"+std::to_string(successor));
		std::string head_root_symbol=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"head_root_symbol");
		std::string non_head_root_symbol=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"non_head_root_symbol");
		std::string main_lookup_root=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_lookup_root");
		std::string main_ref_parents=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_ref_parents");
		std::string main_lookup_subtree_symbol=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_lookup_subtree_symbol");
		std::string main_node_lexeme=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_node_lexeme");
		std::string dependency_lookup_root=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"dependency_lookup_root");
		std::string dependency_ref_parents=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"dependency_ref_parents");
		std::string dependency_lookup_subtree_symbol=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"dependency_lookup_subtree_symbol");
		std::string dependent_node_lexeme=*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"dependent_node_lexeme");

		main_set_op=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"main_set_op")->c_str());
		dependent_set_op=std::atoi(rule_to_rule_map->field_value_at_row_position(rule_entry->first,"dependent_set_op")->c_str());
		if(current_step>1&&main_set_op>0&&main_node_symbol.empty()==false&&main_node_symbol==prev_main_node_symbol&&main_node_id_to_node_ids_found_by_symbol.empty()==false){
			prev_main_node_id_to_node_ids_found_by_symbol=main_node_id_to_node_ids_found_by_symbol;
			if(dependent_node_symbol.empty()==true){
				prev_dependent_node_id_to_node_ids_found_by_symbol=dependent_node_id_to_node_ids_found_by_symbol;
			}
		}
		else prev_main_node_id_to_node_ids_found_by_symbol.clear();
		if(current_step>1&&dependent_set_op>0&&dependent_node_symbol.empty()==false&&dependent_node_symbol==prev_dependent_node_symbol&&dependent_node_id_to_node_ids_found_by_symbol.empty()==false){
			prev_dependent_node_id_to_node_ids_found_by_symbol=dependent_node_id_to_node_ids_found_by_symbol;
			if(main_node_symbol.empty()==true){
				prev_main_node_id_to_node_ids_found_by_symbol=main_node_id_to_node_ids_found_by_symbol;
			}
		}
		else prev_dependent_node_id_to_node_ids_found_by_symbol.clear();
		main_node_id_to_node_ids_found_by_symbol.clear();
		main_nodes_found_by_symbol.clear();
		dependent_node_id_to_node_ids_found_by_symbol.clear();
		dependent_nodes_found_by_symbol.clear();
		main_subtree_nodes_found_by_symbol.clear();
		dependency_subtree_nodes_found_by_symbol.clear();
		if(head_root_symbol==new_phrase_head_root.symbol&&non_head_root_symbol==new_phrase_non_head_root.symbol){
			if(main_node_symbol.empty()==false){
				std::map<unsigned int,bool> ref_node_id_parents;
				if(main_ref_parents=="M"){
					ref_node_id_parents=main_ref_node_id_parents;
				}
				else if(main_ref_parents=="D"){
					ref_node_id_parents=dep_ref_node_id_parents;
				}
				if(main_lookup_root=="H"||main_lookup_root=="HC"){
					if(new_phrase_head_root.ref_to_context==true){
						if(main_lookup_subtree_symbol.empty()==true){
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								main_nodes_found_by_symbol.clear();
								if(main_lookup_root=="HC"){
									//get_nodes_by_symbol(head_context_node,main_node_symbol,main_node_lexeme,ref_node_id_parents,main_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,main_node_symbol,main_node_lexeme,ref_node_id_parents,main_nodes_found_by_symbol);
								}
								else{
									//get_nodes_by_symbol(head_context_node,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
								if(main_nodes_found_by_symbol.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,main_nodes_found_by_symbol));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,main_nodes_found_by_symbol));
								}
							//}
						}
						else{
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								main_nodes_found_by_symbol.clear();
								main_subtree_nodes_found_by_symbol.clear();
								if(main_lookup_root=="HC"){
									//get_nodes_by_symbol(head_context_node,main_lookup_subtree_symbol,std::string(),ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,main_lookup_subtree_symbol,std::string(),ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
									}
								}
								else{
									//get_nodes_by_symbol(head_context_node,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
									}
								}
								if(main_nodes_found_by_symbol.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,main_nodes_found_by_symbol));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,main_nodes_found_by_symbol));
								}
							//}
						}
					}
					else{
						if(main_lookup_subtree_symbol.empty()==true)
							if(main_lookup_root=="HC"){
								get_nodes_by_symbol(new_phrase_head_root,main_node_symbol,main_node_lexeme,ref_node_id_parents,main_nodes_found_by_symbol);
							}
							else{
								get_nodes_by_symbol(new_phrase_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
							}
						else{
							if(main_lookup_root=="HC"){
								get_nodes_by_symbol(new_phrase_head_root,main_lookup_subtree_symbol,std::string(),ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
							}
							else{
								get_nodes_by_symbol(new_phrase_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
							}
						}
						if(main_nodes_found_by_symbol.empty()==false){
							main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,main_nodes_found_by_symbol));
						}
					}
				}
				else if(main_lookup_root=="N"||main_lookup_root=="NC"){
					if(new_phrase_non_head_root.ref_to_context==true){
						if(main_lookup_subtree_symbol.empty()==true){
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								main_nodes_found_by_symbol.clear();
								if(main_lookup_root=="NC"){
									//get_nodes_by_symbol(non_head_context_node,main_node_symbol,main_node_lexeme,ref_node_id_parents,main_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,main_node_symbol,main_node_lexeme,ref_node_id_parents,main_nodes_found_by_symbol);
								}
								else{
									//get_nodes_by_symbol(non_head_context_node,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
								if(main_nodes_found_by_symbol.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,main_nodes_found_by_symbol));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,main_nodes_found_by_symbol));
								}
							//}
						}
						else{
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								main_nodes_found_by_symbol.clear();
								main_subtree_nodes_found_by_symbol.clear();
								if(main_lookup_root=="NC"){
									//get_nodes_by_symbol(non_head_context_node,main_lookup_subtree_symbol,std::string(),ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,main_lookup_subtree_symbol,std::string(),ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
									}
								}
								else{
									//get_nodes_by_symbol(non_head_context_node,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
									for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
									}
								}
								if(main_nodes_found_by_symbol.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,main_nodes_found_by_symbol));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,main_nodes_found_by_symbol));
								}
							//}
						}
					}
					else{
						if(main_lookup_subtree_symbol.empty()==true)
							if(main_lookup_root=="NC"){
								get_nodes_by_symbol(new_phrase_non_head_root,main_node_symbol,main_node_lexeme,ref_node_id_parents,main_nodes_found_by_symbol);
							}
							else{
								get_nodes_by_symbol(new_phrase_non_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
							}
						else{
							if(main_lookup_root=="NC"){
								get_nodes_by_symbol(new_phrase_non_head_root,main_lookup_subtree_symbol,std::string(),ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
							}
							else{
								get_nodes_by_symbol(new_phrase_non_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
							}
						}
						if(main_nodes_found_by_symbol.empty()==false){
							main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,main_nodes_found_by_symbol));
						}
					}
				}
				else{
					if(main_lookup_subtree_symbol.empty()==true){
						if(new_phrase_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								std::vector<unsigned int> main_nodes_found_by_symbol_for_ctx;
								//get_nodes_by_symbol(head_context_node,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol_for_ctx);
								get_nodes_by_symbol(new_phrase_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol_for_ctx);
								if(main_nodes_found_by_symbol_for_ctx.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,main_nodes_found_by_symbol_for_ctx));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,main_nodes_found_by_symbol_for_ctx));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
							if(main_nodes_found_by_symbol.empty()==false){
								main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,main_nodes_found_by_symbol));
							}
						}
						main_nodes_found_by_symbol.clear();
						if(new_phrase_non_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								std::vector<unsigned int> main_nodes_found_by_symbol_for_ctx;
								//get_nodes_by_symbol(non_head_context_node,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol_for_ctx);
								get_nodes_by_symbol(new_phrase_non_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol_for_ctx);
								if(main_nodes_found_by_symbol_for_ctx.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,main_nodes_found_by_symbol_for_ctx));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,main_nodes_found_by_symbol_for_ctx));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_non_head_root,main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
							if(main_nodes_found_by_symbol.empty()==false){
								main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,main_nodes_found_by_symbol));
							}
						}
						main_nodes_found_by_symbol.clear();
					}
					else{
						if(new_phrase_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								main_nodes_found_by_symbol.clear();
								main_subtree_nodes_found_by_symbol.clear();
								//get_nodes_by_symbol(head_context_node,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								get_nodes_by_symbol(new_phrase_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
								if(main_nodes_found_by_symbol.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,main_nodes_found_by_symbol));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,main_nodes_found_by_symbol));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
							for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
								get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
							}
							if(main_nodes_found_by_symbol.empty()==false){
								main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,main_nodes_found_by_symbol));
							}
						}
						main_nodes_found_by_symbol.clear();
						main_subtree_nodes_found_by_symbol.clear();
						if(new_phrase_non_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								main_nodes_found_by_symbol.clear();
								main_subtree_nodes_found_by_symbol.clear();
								//get_nodes_by_symbol(non_head_context_node,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								get_nodes_by_symbol(new_phrase_non_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
								for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
								}
								if(main_nodes_found_by_symbol.empty()==false){
									//main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,main_nodes_found_by_symbol));
									main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,main_nodes_found_by_symbol));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_non_head_root,main_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,main_subtree_nodes_found_by_symbol);
							for(auto&& main_subtree_node:main_subtree_nodes_found_by_symbol){
								get_nodes_by_symbol(get_node_info(main_subtree_node),main_node_symbol,main_node_lexeme,empty_ref_node_id_parents,main_nodes_found_by_symbol);
							}
							if(main_nodes_found_by_symbol.empty()==false){
								main_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,main_nodes_found_by_symbol));
							}
						}
						main_nodes_found_by_symbol.clear();
						main_subtree_nodes_found_by_symbol.clear();
					}
				}
			}
			if(dependent_node_symbol.empty()==false){
				std::map<unsigned int,bool> ref_node_id_parents;
				if(dependency_ref_parents=="M"){
					ref_node_id_parents=main_ref_node_id_parents;
				}
				else if(dependency_ref_parents=="D"){
					ref_node_id_parents=dep_ref_node_id_parents;
				}
				if(dependency_lookup_root=="H"||dependency_lookup_root=="HC"){
					if(new_phrase_head_root.ref_to_context==true){
						if(dependency_lookup_subtree_symbol.empty()==true){
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								dependent_nodes_found_by_symbol.clear();
								if(dependency_lookup_root=="HC"){
									//get_nodes_by_symbol(head_context_node,dependent_node_symbol,dependent_node_lexeme,ref_node_id_parents,dependent_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,dependent_node_symbol,dependent_node_lexeme,ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
								else{
									//get_nodes_by_symbol(head_context_node,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
								if(dependent_nodes_found_by_symbol.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,dependent_nodes_found_by_symbol));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,dependent_nodes_found_by_symbol));
								}
							//}
						}
						else{
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								dependent_nodes_found_by_symbol.clear();
								dependency_subtree_nodes_found_by_symbol.clear();
								if(dependency_lookup_root=="HC"){
									//get_nodes_by_symbol(head_context_node,dependency_lookup_subtree_symbol,std::string(),ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,dependency_lookup_subtree_symbol,std::string(),ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
									}
								}
								else{
									//get_nodes_by_symbol(head_context_node,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
									}
								}
								if(dependent_nodes_found_by_symbol.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,dependent_nodes_found_by_symbol));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,dependent_nodes_found_by_symbol));
								}
							//}
						}
					}
					else{
						if(dependency_lookup_subtree_symbol.empty()==true)
							if(dependency_lookup_root=="HC"){
								get_nodes_by_symbol(new_phrase_head_root,dependent_node_symbol,dependent_node_lexeme,ref_node_id_parents,dependent_nodes_found_by_symbol);
							}
							else{
								get_nodes_by_symbol(new_phrase_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
							}
						else{
							if(dependency_lookup_root=="HC"){
								get_nodes_by_symbol(new_phrase_head_root,dependency_lookup_subtree_symbol,std::string(),ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
							}
							else{
								get_nodes_by_symbol(new_phrase_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
							}
						}
						if(dependent_nodes_found_by_symbol.empty()==false){
							dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,dependent_nodes_found_by_symbol));
						}
					}
				}
				else if(dependency_lookup_root=="N"||dependency_lookup_root=="NC"){
					if(new_phrase_non_head_root.ref_to_context==true){
						if(dependency_lookup_subtree_symbol.empty()==true){
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								dependent_nodes_found_by_symbol.clear();
								if(dependency_lookup_root=="NC"){
									//get_nodes_by_symbol(non_head_context_node,dependent_node_symbol,dependent_node_lexeme,ref_node_id_parents,dependent_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,dependent_node_symbol,dependent_node_lexeme,ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
								else{
									//get_nodes_by_symbol(non_head_context_node,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
								if(dependent_nodes_found_by_symbol.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,dependent_nodes_found_by_symbol));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,dependent_nodes_found_by_symbol));
								}
							//}
						}
						else{
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								dependent_nodes_found_by_symbol.clear();
								dependency_subtree_nodes_found_by_symbol.clear();
								if(dependency_lookup_root=="NC"){
									//get_nodes_by_symbol(non_head_context_node,dependency_lookup_subtree_symbol,std::string(),ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,dependency_lookup_subtree_symbol,std::string(),ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
									}
								}
								else{
									//get_nodes_by_symbol(non_head_context_node,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									get_nodes_by_symbol(new_phrase_non_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
									for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
										get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
									}
								}
								if(dependent_nodes_found_by_symbol.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,dependent_nodes_found_by_symbol));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,dependent_nodes_found_by_symbol));
								}
							//}
						}
					}
					else{
						if(dependency_lookup_subtree_symbol.empty()==true)
							if(dependency_lookup_root=="NC"){
								get_nodes_by_symbol(new_phrase_non_head_root,dependent_node_symbol,dependent_node_lexeme,ref_node_id_parents,dependent_nodes_found_by_symbol);
							}
							else{
								get_nodes_by_symbol(new_phrase_non_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
							}
						else{
							if(dependency_lookup_root=="NC"){
								get_nodes_by_symbol(new_phrase_non_head_root,dependency_lookup_subtree_symbol,std::string(),ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
							}
							else{
								get_nodes_by_symbol(new_phrase_non_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
							}
						}
						if(dependent_nodes_found_by_symbol.empty()==false){
							dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,dependent_nodes_found_by_symbol));
						}
					}
				}
				else{
					if(dependency_lookup_subtree_symbol.empty()==true){
						if(new_phrase_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								std::vector<unsigned int> dependent_nodes_found_by_symbol_for_ctx;
								//get_nodes_by_symbol(head_context_node,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol_for_ctx);
								get_nodes_by_symbol(new_phrase_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol_for_ctx);
								if(dependent_nodes_found_by_symbol_for_ctx.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,dependent_nodes_found_by_symbol_for_ctx));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,dependent_nodes_found_by_symbol_for_ctx));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
							if(dependent_nodes_found_by_symbol.empty()==false){
								dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,dependent_nodes_found_by_symbol));
							}
						}
						if(new_phrase_non_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								std::vector<unsigned int> dependent_nodes_found_by_symbol_for_ctx;
								//get_nodes_by_symbol(non_head_context_node,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol_for_ctx);
								get_nodes_by_symbol(new_phrase_non_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol_for_ctx);
								if(dependent_nodes_found_by_symbol_for_ctx.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,dependent_nodes_found_by_symbol_for_ctx));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,dependent_nodes_found_by_symbol_for_ctx));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_non_head_root,dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
							if(dependent_nodes_found_by_symbol.empty()==false){
								dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,dependent_nodes_found_by_symbol));
							}
						}
					}
					else{
						if(new_phrase_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_head_root.ref_node_ids){
								//node_info head_context_node=get_node_info(i);
								dependent_nodes_found_by_symbol.clear();
								dependency_subtree_nodes_found_by_symbol.clear();
								//get_nodes_by_symbol(head_context_node,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								get_nodes_by_symbol(new_phrase_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
								if(dependent_nodes_found_by_symbol.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(head_context_node.node_id,dependent_nodes_found_by_symbol));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,dependent_nodes_found_by_symbol));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
							for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
								get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
							}
							if(dependent_nodes_found_by_symbol.empty()==false){
								dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_head_root.node_id,dependent_nodes_found_by_symbol));
							}
						}
						dependent_nodes_found_by_symbol.clear();
						dependency_subtree_nodes_found_by_symbol.clear();
						if(new_phrase_non_head_root.ref_to_context==true){
							//for(unsigned int i:new_phrase_non_head_root.ref_node_ids){
								//node_info non_head_context_node=get_node_info(i);
								dependent_nodes_found_by_symbol.clear();
								dependency_subtree_nodes_found_by_symbol.clear();
								//get_nodes_by_symbol(non_head_context_node,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								get_nodes_by_symbol(new_phrase_non_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
								for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
									get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
								}
								if(dependent_nodes_found_by_symbol.empty()==false){
									//dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(non_head_context_node.node_id,dependent_nodes_found_by_symbol));
									dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,dependent_nodes_found_by_symbol));
								}
							//}
						}
						else{
							get_nodes_by_symbol(new_phrase_non_head_root,dependency_lookup_subtree_symbol,std::string(),empty_ref_node_id_parents,dependency_subtree_nodes_found_by_symbol);
							for(auto&& dependency_subtree_node:dependency_subtree_nodes_found_by_symbol){
								get_nodes_by_symbol(get_node_info(dependency_subtree_node),dependent_node_symbol,dependent_node_lexeme,empty_ref_node_id_parents,dependent_nodes_found_by_symbol);
							}
							if(dependent_nodes_found_by_symbol.empty()==false){
								dependent_node_id_to_node_ids_found_by_symbol.insert(std::make_pair(new_phrase_non_head_root.node_id,dependent_nodes_found_by_symbol));
							}
						}
						dependent_nodes_found_by_symbol.clear();
						dependency_subtree_nodes_found_by_symbol.clear();
					}
				}
			}
			if(main_set_op>0){
				combine_sets(main_set_op,prev_main_node_id_to_node_ids_found_by_symbol,main_node_id_to_node_ids_found_by_symbol);
			}
			if(dependent_set_op>0){
				combine_sets(dependent_set_op,prev_dependent_node_id_to_node_ids_found_by_symbol,dependent_node_id_to_node_ids_found_by_symbol);
			}
			if(main_node_symbol.empty()==false
				&&dependent_node_symbol.empty()==false
				&&main_node_id_to_node_ids_found_by_symbol.empty()==false
				&&dependent_node_id_to_node_ids_found_by_symbol.empty()==false){
				std::map<unsigned int,bool> new_main_ref_node_id_parents;
				std::map<unsigned int,bool> new_dep_ref_node_id_parents;
				for(auto m:main_node_id_to_node_ids_found_by_symbol){
					main_nodes_found_by_symbol=m.second;
					//1)Loop over main_nodes_found_by_symbol
					for(j=main_nodes_found_by_symbol.begin();j!=main_nodes_found_by_symbol.end();++j){
						logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"loop pass on main_nodes_found_by_symbol:"+std::to_string(*j));
						main_node=&get_private_node_info(*j);
						logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"main node lexeme:"+main_node->expression.lexeme);
						if(main_node->ref_node_ids.empty()==true) main_node_id=main_node->node_id;
						else{
							main_ref_node_id=main_node->ref_node_ids.begin();
							main_node_id=*main_ref_node_id;
						}
						while(main_node_id!=0){
							node_info *main_or_ref_node=&get_private_node_info(main_node_id);
							logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"main node refnode lexeme:"+main_or_ref_node->expression.lexeme);
							for(auto d:dependent_node_id_to_node_ids_found_by_symbol){
								dependent_nodes_found_by_symbol=d.second;
								//2)Loop over dependent_nodes_found_by_symbol where dependent_node is NOT in current_main_node.node_links
								for(k=dependent_nodes_found_by_symbol.begin();k!=dependent_nodes_found_by_symbol.end();++k){
									logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"loop pass on dependent_nodes_found_by_symbol:"+std::to_string(*k));
									dependent_node=&get_private_node_info(*k);
									logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"dependent node lexeme:"+dependent_node->expression.lexeme);
									if(dependent_node->ref_node_ids.empty()==true) dep_node_id=dependent_node->node_id;
									else{
										dep_ref_node_id=dependent_node->ref_node_ids.begin();
										dep_node_id=*dep_ref_node_id;
									}
									while(dep_node_id!=0){
										main_or_ref_node=&get_private_node_info(main_node_id);//Get main_or_ref_node again as node_infos may have been added new nodes which invalidates pointers to elements
										node_info *dependent_or_ref_node=&get_private_node_info(dep_node_id);
										logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"dependent node refnode lexeme:"+dependent_or_ref_node->expression.lexeme);
										for(l=main_or_ref_node->dependency_validation_matrix.begin();l!=main_or_ref_node->dependency_validation_matrix.end();++l){
											//TODO:Consider if this logic is ok:
											//If a node is already registered in the main nodes's dvm for a dependency,
											//don't give a chance to register it for another dependency as well.
											if(l->second==dependent_or_ref_node->node_id) break;
										}
										if(l==main_or_ref_node->dependency_validation_matrix.end()){
											if(dependent_or_ref_node->expression.morphalytics!=NULL//&&dependent_or_ref_node->expression.morphalytics->is_mocked()==false
												&&dependent_or_ref_node->expression.morphalytics->has_feature("Relative")==true){
												if(dependency_lookup_root=="HC"||dependency_lookup_root=="NC"){
													std::set<unsigned int> nodes_found=find_context_reference_node(dependent_or_ref_node->node_id);
													if(nodes_found.empty()==false){
														new_main_ref_node_id_parents.insert(std::make_pair(main_node_id,false));
														new_dep_ref_node_id_parents.insert(std::make_pair(dep_node_id,false));
													}
													//Get dependent_or_ref_node again as node_infos may have been added new nodes which invalidates pointers to elements
													dependent_or_ref_node=&get_private_node_info(dep_node_id);
													for(auto node_id:nodes_found){
														logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting context node id: "+std::to_string(node_id)+" in ref_node_ids of dependent node id: "+std::to_string(dependent_or_ref_node->node_id));
														dependent_or_ref_node->ref_node_ids.insert(node_id);
														dependent_or_ref_node->ref_to_context=true;
														valid_combination=true;
													}
												}
												else{
													dependent_or_ref_node->ref_node_ids.insert(main_or_ref_node->node_id);
													valid_combination=true;
												}
											}
											else{
												functors_found=is_valid_expression(*main_or_ref_node,*dependent_or_ref_node);
												if(functors_found!=NULL){
													valid_combination=true;
													for(auto&& m:*functors_found){
														functors_validated_for_nodes.insert(std::make_pair(main_or_ref_node->node_id,std::make_pair(m.second.first,dependent_or_ref_node->node_id)));
													}
													delete functors_found;
												}
												/*else{//This seems to enforce that a combination is only valid if functors are found for each combination of main/dependent nodes found.
													if(failover==0||failover<current_step) valid_combination=false;
												}*/
											}
										}
										if(dep_node_id!=*k&&++dep_ref_node_id!=dependent_node->ref_node_ids.end())
											dep_node_id=*dep_ref_node_id;
										else dep_node_id=0;
									}
								}
							}
							if(main_node_id!=*j&&++main_ref_node_id!=main_node->ref_node_ids.end())
								main_node_id=*main_ref_node_id;
							else main_node_id=0;
						}
					}
					if(new_main_ref_node_id_parents.empty()==false&&new_dep_ref_node_id_parents.empty()==false){
						main_ref_node_id_parents=new_main_ref_node_id_parents;
						dep_ref_node_id_parents=new_dep_ref_node_id_parents;
					}
				}
			}
			else if(main_node_symbol.empty()==false
					&&main_node_id_to_node_ids_found_by_symbol.empty()==false
					&&dependent_node_symbol.empty()==true
					&&dependent_node_id_to_node_ids_found_by_symbol.empty()==true
					||main_node_symbol.empty()==true
					&&main_node_id_to_node_ids_found_by_symbol.empty()==true
					&&dependent_node_symbol.empty()==false
					&&dependent_node_id_to_node_ids_found_by_symbol.empty()==false){//This branch allows checking just for symbol existence in a subtree
					if(successor==0||successor<current_step){
						valid_combination=false;
						break;
					}
					else if(successor==current_step){
						valid_combination=true;
						break;
					}
					else{
						valid_combination=true;
					}
			}
			else if(main_node_symbol.empty()==false
					&&main_node_id_to_node_ids_found_by_symbol.empty()==true
					&&dependent_node_symbol.empty()==true
					&&dependent_node_id_to_node_ids_found_by_symbol.empty()==true
					||main_node_symbol.empty()==true
					&&main_node_id_to_node_ids_found_by_symbol.empty()==true
					&&dependent_node_symbol.empty()==false
					&&dependent_node_id_to_node_ids_found_by_symbol.empty()==true){//This branch allows checking just for symbol absence in a subtree
					if(failover==0||failover<current_step){
						valid_combination=false;
						break;
					}
					else if(failover==current_step){
						valid_combination=true;
						break;
					}
					else{
						valid_combination=false;
					}
			}
			else if(main_node_symbol.empty()==false
				&&dependent_node_symbol.empty()==false
				&&(main_node_id_to_node_ids_found_by_symbol.empty()==true||dependent_node_id_to_node_ids_found_by_symbol.empty()==true)){
					valid_combination=false;
			}
			else{
				throw std::runtime_error("Either got empty main and/or dependent node symbol and/or if not empty then no nodes found for them to validate their combination.");
			}
			if(valid_combination==true){
				if(successor>current_step){
					rule_entry=rule_to_rule_map->value_for_field_name_found_after_row_position(rule_entry->first,"step",*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"successor"));
				}
				else if(successor!=0&&successor<=current_step){
					throw std::runtime_error("You have a successor branch loop for parent symbol "+symbol+", head root symbol "+new_phrase_head_root.symbol+" and non-head root symbol "+new_phrase_non_head_root.symbol+" at step "+std::to_string(current_step)+". Sorry, no loops are allowed in the rule to rule map.");
				}
				else{
					rule_entry=NULL;
				}
			}
			else{
				if(failover>current_step){
					rule_entry=rule_to_rule_map->value_for_field_name_found_after_row_position(rule_entry->first,"step",*rule_to_rule_map->field_value_at_row_position(rule_entry->first,"failover"));
				}
				else if(failover!=0&&failover<current_step){
					throw std::runtime_error("You have a failover branch loop for parent symbol "+symbol+", head root symbol "+new_phrase_head_root.symbol+" and non-head root symbol "+new_phrase_non_head_root.symbol+" at step "+std::to_string(current_step)+". Sorry, no loops are allowed in the rule to rule map.");
				}
				else{
					rule_entry=NULL;
					if(failover==current_step) valid_combination=true;
				}
			}
		}
		else{
			throw std::runtime_error("Head root symbol and/or non-head root symbol variable/s don't match the symbols in the rule read from RULE_TO_RULE_MAP db table.");
		}
	}
	if(valid_combination==true){
		rule_step_failed=0;
		insert_in_main_dvm_and_dep_node_links(functors_validated_for_nodes);
	}
	else{
		rule_step_failed=std::atoi(rule_entry_failure_copy->second.field_value.c_str());
	}
	delete rule_to_rule_map;
	return rule_step_failed;
}

void interpreter::insert_in_main_dvm_and_dep_node_links(std::multimap<unsigned int,std::pair<unsigned int,unsigned int> >& functors_validated_for_nodes){
	for(auto&& i:functors_validated_for_nodes){
		node_info *main_node=&get_private_node_info(i.first);
		node_info *dependent_node=&get_private_node_info(i.second.second);
		if(main_node->expression.dependencies==NULL||dependent_node->expression.dependencies==NULL){
			//TODO: check if rule_step_failed needs to be set here or exception should be thrown.
			//This may be the right place (check it!) to prevent dumps if a word gets combined with another
			//one where one of them is not registered in the DEPOLEX.
			//See comments in lexer::dependencies_read_for_functor().
			//As there may be more than one functors, it might be the case that execution can continue if
			//there's at least one, where the dependencies attributes are not null.
			//this may make sense as a first try instead of throwing an exception:
			//rule_step_failed=std::atoi(rule_entry_failure_copy->second.field_value.c_str());
		}
		else{//this else branch was not here earlier so this alone may complicate matters even though the
			// if branch still does not do anything
			main_node->dependency_validation_matrix.insert(i.second);
			logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in dvm, dependent node functor "+dependent_node->expression.lexeme+" for main node functor "+main_node->expression.lexeme);
			if(dependent_node->node_links.find(main_node->node_id)==dependent_node->node_links.end()){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in dependent node links the node id "+std::to_string(main_node->node_id)+" of the main node functor "+main_node->expression.lexeme);
				dependent_node->node_links.insert(std::make_pair(main_node->node_id,0));//TODO:get rid of second member in node_links
			}
		}
	}
}

bool interpreter::is_valid_combination(const unsigned int& main_node_id,const unsigned int& dependent_node_id){
	std::multimap<std::pair<std::string,std::string>,std::pair<unsigned int,std::string> > *functors_found=NULL;
	std::multimap<unsigned int,std::pair<unsigned int,unsigned int> > functors_validated_for_nodes;
	bool valid_combination=false;

	node_info *main_node=&get_private_node_info(main_node_id);
	node_info *dependent_node=&get_private_node_info(dependent_node_id);
	functors_found=is_valid_expression(*main_node,*dependent_node);
	if(functors_found!=NULL){
		for(auto&& m:*functors_found){
			functors_validated_for_nodes.insert(std::make_pair(main_node->node_id,std::make_pair(m.second.first,dependent_node->node_id)));
		}
		delete functors_found;
		insert_in_main_dvm_and_dep_node_links(functors_validated_for_nodes);
		valid_combination=true;
	}
	return valid_combination;
}

void interpreter::combine_sets(const unsigned int& operation, const std::map<unsigned int,std::vector<unsigned int>>& prev_sets,std::map<unsigned int,std::vector<unsigned int>>& current_sets){

	if(operation==1){//union
		if(current_sets.empty()==false&&prev_sets.empty()==false){
			for(auto&& current_set:current_sets){
				auto prev_set=prev_sets.find(current_set.first);
				if(prev_set!=prev_sets.end()){
					std::set<unsigned int> union_set;
					for(auto&& i:prev_set->second){
						union_set.insert(i);
					}
					for(auto&& i:current_set.second){
						union_set.insert(i);
					}
					current_set.second.clear();
					for(auto&& i:union_set){
						current_set.second.push_back(i);
					}
				}
			}
		}
		else if(current_sets.empty()==true&&prev_sets.empty()==false){
			current_sets=prev_sets;
		}
		else if(current_sets.empty()==false&&prev_sets.empty()==true){
			//Norhing to do.
		}
		else{
			//Norhing to do.
		}
	}
	else if(operation==2){//intersection
		if(current_sets.empty()==false&&prev_sets.empty()==false){
			for(auto&& current_set:current_sets){
				auto prev_set=prev_sets.find(current_set.first);
				if(prev_set!=prev_sets.end()){
					std::multiset<unsigned int> union_set;
					for(auto&& i:prev_set->second){
						union_set.insert(i);
					}
					for(auto&& i:current_set.second){
						union_set.insert(i);
					}
					current_set.second.clear();
					for(auto&& i:union_set){
						if(union_set.count(i)==2) current_set.second.push_back(i);
					}
				}
			}
		}
		else if(current_sets.empty()==true&&prev_sets.empty()==false){
			current_sets.clear();
		}
		else if(current_sets.empty()==false&&prev_sets.empty()==true){
			current_sets.clear();
		}
		else{
			//Norhing to do.
		}
	}
	else if(operation==3){//Current minus previous -> current minus intersection
		if(current_sets.empty()==false&&prev_sets.empty()==false){
			for(auto&& current_set:current_sets){
				auto prev_set=prev_sets.find(current_set.first);
				if(prev_set!=prev_sets.end()){
					std::multiset<unsigned int> union_set;
					std::set<unsigned int> current_set_copy;
					for(auto&& i:prev_set->second){
						union_set.insert(i);
					}
					for(auto&& i:current_set.second){
						union_set.insert(i);
						current_set_copy.insert(i);
					}
					current_set.second.clear();
					for(auto&& i:current_set_copy){
						if(union_set.count(i)==1) current_set.second.push_back(i);
					}
				}
			}
		}
		else if(current_sets.empty()==true&&prev_sets.empty()==false){
			//Nothing to do.
		}
		else if(current_sets.empty()==false&&prev_sets.empty()==true){
			//Norhing to do.
		}
		else{
			//Norhing to do.
		}
	}
	else if(operation==4){//Previous minus current -> previous minus intersection
		if(current_sets.empty()==false&&prev_sets.empty()==false){
			for(auto&& current_set:current_sets){
				auto prev_set=prev_sets.find(current_set.first);
				if(prev_set!=prev_sets.end()){
					std::multiset<unsigned int> union_set;
					std::set<unsigned int> prev_set_copy;
					for(auto&& i:prev_set->second){
						union_set.insert(i);
						prev_set_copy.insert(i);
					}
					for(auto&& i:current_set.second){
						union_set.insert(i);
					}
					current_set.second.clear();
					for(auto&& i:prev_set_copy){
						if(union_set.count(i)==1) current_set.second.push_back(i);
					}
				}
			}
		}
		else if(current_sets.empty()==true&&prev_sets.empty()==false){
			current_sets=prev_sets;
		}
		else if(current_sets.empty()==false&&prev_sets.empty()==true){
			//Norhing to do.
		}
		else{
			//Norhing to do.
		}
	}
	else if(operation==5){//disjunct
		if(current_sets.empty()==false&&prev_sets.empty()==false){
			for(auto&& current_set:current_sets){
				auto prev_set=prev_sets.find(current_set.first);
				if(prev_set!=prev_sets.end()){
					std::multiset<unsigned int> union_set;
					for(auto&& i:prev_set->second){
						union_set.insert(i);
					}
					for(auto&& i:current_set.second){
						union_set.insert(i);
					}
					current_set.second.clear();
					for(auto&& i:union_set){
						if(union_set.count(i)==1) current_set.second.push_back(i);
					}
				}
			}
		}
		else if(current_sets.empty()==true&&prev_sets.empty()==false){
			current_sets=prev_sets;
		}
		else if(current_sets.empty()==false&&prev_sets.empty()==true){
			//Norhing to do.
		}
		else{
			//Norhing to do.
		}
	}
}

transgraph* interpreter::build_transgraph(const p_m1_node_id_m2_d_key& root, const std::pair<std::string,unsigned int>& parent,
		std::map<p_m1_node_id_m2_d_key,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,std::map<unsigned int,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,unsigned int> > > >& longest_traversals,
		const unsigned int node_level, const unsigned int prev_parent_node_id){
	p_m1_tree_level_m2_p_m1_node_id_m2_d_key tree_level_and_functor_node;
	std::set<std::pair<std::string,unsigned int> > functors_processed;
	transgraph *functor_transgraph=NULL;

	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"parent.first:"+parent.first+", parent.second:"+std::to_string(parent.second));
	auto root_found=longest_traversals.find(root);
	if(root_found==longest_traversals.end()){
		throw std::runtime_error("Root node not found.");
	}
	if(std::all_of(parent.first.begin(),parent.first.end(),::isdigit)==true){
		const node_info& nodeinfo=get_node_info(std::atoi(parent.first.c_str()));
		if(nodeinfo.expression.lexicon_entry==true){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,nodeinfo.expression.lexeme+"_"+std::to_string(parent.second));
			functor_transgraph=new transgraph(std::to_string(nodeinfo.node_id),std::make_pair(nodeinfo.expression.lexeme,parent.second),get_node_info(std::atoi(parent.first.c_str())).expression.morphalytics);
		}
		else{
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,nodeinfo.expression.gcat+"_"+std::to_string(parent.second));
			functor_transgraph=new transgraph(std::to_string(nodeinfo.node_id),std::make_pair(nodeinfo.expression.gcat,parent.second),get_node_info(std::atoi(parent.first.c_str())).expression.morphalytics);
		}
	}
	else{
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,parent.first+"_"+std::to_string(parent.second));
		functor_transgraph=new transgraph(std::to_string(prev_parent_node_id),std::make_pair(parent.first,parent.second),NULL);
	}
	for(auto&& i:root_found->second.second){
		//TODO: think over if it's necessary to implement a logic after all the traversals
		//are done that cuts off branches leading to the same dependency node leaving only
		//the first path found. Unfortunately, it can only be done after the traversal as
		//it cannot be forseen that a path leads to a dependency node that was already reached via another path.

		const node_info& dep_node=get_node_info(i.first);
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"transgraph lexeme:"+dep_node.expression.lexeme+", d_key (i.second.second):"+std::to_string(i.second.second)
		+" lexeme node id (i.first):"+std::to_string(i.first)
		+" parent node:"+std::get<0>(i.second.first)
		+" parent d_key:"+std::to_string(std::get<3>(i.second.first))
		+" parent d_counter:"+std::to_string(std::get<4>(i.second.first)));
		bool odep_parent_found=false;
		std::pair<std::string,unsigned int> node_found=std::make_pair("",0);
		auto functor_node_odependencies=node_odependency_traversals.end();
		if(std::any_of(std::get<0>(i.second.first).begin(),std::get<0>(i.second.first).end(),::isdigit)==false){
			tree_level_and_functor_node.first=node_level;
			tree_level_and_functor_node.second=root;
			auto functor_node_found=node_dependency_traversal_stack_tree.find(tree_level_and_functor_node);
			if(functor_node_found==node_dependency_traversal_stack_tree.end()){
				throw std::runtime_error("Functor node not found in node dependency traversal stack tree.");
			}
			functor_node_odependencies=node_odependency_traversals.find(functor_node_found->first.second);
			if(functor_node_odependencies==node_odependency_traversals.end()){
				throw std::runtime_error("Functor node not found in node (optional) dependency traversals.");
			}
			unsigned int top_parent_node_id=0;
			if(prev_parent_node_id==0&&std::all_of(parent.first.begin(),parent.first.end(),::isdigit)==true) top_parent_node_id=std::atoi(parent.first.c_str());
			else top_parent_node_id=prev_parent_node_id;
			node_found=find_child_for_parent_bottom_up_via_optional_path(top_parent_node_id,std::get<0>(i.second.first),std::get<3>(i.second.first),std::get<4>(i.second.first),functor_node_odependencies->second,root_found->second.second);
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"parent_node_found_via_optional_path:"+node_found.first+" with d_key:"+std::to_string(node_found.second));
			if(node_found.first.empty()==false&&node_found.second>0&&dep_node.node_links.find(top_parent_node_id)!=dep_node.node_links.end()) odep_parent_found=true;
		}
		if(std::get<0>(i.second.first)==parent.first&&std::get<3>(i.second.first)==parent.second
			&&(i.first!=std::atoi(parent.first.c_str())||i.first==std::atoi(parent.first.c_str())&&i.second.second!=parent.second)
			&&(std::atoi(std::get<0>(i.second.first).c_str())==0&&odep_parent_found==true||std::atoi(std::get<0>(i.second.first).c_str())>0)){
			if(functors_processed.find(std::make_pair(std::to_string(i.first),i.second.second))==functors_processed.end()){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"recursive call 1");
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"transgraph lexeme:"+get_node_info(i.first).expression.lexeme
				+", d_key (i.second.second):"+std::to_string(i.second.second)
				+", lexeme node id (i.first):"+std::to_string(i.first)
				+", parent node:"+std::get<0>(i.second.first)
				+", parent d_key:"+std::to_string(std::get<3>(i.second.first))
				+", parent d_counter:"+std::to_string(std::get<4>(i.second.first)));
				transgraph *child_transgraph=NULL;
				child_transgraph=build_transgraph(root,std::make_pair(std::to_string(i.first),i.second.second),longest_traversals,node_level,i.first);
				if(child_transgraph!=NULL){
					functor_transgraph->insert(std::get<4>(i.second.first),child_transgraph);
					functors_processed.insert(std::make_pair(std::to_string(i.first),i.second.second));
				}
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"recursive return 1");
			}
			else{
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"functor already processed");
			}
		}
		else if(std::any_of(std::get<0>(i.second.first).begin(),std::get<0>(i.second.first).end(),::isdigit)==false){//checking for parent being optional dependency
			for(auto&& j:functor_node_odependencies->second){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking for optional dependency with functor "+j.first.first+" d_key "+std::to_string(j.first.second)+" d_counter "+std::to_string(std::get<5>(j.second))+" parent node "+std::get<0>(j.second)+" d_key "+std::to_string(std::get<1>(j.second))+" d_counter "+std::to_string(std::get<2>(j.second))+" and path_nr "+std::to_string(std::get<3>(j.second)));
				if(std::get<0>(j.second)==parent.first&&std::get<1>(j.second)==parent.second&&std::all_of(parent.first.begin(),parent.first.end(),::isdigit)==false
					||std::get<0>(j.second)==parent.first&&std::get<1>(j.second)==parent.second&&j.first.first==node_found.first&&j.first.second==node_found.second){
					if(functors_processed.find(std::make_pair(j.first.first,j.first.second))==functors_processed.end()){
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"recursive call 2");
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"transgraph lexeme:"+j.first.first+", d_key:"+std::to_string(j.first.second)
						+", parent node:"+std::get<0>(j.second)+", parent d_key:"+std::to_string(std::get<1>(j.second))
						+", odep_level:"+std::to_string(std::get<4>(j.second)));
						transgraph *child_transgraph=NULL;
						if(prev_parent_node_id==0&&std::all_of(parent.first.begin(),parent.first.end(),::isdigit)==true){
							child_transgraph=build_transgraph(root,std::make_pair(j.first.first,j.first.second),longest_traversals,node_level,std::atoi(parent.first.c_str()));
						}
						else{
							child_transgraph=build_transgraph(root,std::make_pair(j.first.first,j.first.second),longest_traversals,node_level,prev_parent_node_id);
						}
						if(child_transgraph!=NULL){
							functor_transgraph->insert(std::get<2>(j.second),child_transgraph);
							functors_processed.insert(std::make_pair(j.first.first,j.first.second));
						}
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"recursive return 2");
					}
					else{
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"functor already processed");
					}
				}
			}
		}
	}
	if(std::any_of(parent.first.begin(),parent.first.end(),::isdigit)==false&&functors_processed.empty()==true){
		delete functor_transgraph;
		functor_transgraph=NULL;
	}
	return functor_transgraph;
}

std::pair<std::string,unsigned int> interpreter::find_child_for_parent_bottom_up_via_optional_path(const unsigned int top_parent_node_id, const std::string& node_to_track, const unsigned int dkey_to_track, const unsigned int dcounter_to_track,
		std::multimap<std::pair<std::string,unsigned int>,std::tuple<std::string,unsigned int,unsigned int,unsigned int,unsigned int,unsigned int> >& odeps,
		std::map<unsigned int,std::pair<t_m0_parent_node_m1_nr_of_deps_m2_nr_of_deps_to_find_m3_parent_dkey_m4_parent_dcounter,unsigned int> >& deps){

	std::pair<std::string,unsigned int> node_found=std::make_pair("",0);
	if(std::all_of(node_to_track.begin(),node_to_track.end(),::isdigit)==false){
		for(auto&& i:odeps){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking optional path via node:"+i.first.first
			+", d_key:"+std::to_string(i.first.second)
			+", d_counter:"+std::to_string(std::get<5>(i.second))
			+", parent node:"+std::get<0>(i.second)
			+" for top parent node:"+std::to_string(top_parent_node_id));
			if(i.first.first==node_to_track
				&&i.first.second==dkey_to_track
				&&std::get<5>(i.second)==dcounter_to_track
				&&std::atoi(std::get<0>(i.second).c_str())==top_parent_node_id){
				node_found.first=i.first.first;
				node_found.second=i.first.second;
				break;
			}
		}
		if(node_found.first.empty()==true&&node_found.second==0){
			for(auto&& i:odeps){
				if(i.first.first==node_to_track
					&&i.first.second==dkey_to_track
					&&std::get<5>(i.second)==dcounter_to_track
					&&std::atoi(std::get<0>(i.second).c_str())!=top_parent_node_id){
					node_found=find_child_for_parent_bottom_up_via_optional_path(top_parent_node_id,std::get<0>(i.second),std::get<1>(i.second),std::get<2>(i.second),odeps,deps);
					if(node_found.first.empty()==false&&node_found.second>0) break;
				}
			}
		}
	}
	else{//TODO:handle intermediate real dependency node in the path leading to top parent node once such "cross binding" is supported
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"Cannot yet handle intermediate real dependency node in the path leading to top parent node.");
	}
	return node_found;
}

unsigned int interpreter::add_feature_to_leaf(const node_info& node, const std::string& feature, const bool& global, const unsigned int& inheritance_node_id){
	unsigned int leaf_node_id=0;

	leaf_node_id=direct_descendant_of(node);
	if(leaf_node_id>0){
		if(global==true){
			morphan_result::add_global_feature(leaf_node_id,feature);
		}
		else{
			const node_info& leaf_node=get_node_info(leaf_node_id);
			leaf_node.expression.morphalytics->add_feature(feature);
		}
		if(inheritance_node_id>0){
			morphan_result::add_feature_to_inherit(leaf_node_id,inheritance_node_id,feature);
		}
	}
	return leaf_node_id;
}

unsigned int interpreter::add_feature_to_leaf(const node_info& node, const std::string& leaf_symbol, const std::string& feature, const bool& global, const unsigned int& inheritance_node_id){
	unsigned int leaf_node_id=0;
	std::vector<unsigned int> nodes;
	std::map<unsigned int,bool> empty_ref_node_id_parents;

	get_nodes_by_symbol(node,leaf_symbol,std::string(),empty_ref_node_id_parents,nodes);
	if(nodes.size()==1){
		leaf_node_id=*nodes.begin();
		if(leaf_node_id>0){
			if(global==true){
				morphan_result::add_global_feature(leaf_node_id,feature);
			}
			else{
				const node_info& leaf_node=get_node_info(leaf_node_id);
				leaf_node.expression.morphalytics->add_feature(feature);
			}
			if(inheritance_node_id>0){
				morphan_result::add_feature_to_inherit(leaf_node_id,inheritance_node_id,feature);
			}
		}
	}
	return leaf_node_id;
}

unsigned int interpreter::add_feature_to_leaf(const node_info& node, const std::string& subnode_symbol, const std::string& leaf_symbol, const std::string& feature, const bool& global, const unsigned int& inheritance_node_id){
	unsigned int leaf_node_id=0;
	std::vector<unsigned int> nodes,subnodes;
	std::map<unsigned int,bool> empty_ref_node_id_parents;

	if(subnode_symbol.empty()==true)
		get_nodes_by_symbol(node,leaf_symbol,std::string(),empty_ref_node_id_parents,nodes);
	else{
		get_nodes_by_symbol(node,subnode_symbol,std::string(),empty_ref_node_id_parents,subnodes);
		for(auto&& subnode:subnodes){
			get_nodes_by_symbol(get_node_info(subnode),leaf_symbol,std::string(),empty_ref_node_id_parents,nodes);
		}
	}
	if(nodes.size()==1){
		leaf_node_id=*nodes.begin();
		if(leaf_node_id>0){
			if(global==true){
				morphan_result::add_global_feature(leaf_node_id,feature);
			}
			else{
				const node_info& leaf_node=get_node_info(leaf_node_id);
				leaf_node.expression.morphalytics->add_feature(feature);
			}
			if(inheritance_node_id>0){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"add_feature_to_leaf: inheritance top node id:"+std::to_string(inheritance_node_id));
				morphan_result::add_feature_to_inherit(leaf_node_id,inheritance_node_id,feature);
			}
		}
	}
	return leaf_node_id;
}

unsigned int interpreter::add_feature_to_leaf_with_value(const node_info& node, const std::string& feature, const std::string& value){
	unsigned int leaf_node_id=0;

	leaf_node_id=direct_descendant_of(node);
	if(leaf_node_id>0){
		const node_info& leaf_node=get_node_info(leaf_node_id);
		leaf_node.expression.morphalytics->add_feature_with_value(feature,value);
	}
	return leaf_node_id;
}

unsigned int interpreter::add_feature_to_leaf_with_value(const node_info& node, const std::string& leaf_symbol, const std::string& feature, const std::string& value){
	unsigned int leaf_node_id=0;
	std::vector<unsigned int> nodes;
	std::map<unsigned int,bool> empty_ref_node_id_parents;

	get_nodes_by_symbol(node,leaf_symbol,std::string(),empty_ref_node_id_parents,nodes);
	if(nodes.size()==1){
		leaf_node_id=*nodes.begin();
		if(leaf_node_id>0){
			const node_info& leaf_node=get_node_info(leaf_node_id);
			leaf_node.expression.morphalytics->add_feature_with_value(feature,value);
		}
	}
	return leaf_node_id;
}

unsigned int interpreter::add_feature_to_leaf_with_value(const node_info& node, const std::string& subnode_symbol, const std::string& leaf_symbol, const std::string& feature, const std::string& value){
	unsigned int leaf_node_id=0;
	std::vector<unsigned int> nodes,subnodes;
	std::map<unsigned int,bool> empty_ref_node_id_parents;

	if(subnode_symbol.empty()==true)
		get_nodes_by_symbol(node,leaf_symbol,std::string(),empty_ref_node_id_parents,nodes);
	else{
		get_nodes_by_symbol(node,subnode_symbol,std::string(),empty_ref_node_id_parents,subnodes);
		for(auto&& subnode:subnodes){
			get_nodes_by_symbol(get_node_info(subnode),leaf_symbol,std::string(),empty_ref_node_id_parents,nodes);
		}
	}
	if(nodes.size()==1){
		leaf_node_id=*nodes.begin();
		if(leaf_node_id>0){
			const node_info& leaf_node=get_node_info(leaf_node_id);
			leaf_node.expression.morphalytics->add_feature_with_value(feature,value);
		}
	}
	return leaf_node_id;
}

unsigned int interpreter::direct_descendant_of(const node_info& root_node){
	if(root_node.ref_to_context==true&&root_node.ref_node_ids.empty()==false){
		for(unsigned int i:root_node.ref_node_ids){
			node_info ref_node=get_node_info(i);
			auto direct_descendant=direct_descendant_of(ref_node);
			if(direct_descendant>0) return direct_descendant;
		}
		return 0;
	}
	else{
		if(root_node.left_child==0&&root_node.right_child==0){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"direct descendant found: "+std::to_string(root_node.node_id));
			return root_node.node_id;
		}
		if(root_node.left_child!=0&&root_node.right_child==0) return direct_descendant_of(get_node_info(root_node.left_child));
		else if(root_node.right_child!=0&&root_node.left_child==0) return direct_descendant_of(get_node_info(root_node.right_child));
		else return 0;
	}
}

void interpreter::get_leafs_of_node_lr(const node_info& root_node, std::vector<unsigned int>& leafs){
	if(root_node.left_child==0&&root_node.right_child==0){
		leafs.push_back(root_node.node_id);
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"leaf word:"+root_node.expression.word);
		return;
	}
	if(root_node.left_child!=0)get_leafs_of_node_lr(get_node_info(root_node.left_child),leafs);
	if(root_node.right_child!=0)get_leafs_of_node_lr(get_node_info(root_node.right_child),leafs);
}

std::set<unsigned int> interpreter::validated_terminals(){
	std::vector<unsigned int> leafs;
	std::set<unsigned int> terminals;

	for(auto&& i:validated_nodes){
		leafs.clear();
		get_leafs_of_node_lr(get_node_info(i),leafs);
		for(auto&& j:leafs){
			terminals.insert(j);
		}
	}
	return terminals;
}

std::vector<node_info> interpreter::nodes(){
	return node_infos;
}

void interpreter::destroy_node_infos(){
	nr_of_nodes_=0;
	return;
}

void interpreter::find_functors_for_dependency_with_gcat_in_db(const std::vector<lexicon>& words, const std::string& dependency,const std::string& d_key,const std::string& lid,const std::string& gcats,std::set<std::pair<std::string,unsigned int>>& functors_found,std::set<std::pair<std::string,unsigned int>>& lexemes_processed){
	db *sqlite=NULL;
	query_result *depolex_entries=NULL;

	auto processed_entry=lexemes_processed.find(std::make_pair(dependency,std::atoi(d_key.c_str())));
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"checking if lexeme is already processed:"+dependency+" with d_key:"+d_key);
	if(processed_entry==lexemes_processed.end()){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"processing lexeme:"+dependency+" with d_key:"+d_key);
		lexemes_processed.insert(std::make_pair(dependency,std::atoi(d_key.c_str())));
		sqlite=db_factory::get_instance();
		if(d_key.empty()==true){
			depolex_entries=sqlite->exec_sql("SELECT * FROM DEPOLEX WHERE SEMANTIC_DEPENDENCY='"+dependency+"';");
		}
		else{
			depolex_entries=sqlite->exec_sql("SELECT * FROM DEPOLEX WHERE SEMANTIC_DEPENDENCY='"+dependency+"' AND REF_D_KEY='"+d_key+"';");
		}
		if(depolex_entries!=NULL){
			unsigned int nr_of_entries=depolex_entries->nr_of_result_rows();
			for(unsigned int i=0; i<nr_of_entries; ++i){
				std::string lexeme=*depolex_entries->field_value_at_row_position(i,"lexeme");
				std::string lexeme_d_key=*depolex_entries->field_value_at_row_position(i,"d_key");
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"lexeme:"+lexeme+" with d_key:"+lexeme_d_key+" found for dependency:"+dependency+" with d_key:"+d_key);
				query_result *lexicon_entries=sqlite->exec_sql("SELECT * FROM LEXICON WHERE LID='"+lid+"' AND GCAT IN ("+gcats+") AND LEXEME='"+lexeme+"';");
				if(lexicon_entries!=NULL){
					auto functor_found=std::make_pair(lexeme,std::atoi(lexeme_d_key.c_str()));
					functors_found.insert(functor_found);
					delete lexicon_entries;
				}
				unsigned int opa=std::atoi(depolex_entries->field_value_at_row_position(i,"optional_parent_allowed")->c_str());
				bool lexeme_found=false;
				for(auto& word:words){
					if(word.lexeme==lexeme){
						lexeme_found=true;
						break;
					}
				}
				if(opa!=0||opa==0&&lexeme_found==true){//TODO:extend with checking manner as well
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"recursive call to find_functors_for_dependency_with_gcat_in_db with dependency:"+lexeme+" and d_key:"+lexeme_d_key);
					find_functors_for_dependency_with_gcat_in_db(words,lexeme,lexeme_d_key,lid,gcats,functors_found,lexemes_processed);
				}
			}
			delete depolex_entries;
		}
		else{
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"lexeme is not used as semantic dependency:"+dependency+" with d_key:"+d_key);
		}
	}
}

void interpreter::build_dependency_semantics(lexer *lex,tokenpaths *tokenpaths,lexicon& intended_main_verb){
	//TODO: How to handle mood?
	//The dependency semantics algorithm gets executed for each token path.
	//1. rank analyses in create_analysis(), store the successful and the failed analyses in different db tables
	//2. check if the returned analyses has the 'errors' property
	//3. if there's no error, return the ranked analyses
	//4. if there's an error but there's a main verb, call build_dependency_semantics()
	//5. if there's an error and no verb, look up the main verbs in the previous analyses. The mandatory dependencies
	//   of the verb finally chosen shall match the MOST of the lexemes of the human input i.e. the verb having the most
	//   mandatory dependencies matching most of the lexemes wins. Besides that if there are mandatory dependencies that are missing,
	//   check if they belong to the verb (like a prefix) and copy the corresponding word(s) of the missing dependencies
	//   together with the verb to construct a new (syntactically incorrect) sentence.
	//   However, it's not sure if it makes sense to check earlier utterances than the latest one.
	//6. start over the interpreter with the newly constructed sentence but this newly triggered interpretation
	//   shall be marked as autocorrected sentence interpretation in order that it can be stored in the db
	//   at the end of the interpretation
	std::multimap<std::pair<unsigned int,unsigned int>,std::string> dependencies_not_found;
	std::vector<lexicon> words=lex->word_entries();//Get words of the current token path.
	std::map<unsigned int,lexicon> main_verbs=lex->find_main_verb(words);
	if(main_verbs.size()>0&&intended_main_verb.lexeme.empty()==false){
		std::set<unsigned int> processed_words;
		std::set<std::pair<unsigned int,unsigned int>> processed_depolex;
		std::set<std::pair<unsigned int,unsigned int>> processed_depolex_by_row_nr;
		std::map<unsigned int,unsigned int> word_index_to_node_id_map;
		std::pair<unsigned int,lexicon> main_verb_indexed;
		for(auto&& main_verb_iterator:main_verbs){//TODO:This will always find only the first if there are more
			if(main_verb_iterator.second.lexeme==intended_main_verb.lexeme){//Check if this should be stricter
				main_verb_indexed=main_verb_iterator;
				break;
			}
		}
		if(main_verb_indexed.second.lexeme==intended_main_verb.lexeme){
			unsigned int word_index=main_verb_indexed.first;
			lexicon main_verb=main_verb_indexed.second;
			main_verb.morphalytics->add_feature("main_verb");
			processed_words.insert(word_index);
			unsigned int main_node_id=set_node_info(main_verb.gcat,main_verb);
			word_index_to_node_id_map.insert(std::make_pair(word_index,main_node_id));
			build_dependency_semantics(words,processed_words,word_index_to_node_id_map,main_node_id,"",processed_depolex,processed_depolex_by_row_nr,lex);
			const node_info& main_node=get_node_info(main_node_id);
			unsigned int root_node_id=set_node_info("S",main_node);
			node_info root_node=get_node_info(root_node_id);
			transgraph *transgraph=NULL;
			transgraph=longest_match_for_semantic_rules_found(dependencies_not_found);
			if(transgraph!=NULL){
				tokenpaths->validate_parse_tree(nodes());
				tokenpaths->validate_path(words,transgraph,context_nodes(),true);
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"TRUE");
			}
			else{
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"semantic error");
				tokenpaths->invalidate_parse_tree(nodes());
				tokenpaths->invalidate_path(words,"semantic error",NULL,dependencies_not_found);
			}
		}
		else{
			logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"No main verb found.");
			tokenpaths->invalidate_parse_tree(nodes());//No nodes created so far but as in case of valid parse trees this should also contain as many (invalid) parse trees as many analyses are carried out.
			tokenpaths->invalidate_path(words,"semantic error",NULL,dependencies_not_found);
		}
	}
	else{
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"No main verb found.");
		tokenpaths->invalidate_parse_tree(nodes());//No nodes created so far but as in case of valid parse trees this should also contain as many (invalid) parse trees as many analyses are carried out.
		tokenpaths->invalidate_path(words,"semantic error",NULL,dependencies_not_found);
	}
}

void interpreter::build_dependency_semantics(std::vector<lexicon>& words,std::set<unsigned int>& processed_words,std::map<unsigned int,unsigned int>& words2nodes,const unsigned int& main_node_id,const std::string& optional_dependency,std::set<std::pair<unsigned int,unsigned int>>& processed_depolex,std::set<std::pair<unsigned int,unsigned int>>& processed_depolex_by_row_nr,lexer *lex){
	if(main_node_id>0){
		const std::pair<const unsigned int,field> *depolex_entry=NULL;
		const node_info main_node=get_node_info(main_node_id);
		const lexicon main_word=main_node.expression;
		std::string lexeme=main_word.lexeme;
		if(optional_dependency.empty()==false){
			lexeme=optional_dependency;
		}
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"lexeme:"+lexeme+", word:"+main_word.word+", gcat:"+main_word.gcat);
		if(main_word.gcat!="CON"&&main_word.dependencies!=NULL){
			depolex_entry=main_word.dependencies->first_value_for_field_name_found("lexeme",lexeme);
			if(depolex_entry!=NULL&&processed_depolex_by_row_nr.find(std::make_pair(main_node_id,depolex_entry->first))==processed_depolex_by_row_nr.end()){
				while(depolex_entry!=NULL&&lexeme==*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"lexeme")){
					std::string d_key=*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"d_key");
					logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"lexeme:"+lexeme+", d_key:"+d_key);
					std::set<unsigned int> d_key_validated_dependencies;
					while(depolex_entry!=NULL&&lexeme==*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"lexeme")
							&&d_key==*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"d_key")){
						std::string dependency_lexeme=*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"semantic_dependency");
						std::string ref_d_key=*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"ref_d_key");
						std::string manner=*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"manner");
						//in the hits find_word_by_lexeme() returns more than one word may be found with the same lexeme
						//so when recording which word has already been combined as dependency then the dependent_mode_id is recorded not only the lexeme
						bool all_possibilities_checked=false;
						std::set<unsigned int> d_counter_validated_dependencies;
						std::map<unsigned int,lexicon> dependencies=lex->find_word_by_lexeme(words,processed_words,dependency_lexeme);
						if(dependencies.empty()==true){
							dependencies=lex->find_word_by_gcat(words,processed_words,dependency_lexeme);
						}
						if(dependencies.empty()==false){
							for(auto& [dependency_word_index,dependency]:dependencies){
								logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"dependency.word:"+dependency.word+", dependency.lexeme:"+dependency.lexeme+", dependency.gcat:"+dependency.gcat);
								unsigned int combined_node_id=0;
								unsigned int dependent_node_id=0;
								if(dependency.lexeme.empty()==false||dependency.lexeme.empty()==true&&dependency.gcat=="CON"){
									//NOTE: there may be >1 matching dependencies
									auto dependent_word_node=words2nodes.find(dependency_word_index);
									if(dependent_word_node!=words2nodes.end()&&dependent_word_node->first==dependency_word_index) dependent_node_id=dependent_word_node->second;
									else{
										dependent_node_id=set_node_info(dependency.gcat,dependency);
										words2nodes.insert(std::make_pair(dependency_word_index,dependent_node_id));
									}
									bool dependency_already_bound=false;
									for(auto& [processed_depolex_main_node_id,processed_depolex_dep_node_id]:processed_depolex){
										if(processed_depolex_dep_node_id==dependent_node_id){
											dependency_already_bound=true;
											break;
										}
									}
									if(dependency_already_bound==false){
										const node_info main_node=get_node_info(main_node_id);
										for(auto dependency_matrix_entry=main_node.dependency_validation_matrix.lower_bound(depolex_entry->first);
												dependency_matrix_entry!=main_node.dependency_validation_matrix.upper_bound(depolex_entry->first);
												++dependency_matrix_entry){
											logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"dvm entry row index:"+std::to_string(dependency_matrix_entry->first)+", dep.node id:"+std::to_string(dependency_matrix_entry->second));
											//If the row_id of the depolex_entry is found among the row_ids stored in the dep.vld.matrix
											//then the field values match as well since both row_ids refer to the corresponding
											//field in the node.expression.dependencies attribute.
											if(d_key_validated_dependencies.find(dependency_matrix_entry->second)==d_key_validated_dependencies.end()){
												d_counter_validated_dependencies.insert(dependency_matrix_entry->second);
												d_key_validated_dependencies.insert(dependency_matrix_entry->second);
											}
										}
										process_depolex_by_row_nr(depolex_entry,ref_d_key,manner,d_counter_validated_dependencies,main_word,main_node_id,dependent_node_id,dependency_lexeme,dependency_word_index,words,processed_words,words2nodes,processed_depolex,processed_depolex_by_row_nr,lex);
									}
								}
							}
						}
						else{
							process_depolex_by_row_nr(depolex_entry,ref_d_key,manner,d_counter_validated_dependencies,main_word,main_node_id,0,dependency_lexeme,0,words,processed_words,words2nodes,processed_depolex,processed_depolex_by_row_nr,lex);
						}
						depolex_entry=main_word.dependencies->value_for_field_name_found_after_row_position(depolex_entry->first,"lexeme",lexeme);
					}
				}
			}
		}
	}
}

void interpreter::process_depolex_by_row_nr(const std::pair<const unsigned int,field> *depolex_entry,const std::string& ref_d_key,const std::string& manner,const std::set<unsigned int>& dependencies_found_in_dvm,const lexicon& main_word,const unsigned int& main_node_id,const unsigned int& dependent_node_id,const std::string& dependency_lexeme,
		const unsigned int& dependency_word_index,std::vector<lexicon>& words,std::set<unsigned int>& processed_words,std::map<unsigned int,unsigned int>& words2nodes,std::set<std::pair<unsigned int,unsigned int>>& processed_depolex,std::set<std::pair<unsigned int,unsigned int>>& processed_depolex_by_row_nr,lexer *lex){
	unsigned int combined_node_id=0;
	std::string dependency_counter=*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"d_counter");
	std::string dependency_failover=*main_word.dependencies->field_value_at_row_position(depolex_entry->first,"d_failover");
	//check if the current depolex entry has already been processed for the main_node_id (which may be the dependent_node_id if already in recursion)
	logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"searching in processed_depolex_by_row_nr for main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
	//No tree is built from the combined nodes as there's no syntax tree in this case, so combined nodes are not inserted anywhere
	if(processed_depolex_by_row_nr.find(std::make_pair(main_node_id,depolex_entry->first))!=processed_depolex_by_row_nr.end()){
		if((manner.empty()==true||manner=="0")&&dependencies_found_in_dvm.size()==0
				||manner=="1"
				||manner=="2"){
			if(dependent_node_id>0){
				combined_node_id=combine_nodes(words,processed_words,words2nodes,main_node_id,dependent_node_id,dependency_word_index,processed_depolex,ref_d_key);
				if(combined_node_id>0){
					processed_depolex_by_row_nr.insert(std::make_pair(main_node_id,depolex_entry->first));
					logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in processed_depolex_by_row_nr main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
					auto dependency=get_node_info(dependent_node_id);
					logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"recursive call to build_dependency_semantics with main node lexeme:"+dependency.expression.lexeme+", gcat:"+dependency.expression.gcat);
					build_dependency_semantics(words,processed_words,words2nodes,dependent_node_id,"",processed_depolex,processed_depolex_by_row_nr,lex);
				}
			}
			else{
				processed_depolex_by_row_nr.insert(std::make_pair(main_node_id,depolex_entry->first));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in processed_depolex_by_row_nr main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"recursive call to build_dependency_semantics with main node lexeme:"+main_word.lexeme+", gcat:"+main_word.gcat+" and optional dependency:"+dependency_lexeme);
				build_dependency_semantics(words,processed_words,words2nodes,main_node_id,dependency_lexeme,processed_depolex,processed_depolex_by_row_nr,lex);
			}
		}
		else if((manner.empty()==true||manner=="0")&&dependencies_found_in_dvm.size()==1
				&&std::atoi(dependency_failover.c_str())>=std::atoi(dependency_counter.c_str())){
			if(dependent_node_id>0){
				combined_node_id=combine_nodes(words,processed_words,words2nodes,main_node_id,dependent_node_id,dependency_word_index,processed_depolex,ref_d_key);
				if(combined_node_id>0){
					processed_depolex_by_row_nr.insert(std::make_pair(main_node_id,depolex_entry->first));
					logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in processed_depolex_by_row_nr main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
					logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"recursive call to build_dependency_semantics with main node lexeme:"+main_word.lexeme+", gcat:"+main_word.gcat+" and optional dependency:"+dependency_lexeme);
					build_dependency_semantics(words,processed_words,words2nodes,main_node_id,dependency_lexeme,processed_depolex,processed_depolex_by_row_nr,lex);
				}
			}
			else{
				processed_depolex_by_row_nr.insert(std::make_pair(main_node_id,depolex_entry->first));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in processed_depolex_by_row_nr main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"recursive call to build_dependency_semantics with main node lexeme:"+main_word.lexeme+", gcat:"+main_word.gcat+" and optional dependency:"+dependency_lexeme);
				build_dependency_semantics(words,processed_words,words2nodes,main_node_id,dependency_lexeme,processed_depolex,processed_depolex_by_row_nr,lex);
			}
		}
	}
	else{
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"Nothing found in processed_depolex_by_row_nr for main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
		if(dependent_node_id>0){
			combined_node_id=combine_nodes(words,processed_words,words2nodes,main_node_id,dependent_node_id,dependency_word_index,processed_depolex,ref_d_key);
			if(combined_node_id>0){
				processed_depolex_by_row_nr.insert(std::make_pair(main_node_id,depolex_entry->first));
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in processed_depolex_by_row_nr main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
				auto dependency=get_node_info(dependent_node_id);
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"recursive call to build_dependency_semantics with main node lexeme:"+dependency.expression.lexeme+", gcat:"+dependency.expression.gcat);
				build_dependency_semantics(words,processed_words,words2nodes,dependent_node_id,"",processed_depolex,processed_depolex_by_row_nr,lex);
			}
		}
		else{
			processed_depolex_by_row_nr.insert(std::make_pair(main_node_id,depolex_entry->first));
			logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"inserting in processed_depolex_by_row_nr main_node_id "+std::to_string(main_node_id)+" and dependent row id "+std::to_string(depolex_entry->first));
			logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"recursive call to build_dependency_semantics with main node lexeme:"+main_word.lexeme+", gcat:"+main_word.gcat+" and optional dependency:"+dependency_lexeme);
			build_dependency_semantics(words,processed_words,words2nodes,main_node_id,dependency_lexeme,processed_depolex,processed_depolex_by_row_nr,lex);
		}
	}
}

unsigned int interpreter::combine_nodes(std::vector<lexicon>& words,std::set<unsigned int>& processed_words,std::map<unsigned int,unsigned int>& words2nodes,const unsigned int& main_node_id,const unsigned int& dependent_node_id,const unsigned int& dependency_word_index,std::set<std::pair<unsigned int,unsigned int>>& processed_depolex,const std::string& ref_d_key){
	unsigned int combined_node_id=0;

	if(main_node_id>0&&dependent_node_id>0){
		const node_info& main_node=get_node_info(main_node_id);
		const node_info& dependent_node=get_node_info(dependent_node_id);
		const lexicon& main_word=main_node.expression;
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"combining nodes: main node with id "+std::to_string(main_node_id)+", lexeme "+main_word.lexeme+" and dependent id "+std::to_string(dependent_node_id)+", lexeme:"+dependent_node.expression.lexeme);
		try{
			bool valid_combination=is_valid_combination(main_node_id,dependent_node_id);
			if(valid_combination==true){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"main word:"+main_node.expression.word+", dvm size:"+std::to_string(main_node.dependency_validation_matrix.size()));
				combined_node_id=combine_nodes(main_word.gcat+"_"+dependent_node.expression.gcat+"_"+std::to_string(main_node_id)+"_"+std::to_string(dependent_node_id),main_node,dependent_node);
				logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"combined_node_id:"+std::to_string(combined_node_id));
			}
			processed_words.insert(dependency_word_index);//TODO: processed_words and processed_depolex must be set together -> wrap them in a method
			processed_depolex.insert(std::make_pair(main_node_id,dependent_node_id));
		}
		catch(invalid_combination& exception){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"Unhandled exception in tokenpaths::combine_nodes().");
		}
	}
	return combined_node_id;
}

std::set<std::pair<std::string,unsigned int>> interpreter::find_functors_with_matching_nr_of_deps(const std::vector<lexicon>& all_words,const std::vector<lexicon>& words,const std::string& main_verb_symbols){
	std::multiset<std::pair<std::string,unsigned int>> functors_found_union;
	std::map<std::pair<std::string,unsigned int>,unsigned int> functors_found_with_nr_of_deps;
	std::set<std::pair<std::string,unsigned int>> functors_with_matching_nr_of_deps;

	for(auto& word: all_words){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"looking up functors for word:"+word.word);
		std::set<std::pair<std::string,unsigned int>> lexemes_processed;
		std::set<std::pair<std::string,unsigned int>> functors_found;
		std::string lexeme=word.lexeme;
		if(word.lexicon_entry==false) lexeme=word.gcat;
		find_functors_for_dependency_with_gcat_in_db(all_words,lexeme,"",word.lid,main_verb_symbols,functors_found,lexemes_processed);
		for(auto& functor_found: functors_found){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting functor in union:"+functor_found.first+" with d_key:"+std::to_string(functor_found.second));
			functors_found_union.insert(functor_found);
		}
	}
	if(functors_found_union.empty()==true){
		//No functors found by dependencies, check if any of the words is a top level functor.
		//If there is more than one, select the one which has no mandatory dependecies
		//since the previous loop should have found functors with only constant dependencies.
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"no functors found for the words as dependencies, assuming they are functors themselves requiring no dependencies");
		db *sqlite=db_factory::get_instance();
		unsigned int min_deps=0;
		for(auto& word: all_words){
			query_result *dependencies=NULL;
			dependencies=sqlite->exec_sql("SELECT * FROM DEPOLEX WHERE LEXEME = '"+word.lexeme+"' ORDER BY LEXEME, D_KEY, D_COUNTER;");
			if(dependencies!=NULL){
				for(unsigned int i=0, n=dependencies->nr_of_result_rows();i<n;++i){
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"row index:"+std::to_string(i)+" lexeme:"+*dependencies->field_value_at_row_position(i,"lexeme")+" d_key:"+*dependencies->field_value_at_row_position(i,"d_key")+" d_counter:"+*dependencies->field_value_at_row_position(i,"d_counter"));
					std::string d_key=*dependencies->field_value_at_row_position(i,"d_key");
					std::string semantic_dependency=*dependencies->field_value_at_row_position(i,"semantic_dependency");
					std::string d_failover=*dependencies->field_value_at_row_position(i,"d_failover");
					auto functor_found=functors_found_with_nr_of_deps.find(std::make_pair(word.lexeme,std::stoi(d_key)));
					if(functor_found==functors_found_with_nr_of_deps.end()){
						if(semantic_dependency.empty()==false&&d_failover.empty()==true){
							logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting first mandatory dependency in functors_found_with_nr_of_deps with lexeme: "+word.lexeme+" and d_key: "+d_key);
							functors_found_with_nr_of_deps.insert(std::make_pair(std::make_pair(word.lexeme,std::stoi(d_key)),1));
						}
						else{
							logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting first entry with no mandatory dependency in functors_found_with_nr_of_deps with lexeme: "+word.lexeme+" and d_key: "+d_key);
							functors_found_with_nr_of_deps.insert(std::make_pair(std::make_pair(word.lexeme,std::stoi(d_key)),0));
						}
					}
					else{
						if(semantic_dependency.empty()==false&&d_failover.empty()==true){
							logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"increasing nr of mandatory dependencies in functors_found_with_nr_of_deps with lexeme: "+word.lexeme+" and d_key: "+d_key);
							functor_found->second++;
						}
					}
				}
			}
		}
		for(auto& functor:functors_found_with_nr_of_deps){
			if(functor.second==0){
				functors_with_matching_nr_of_deps.insert(functor.first);
			}
		}
	}
	else{
		for(auto& functor:functors_found_union){
			auto functor_found=functors_found_with_nr_of_deps.find(functor);
			if(functor_found==functors_found_with_nr_of_deps.end()){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"inserting functor in functors_found_with_nr_of_deps:"+functor.first+" with d_key:"+std::to_string(functor.second));
				functors_found_with_nr_of_deps.insert(std::make_pair(functor,functors_found_union.count(functor)));
			}
		}
		unsigned int max_deps=0;
		for(auto& functor:functors_found_with_nr_of_deps){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"functor "+functor.first.first+" with d_key "+std::to_string(functor.first.second)+" has "+std::to_string(functor.second)+" dependencies");
			if(functor.second>max_deps) max_deps=functor.second;
			bool word_lexeme_matches=false;
			for(auto& word:all_words){
				if(word.lexeme==functor.first.first){
					word_lexeme_matches=true;
					break;
				}
			}
			//if(word_lexeme_matches==true&&functor.second==words.size()-1||word_lexeme_matches==false&&functor.second==words.size()){
			if(word_lexeme_matches==true){
				functors_with_matching_nr_of_deps.insert(functor.first);
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"functor "+functor.first.first+" with d_key "+std::to_string(functor.first.second)+" has matching nr of dependencies");
			}
		}
		if(functors_with_matching_nr_of_deps.empty()==true){
			for(auto& functor:functors_found_with_nr_of_deps){
				if(functor.second==max_deps){
				functors_with_matching_nr_of_deps.insert(functor.first);
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"functor "+functor.first.first+" with d_key "+std::to_string(functor.first.second)+" has the highest nr of dependencies found");
				}
			}
		}
	}
	return functors_with_matching_nr_of_deps;
}

std::set<unsigned int> interpreter::find_context_reference_node(const unsigned int node_id){
//1) read analyses_deps table to find entries with tag "ref" as close in time to the current utterance as possible
//2) check if the found analyses_deps entry has only one lexeme tagged with "ref" or more
//3) get the corresponding entry from analyses table and the best ranked analysis
//4) find the tagged lexeme (if only one is tagged) or the parent of all tagged ones using the parent_node tag
//5) instantiate the necessary objects (morphan, parser nodes, etc.)
	node_info o_node=get_node_info(node_id);
	std::map<unsigned int,bool> empty_ref_node_id_parents;
	std::set<unsigned int> nodes_found;
	db *sqlite=db_factory::get_instance();
	query_result *ref_tagged_entries=NULL;
	//to handle more than one qwords no matter how they are stored
	//(as an array e.g. {"qword":["when","what",...]} or as multiple tags like {"qword":"when","qword":"what",...})
	//this seems to be able to catch all
	std::string ref_value;
	std::string ref_id;
	morphan *morphan=morphan::get_instance(o_node.expression.lid);
	bool natural_language=morphan->is_natural_language();
	if(pp_!=NULL&&natural_language==false){
		ref_id=o_node.expression.morphalytics->feature_value(ref_tag);
		if(ref_id.empty()==false){
			ref_value=ref_stem+pp_->get_search_ref_id(ref_id);
		}
		else{//TODO: error handling
			exit(EXIT_FAILURE);
		}
	}
	else{
		//TODO: to give more control how refs shall be found, it may be necessary to
		//extend the rule_to_rule_map with a new field if gcat is not
		//enough since already existing fields cannot be reused (e.g. dependent_node_lexeme) as
		//get_nodes_by_symbol() relies on them already and would give wrong results.
		//For the same reason, involving arbitrary values from the o_node (like lfeas)
		//does not yield controllable search.
		ref_value=o_node.expression.morphalytics->gcat();
	}
	logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"ref_id:"+ref_id+", ref_value:"+ref_value);
	std::string analysis_deps_query="SELECT * FROM ANALYSES_DEPS WHERE TAGS LIKE '%\""+ref_tag+"\":\""+ref_value+"\"%' AND RANK IN (SELECT MIN(RANK) FROM ANALYSES_DEPS WHERE TAGS LIKE '%\""+ref_tag+"\":\""+ref_value+"\"%' GROUP BY SOURCE,TIMESTAMP,SENTENCE) AND TIMESTAMP = (SELECT MAX(TIMESTAMP) FROM ANALYSES_DEPS WHERE TAGS LIKE '%\""+ref_tag+"\":\""+ref_value+"\"%') GROUP BY SOURCE,TIMESTAMP,SENTENCE,RANK,A_COUNTER,MOOD;";
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"query:"+analysis_deps_query);
	ref_tagged_entries=sqlite->exec_sql(analysis_deps_query);
	if(ref_tagged_entries!=NULL){
		if(natural_language==true){
			std::set<unsigned int> first_row={0};
			ref_tagged_entries->keep(first_row);
		}
		for(unsigned int i=0;i<ref_tagged_entries->nr_of_result_rows();++i){
			node_info node=get_node_info(node_id);
			std::map<unsigned int,unsigned int> context_node_id_to_new_node_id_map;
			std::string source=*ref_tagged_entries->field_value_at_row_position(i,"source");
			std::string timestamp=*ref_tagged_entries->field_value_at_row_position(i,"timestamp");
			std::string sentence=*ref_tagged_entries->field_value_at_row_position(i,"sentence");
			std::string rank=*ref_tagged_entries->field_value_at_row_position(i,"rank");
			std::string a_counter=*ref_tagged_entries->field_value_at_row_position(i,"a_counter");
			std::string tags=*ref_tagged_entries->field_value_at_row_position(i,"tags");
			query_result *ref_tagged_analysis=NULL;
			std::string analysis_query="SELECT ANALYSIS, NON_PP FROM ANALYSES WHERE SOURCE='"+source+"' AND TIMESTAMP='"+timestamp+"' AND SENTENCE='"+sentence+"' AND RANK='"+rank+"' AND A_COUNTER='"+a_counter+"' ORDER BY RANK ASC;";
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"query:"+analysis_query);
			ref_tagged_analysis=sqlite->exec_sql(analysis_query);
			if(ref_tagged_analysis!=NULL){
				std::string analyses=*ref_tagged_analysis->field_value_at_row_position(0,"analysis");//trust ranking, take the first record
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"context analysis found:"+analyses);
				std::string non_pp;
				if(natural_language==false) non_pp=*ref_tagged_analysis->field_value_at_row_position(0,"non_pp");
				rapidjson::Document jsondoc;
				jsondoc.Parse(analyses.c_str());
				rapidjson::Value::Object analysisObject=jsondoc.GetObject();
				//Searching for parent_node checks only if a subtree needs to be handled or (exclusive or) independent nodes
				//TODO:check if there are independent nodes as well even if there is a subtree with parent_node and return them as well
				bool ref_has_parent_node=false;
				auto analysis_deps=analysisObject["analysis_deps"].GetArray();
				for(auto& dep:analysis_deps){
					for(auto& tag:dep["tags"].GetArray()){
						if(tag.HasMember(ref_tag.c_str())==true&&ref_value.compare(std::string(tag[ref_tag.c_str()].GetString()).substr(0,ref_value.length()))==0
							&&tag.HasMember("parent_node")==true){
							ref_has_parent_node=true;
							break;
						}
					}
					if(ref_has_parent_node==true) break;
				}
				if(ref_has_parent_node==false){
					//if there is no parent_node in tags then look up the lexeme as functor in the semantics part of the analysis,
					//and get the node id of it to be able to look it up in the syntax part of the analysis
					std::vector<rapidjson::Value> dependencies_found;
					auto semanticsArray=analysisObject["semantics"].GetArray();
					find_dependency_nodes_with_tag_value(jsondoc.GetAllocator(),ref_tag,ref_value,semanticsArray[0],dependencies_found);
					for(auto& dependency:dependencies_found){
						unsigned int dependency_node_id=std::atoi(dependency["id"].GetString());
						if(context_node_id_to_new_node_id_map.find(dependency_node_id)==context_node_id_to_new_node_id_map.end()){
							unsigned int node_id=create_node_for_syntax_node(node.expression.lid,dependency["id"].GetString(),analysisObject,non_pp,node_id);
							nodes_found.insert(node_id);
							context_node_id_to_new_node_id_map.insert(std::make_pair(dependency_node_id,node_id));
						}
					}
				}
				else{
					auto semanticsArray=analysisObject["semantics"].GetArray();
					find_dependency_chain_with_tag_value(node.expression.lid,ref_tag,ref_value,0,"",semanticsArray[0].GetObject(),analysisObject,nodes_found,context_node_id_to_new_node_id_map,non_pp,node_id);
				}
				for(auto i:context_node_id_to_new_node_id_map){
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_reference_node: storing context node id "+std::to_string(i.second));
					context_node_ids.insert(i.second);
				}
				delete ref_tagged_analysis;
			}
		}
		delete ref_tagged_entries;
	}
	//This seems to be only necessary if top-down semantic rules are supported which was droppped.
	/*for(unsigned int found_node_id:nodes_found){
		std::vector<unsigned int> nodes_found_by_ref_symbol;
		node_info node_found=get_node_info(found_node_id);
		get_nodes_by_symbol(node_found,ref_symbol,"",empty_ref_node_id_parents,nodes_found_by_ref_symbol);
		for(unsigned int ref_symbol_node_id:nodes_found_by_ref_symbol){
			std::vector<unsigned int> con_nodes_found_for_ref_symbol;
			std::vector<unsigned int> ref_nodes_found_for_ref_symbol;
			node_info ref_symbol_node=get_node_info(ref_symbol_node_id);
			get_nodes_by_symbol(ref_symbol_node,"CON","",empty_ref_node_id_parents,con_nodes_found_for_ref_symbol);
			get_nodes_by_symbol(ref_symbol_node,"Relative","",empty_ref_node_id_parents,ref_nodes_found_for_ref_symbol);
			//A ref_symbol must have only one relative node and one constant as children
			if(ref_nodes_found_for_ref_symbol.empty()==false&&con_nodes_found_for_ref_symbol.empty()==false){
				node_info ref_node=get_node_info(ref_nodes_found_for_ref_symbol[0]);
				node_info con_node=get_node_info(con_nodes_found_for_ref_symbol[0]);
				std::string ref_id=ref_stem+con_node.expression.word;
				ref_id=ref_id.substr(0,ref_id.find_last_of('_'));//TODO: create a function in preprocessor class and let the langugae specific class handle it
				ref_node.expression.morphalytics->add_feature_with_value(ref_tag,ref_id);
			}
		}
	}*/
	return nodes_found;
}

std::string interpreter::find_morpheme_id_for_syntax_node(const std::string& node_id,rapidjson::Value::Object& syntaxObject){
	if(syntaxObject.HasMember("id")==true){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_morpheme_id_for_syntax_node:"+node_id+", syntaxObject id:"+syntaxObject["id"].GetString());
		if(syntaxObject["id"].GetString()==node_id&&syntaxObject.HasMember("morpheme id")==true){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_morpheme_id_for_syntax_node: returning");
			return syntaxObject["morpheme id"].GetString();
		}
	}
	if(syntaxObject.HasMember("left child")==true){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_morpheme_id_for_syntax_node: checking left child");
		auto left_child=syntaxObject["left child"].GetObject();
		std::string morpheme_id=find_morpheme_id_for_syntax_node(node_id,left_child);
		if(morpheme_id.empty()==false){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_morpheme_id_for_syntax_node: returning from left child");
			return morpheme_id;
		}
	}
	if(syntaxObject.HasMember("right child")==true){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_morpheme_id_for_syntax_node: checking right child");
		auto right_child=syntaxObject["right child"].GetObject();
		std::string morpheme_id=find_morpheme_id_for_syntax_node(node_id,right_child);
		if(morpheme_id.empty()==false){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_morpheme_id_for_syntax_node: returning from right child");
			return morpheme_id;
		}
	}
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_morpheme_id_for_syntax_node: returning zero");
	return "";
}

void interpreter::find_dependency_nodes_with_tag_value(rapidjson::Document::AllocatorType& allocator, const std::string key,const std::string value,const rapidjson::Value& dependency,std::vector<rapidjson::Value>& dependencies_found){
	for(auto& tag:dependency["tags"].GetArray()){
		if(tag.HasMember(key.c_str())==true&&value.compare(std::string(tag[key.c_str()].GetString()).substr(0,value.length()))==0){
			dependencies_found.push_back(rapidjson::Value(dependency,allocator));
		}
	}
	if(dependency.HasMember("dependencies")==true){
		for(auto& dep_of_dep:dependency["dependencies"].GetArray()){
			for(auto& tag:dep_of_dep["tags"].GetArray()){
				if(tag.HasMember(key.c_str())==true&&value.compare(std::string(tag[key.c_str()].GetString()).substr(0,value.length()))==0){
					dependencies_found.push_back(rapidjson::Value(dep_of_dep,allocator));
				}
			}
			if(dep_of_dep.HasMember("dependencies")==true){
				find_dependency_nodes_with_tag_value(allocator,key,value,dep_of_dep,dependencies_found);
			}
		}
	}
}

void interpreter::find_dependency_chain_with_tag_value(const std::string lid,const std::string& key,const std::string& value,const unsigned int& parent_dep_node_id,const std::string& parent_dep_d_key,const rapidjson::Value::Object& dependency,const rapidjson::Value::Object& analysisObject,std::set<unsigned int>& node_ids_found,std::map<unsigned int,unsigned int>& context_node_id_to_new_node_id_map,const std::string& non_pp,const unsigned int o_node_id){
	unsigned int dep_node_id=0;

	if(parent_dep_node_id>0){
		std::string objectId=dependency["id"].GetString();
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_dependency_chain_with_tag_value: syntaxObject id:"+objectId);
		dep_node_id=find_context_node_ids_for_syntax_node(lid,analysisObject,dependency,context_node_id_to_new_node_id_map,non_pp,o_node_id);
		if(dep_node_id==0){//dependency node not found, this is a referenced node from context which only exists as a semantic object
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_dependency_chain_with_tag_value: syntaxObject id not found for parent_node:"+objectId);
			std::string morpheme_id=dependency["morpheme id"].GetString();
			dep_node_id=create_node(lid,morpheme_id,analysisObject,non_pp,o_node_id);
			context_node_id_to_new_node_id_map.insert(std::make_pair(std::atoi(objectId.c_str()),dep_node_id));
		}
		node_info dep_node=get_private_node_info(dep_node_id);
		node_info parent_node=get_private_node_info(parent_dep_node_id);
		if(parent_node.expression.dependencies!=NULL){
			auto functors_found=is_valid_expression(parent_node,dep_node);
			if(functors_found->empty()==false){
				std::multimap<unsigned int,std::pair<unsigned int,unsigned int>> functors_validated_for_nodes;
				for(auto&& m:*functors_found){
					functors_validated_for_nodes.insert(std::make_pair(parent_node.node_id,std::make_pair(m.second.first,dep_node.node_id)));
				}
				insert_in_main_dvm_and_dep_node_links(functors_validated_for_nodes);
			}
			else{
				throw std::runtime_error("Dependency "+dep_node.expression.lexeme+" not found in dependencies of "+parent_node.expression.lexeme+"\n");
			}
		}
	}
	else{
		for(auto& tag:dependency["tags"].GetArray()){
			if(tag.HasMember(key.c_str())==true&&tag.HasMember("parent_node")==true){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_dependency_chain_with_tag_value: tag key:"+key+", value:"+value+"?="+std::string(tag[key.c_str()].GetString()).substr(0,value.length()));
				if(value.compare(std::string(tag[key.c_str()].GetString()).substr(0,value.length()))==0){
					auto syntaxArray=analysisObject["syntax"].GetArray();
					auto rootSyntaxObject=syntaxArray[0].GetObject();
					std::string top_syntax_node_id=tag["parent_node"].GetString();
					logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_dependency_chain_with_tag_value: root node ref tag parent_node id:"+top_syntax_node_id);
					auto syntaxObject=find_syntax_node(rootSyntaxObject,top_syntax_node_id);
					std::string syntaxObjectId=syntaxObject["id"].GetString();
					if(syntaxObjectId==top_syntax_node_id){
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_dependency_chain_with_tag_value: syntaxObject id found for parent_node:"+syntaxObjectId);
						dep_node_id=find_context_node_ids_for_syntax_node(lid,analysisObject,syntaxObject,context_node_id_to_new_node_id_map,non_pp,o_node_id);
						if(dep_node_id>0){
							node_ids_found.insert(dep_node_id);
						}
						break;
					}
				}
			}
		}
	}
	if(dep_node_id>0&&dependency.HasMember("dependencies")==true){
		unsigned int dep_node_id_semantics_root=find_context_node_ids_for_syntax_node(lid,analysisObject,dependency,context_node_id_to_new_node_id_map,non_pp,o_node_id);
		for(auto& dep_of_dep:dependency["dependencies"].GetArray()){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_dependency_chain_with_tag_value: processing dependency of dep. id "+std::string(dependency["id"].GetString()));
			std::string top_syntax_node_id_of_dep=dep_of_dep["id"].GetString();
			std::string dep_d_key=dependency["d_key"].GetString();
			find_dependency_chain_with_tag_value(lid,key,value,dep_node_id_semantics_root,dep_d_key,dep_of_dep.GetObject(),analysisObject,node_ids_found,context_node_id_to_new_node_id_map,non_pp,o_node_id);
		}
	}
}

unsigned int interpreter::create_node(const std::string& lid,const std::string& morpheme_id,const rapidjson::Value::Object& analysisObject,const std::string& non_pp,const unsigned int o_node_id){
	unsigned int new_node_id=0;
	db *sqlite=NULL;
	query_result *language_entries=NULL;
	//Don't insert in cache the newly created words as token path calculation won't be updated
	//and tokenpaths::next_word() (fed by lexer::next_token()) relies on the cache and the
	//already calculated token paths.
	if(morpheme_id.empty()==false){
		sqlite=db_factory::get_instance();
		language_entries=sqlite->exec_sql("SELECT * FROM LANGUAGES WHERE LID !='"+lid+"';");
		for(auto& morphologyObject: analysisObject["morphology"].GetArray()){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"moprhologyObject id:"+std::string(morphologyObject["morpheme id"].GetString())+", morpheme id found:"+morpheme_id);
			if(morphologyObject["morpheme id"].GetString()==morpheme_id){
				std::string word=morphologyObject["word"].GetString();
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"moprhologyObject word:"+word);
				std::string gcat=morphologyObject["gcat"].GetString();
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"moprhologyObject gcat:"+gcat);
				std::vector<std::string> morphemes;
				morphan_result *morphalytics=NULL;
				if(gcat=="CON"){
					morphalytics=new morphan_result(word,lid,"");
				}
				else{
					for(auto& i:morphologyObject["tags"].GetArray()){
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"moprhologyObject tag:"+std::string(i.GetString()));
						morphemes.push_back(i.GetString());
					}
					morphalytics=new morphan_result(word,morphemes,lid);//TODO:get lid from analysis once it's there
				}
				lexicon lex_word=lexer::tokenize_word(*morphalytics,lid);
				if(morphalytics==NULL||morphalytics!=NULL&&morphalytics->is_erroneous()==true){
					for(unsigned int i=0;i<language_entries->nr_of_result_rows();++i){
						std::string lid=*language_entries->field_value_at_row_position(i,"lid");
						morphalytics=new morphan_result(word,morphemes,lid);
						lex_word=lexer::tokenize_word(*morphalytics,lid);
						if(morphalytics!=NULL&&morphalytics->is_erroneous()==false&&morphalytics->is_mocked()==false){
							new_node_id=set_node_info(gcat,lex_word);
							break;
						}
					}
				}
				else{
					new_node_id=set_node_info(gcat,lex_word);
				}
				if(morphalytics!=NULL&&non_pp.empty()==false) morphan_result::add_feature_to_inherit(new_node_id,o_node_id,non_pp);
				break;
			}
		}
		delete language_entries;
	}
	else{
		throw std::runtime_error("Cannot instantiate morphalytics: no morpheme id found.");
	}
	return new_node_id;
}

unsigned int interpreter::create_node_for_syntax_node(const std::string& lid,const std::string& node_id,const rapidjson::Value::Object& analysisObject,const std::string& non_pp,const unsigned int o_node_id){
	unsigned int new_node_id=0;
	auto syntaxArray=analysisObject["syntax"].GetArray();
	auto syntaxObject=syntaxArray[0].GetObject();
	std::string morpheme_id=find_morpheme_id_for_syntax_node(node_id,syntaxObject);
	new_node_id=create_node(lid,morpheme_id,analysisObject,non_pp,o_node_id);
	return new_node_id;
}

unsigned int interpreter::find_context_node_ids_for_syntax_node(const std::string& lid,const rapidjson::Value::Object& analysisObject,const rapidjson::Value::Object& syntaxObject,std::map<unsigned int,unsigned int>& context_node_id_to_new_node_id_map,const std::string& non_pp,const unsigned int o_node_id){
	unsigned int child_parent_node_id=0;
	bool ref_symbol_found_now=false;

	if(syntaxObject.HasMember("id")==true){
		auto node_id_it=context_node_id_to_new_node_id_map.find(std::atoi(syntaxObject["id"].GetString()));
		if(node_id_it!=context_node_id_to_new_node_id_map.end()){
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: node id "+std::to_string(node_id_it->second)+" found for context node id "+syntaxObject["id"].GetString());
			const node_info& node=get_node_info(node_id_it->second);
			return node_id_it->second;
		}
		else{
			logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: syntaxObject id:"+std::string(syntaxObject["id"].GetString()));
			if(syntaxObject.HasMember("morpheme id")==true){
				std::string morpheme_id=syntaxObject["morpheme id"].GetString();
				unsigned int new_node_id=create_node(lid,morpheme_id,analysisObject,non_pp,o_node_id);
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: for context node id "+std::string(syntaxObject["id"].GetString())+", returning new node id:"+std::to_string(new_node_id));
				context_node_id_to_new_node_id_map.insert(std::make_pair(std::atoi(syntaxObject["id"].GetString()),new_node_id));
				return new_node_id;
			}
			//TODO: if there is no morpheme id, it may still be a terminal node of a linguistic feature having no left or
			//right child. A node shall be created for them as well but nothing indicates to which word they belong to.
			if(syntaxObject.HasMember("left child")==true){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: checking left child");
				auto left_child=syntaxObject["left child"].GetObject();
				unsigned int child_node_id=find_context_node_ids_for_syntax_node(lid,analysisObject,left_child,context_node_id_to_new_node_id_map,non_pp,o_node_id);
				if(child_node_id>0){
					std::string symbol=syntaxObject["symbol"].GetString();
					const node_info& child_node=get_node_info(child_node_id);
					auto node_id_it=context_node_id_to_new_node_id_map.find(std::atoi(syntaxObject["id"].GetString()));
					if(node_id_it!=context_node_id_to_new_node_id_map.end()){
						node_info& child_parent_node=get_private_node_info(node_id_it->second);
						child_parent_node_id=child_parent_node.node_id;
						if(child_parent_node.left_child>0&&child_parent_node.left_child!=child_node_id){
							throw std::runtime_error("Left child node id is already set.");
						}
						else{
							logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: for context node id "+std::string(syntaxObject["id"].GetString())+" with new node id "+std::to_string(child_parent_node_id)+", setting left child node id:"+std::to_string(child_node_id));
							child_parent_node.left_child=child_node_id;
						}
					}
					else{
						child_parent_node_id=set_node_info_left(symbol,child_node);
						context_node_id_to_new_node_id_map.insert(std::make_pair(std::atoi(syntaxObject["id"].GetString()),child_parent_node_id));
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: for context node id "+std::string(syntaxObject["id"].GetString())+" with new node id "+std::to_string(child_parent_node_id)+", setting left child node id:"+std::to_string(child_node_id));
					}
				}
			}
			if(syntaxObject.HasMember("right child")==true){
				logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: checking right child");
				auto right_child=syntaxObject["right child"].GetObject();
				unsigned int child_node_id=find_context_node_ids_for_syntax_node(lid,analysisObject,right_child,context_node_id_to_new_node_id_map,non_pp,o_node_id);
				if(child_node_id>0){
					std::string symbol=syntaxObject["symbol"].GetString();
					const node_info& child_node=get_node_info(child_node_id);
					auto node_id_it=context_node_id_to_new_node_id_map.find(std::atoi(syntaxObject["id"].GetString()));
					if(node_id_it!=context_node_id_to_new_node_id_map.end()){
						node_info& child_parent_node=get_private_node_info(node_id_it->second);
						child_parent_node_id=child_parent_node.node_id;
						if(child_parent_node.right_child>0&&child_parent_node.right_child!=child_node_id){
							throw std::runtime_error("Right child node id is already set.");
						}
						else{
							logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: for context node id "+std::string(syntaxObject["id"].GetString())+" with new node id "+std::to_string(child_parent_node_id)+", setting right child node id:"+std::to_string(child_node_id));
							child_parent_node.right_child=child_node_id;
						}
					}
					else{
						child_parent_node_id=set_node_info(symbol,child_node);
						context_node_id_to_new_node_id_map.insert(std::make_pair(std::atoi(syntaxObject["id"].GetString()),child_parent_node_id));
						logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: for context node id "+std::string(syntaxObject["id"].GetString())+" with new node id "+std::to_string(child_parent_node_id)+", setting right child node id:"+std::to_string(child_node_id));
					}
				}
			}
		}
	}
	logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"find_context_node_ids_for_syntax_node: returning parent node id "+std::to_string(child_parent_node_id));
	return child_parent_node_id;
}

std::vector<node_info> interpreter::context_nodes(){
	std::vector<node_info> context_words;

	for(auto i:context_node_ids){
		auto node=get_node_info(i);
		context_words.push_back(node);
	}
	return context_words;
}

rapidjson::Value::Object interpreter::find_syntax_node(const rapidjson::Value::Object& syntaxObject,const std::string& syntax_node_id){
	if(syntaxObject.HasMember("id")==true){
		if(syntaxObject["id"].GetString()==syntax_node_id){
			return syntaxObject;
		}
		if(syntaxObject.HasMember("left child")==true){
			auto node_found=find_syntax_node(syntaxObject["left child"].GetObject(),syntax_node_id);
			if(node_found.HasMember("id")==true){
				if(node_found["id"].GetString()==syntax_node_id){
					return node_found;
				}
			}
		}
		if(syntaxObject.HasMember("right child")==true){
			auto node_found=find_syntax_node(syntaxObject["right child"].GetObject(),syntax_node_id);
			if(node_found.HasMember("id")==true){
				if(node_found["id"].GetString()==syntax_node_id){
					return node_found;
				}
			}
		}
	}
	return syntaxObject;
}

std::map<std::pair<unsigned int,unsigned int>,std::tuple<unsigned int,unsigned int,std::string,std::string>> interpreter::find_subtree_root_of(const unsigned int root_node_id,const std::string& lexeme,const std::string& dependency){
	//call get_paths_to_lexeme() for lexeme, then for dependency, then check if there are common node ids in the paths for both
	std::vector<std::vector<unsigned int>> lexeme_paths,dependency_paths;
	std::vector<unsigned int> current_path,subtree_roots;
	std::map<std::pair<unsigned int,unsigned int>,std::tuple<unsigned int,unsigned int,std::string,std::string>> lexnodeid_depnodeid_pair_to_nodeid_level_leftroottype_rightroottype_tuple_map;
	if(root_node_id>0){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(0,"find_subtree_root_of lexeme:"+lexeme+" and dependency:"+dependency);
		node_info root_node=get_node_info(root_node_id);
		get_paths_to_lexeme(root_node,lexeme,lexeme_paths,current_path);
		current_path.clear();
		get_paths_to_lexeme(root_node,dependency,dependency_paths,current_path);
		for(auto lexeme_path:lexeme_paths){
			unsigned int lexeme_node_level=0;
			for(auto lexeme_path_node_id:lexeme_path){
				for(auto dependency_path:dependency_paths){
					unsigned int dependency_node_level=0;
					for(auto dependency_path_node_id:dependency_path){
						if(lexeme_node_level==dependency_node_level&&lexeme_path_node_id==dependency_path_node_id){
							auto lexnodeid_depnodeid_nodeid_level=lexnodeid_depnodeid_pair_to_nodeid_level_leftroottype_rightroottype_tuple_map.find({lexeme_path.back(),dependency_path.back()});
							if(lexnodeid_depnodeid_nodeid_level==lexnodeid_depnodeid_pair_to_nodeid_level_leftroottype_rightroottype_tuple_map.end()){
								//record which child of the subtree root node leads to the lexeme ('H') and the dependency ('N')
								node_info subroot_node=get_node_info(lexeme_path_node_id);
								std::string left_root_type="H";
								std::string right_root_type="N";
								if(subroot_node.left_child==dependency_path[dependency_node_level+1]){
									left_root_type="N";
									right_root_type="H";
								}
								lexnodeid_depnodeid_pair_to_nodeid_level_leftroottype_rightroottype_tuple_map.insert({{lexeme_path.back(),dependency_path.back()},{lexeme_path_node_id,lexeme_node_level,left_root_type,right_root_type}});
							}
							else{
								auto& [lex_node_id,dep_node_id]=lexnodeid_depnodeid_nodeid_level->first;
								auto& [node_id,node_level,left_root_type,right_root_type]=lexnodeid_depnodeid_nodeid_level->second;
								if(lexeme_node_level>node_level){
									//node_id=lexeme_path_node_id;
									//node_level=lexeme_node_level;
									node_info subroot_node=get_node_info(lexeme_path_node_id);
									std::string left_root_type="H";
									std::string right_root_type="N";
									if(subroot_node.left_child==dependency_path[dependency_node_level+1]){
										left_root_type="N";
										right_root_type="H";
									}
									lexnodeid_depnodeid_pair_to_nodeid_level_leftroottype_rightroottype_tuple_map.erase(lexnodeid_depnodeid_nodeid_level);
									lexnodeid_depnodeid_pair_to_nodeid_level_leftroottype_rightroottype_tuple_map.insert({{lexeme_path.back(),dependency_path.back()},{lexeme_path_node_id,lexeme_node_level,left_root_type,right_root_type}});
								}
							}
						}
						++dependency_node_level;
					}
				}
				++lexeme_node_level;
			}
		}
	}
	return lexnodeid_depnodeid_pair_to_nodeid_level_leftroottype_rightroottype_tuple_map;
}

void interpreter::get_paths_to_lexeme(const node_info& node,const std::string& lexeme,std::vector<std::vector<unsigned int>>& paths,std::vector<unsigned int> current_path){
	current_path.push_back(node.node_id);
	if(node.left_child==0&&node.right_child==0&&(node.expression.lexeme==lexeme||node.expression.gcat==lexeme)){
		logger::singleton()==NULL?(void)0:logger::singleton()->log(3,"leaf lexeme:"+node.expression.lexeme);
		paths.push_back(current_path);
		return;
	}
	if(node.left_child!=0) get_paths_to_lexeme(get_node_info(node.left_child),lexeme,paths,current_path);
	if(node.right_child!=0) get_paths_to_lexeme(get_node_info(node.right_child),lexeme,paths,current_path);
	return;
}