### traverse through neighbors 
consider_neighbor=true
### reference annotation folder 
reference_annotation=2-all-tlinks
### system output folder 
system_output=4-system_output
timegraph_debug=false
### if consider_direct_match == 'true' then it will check if the relation directly exists in the reference annotation or not, i.e. it will skip checking in the timegraph if its extracted from direct matching. The performance (time in second) reported in the paper didn't consider direct matching, but all matching in the timegraph. 
consider_direct_match=true
### TLINKS files sequence 
### one_file = one file consisting of all TLINKS in order of occurrences 
### multiple_files = TLINKS in different files, e.g. one for event timex, one for event DCT, one for event event. We can mention which order we want to traverse in the config file. 
tlink_files=one_file
### ordering if multiple_files 
order=tlinks-timex-timex>tlinks-dct-event>tlinks-timex-event>tinks-event-event
### start with dct, to check if starting with dct helps or by default starting with timex-timex relations are better 
### possible values: true or false 
init_dct=true
### visualization option 
visualization=false
### temporal closure verification debug 
debug_verification=false
### base directory 
basedir=./
### timegraph construction debug 
