HieraParser is a fast and parallel implementation of Top-down Bracketing Transduction Grammar (BTG)-based preordering, extended to support multi-threading, parallel training and parallel parsing.
For the online training algorithm for Top-down BTG-based parser, please refer to the following paper, Tetsuji Nakagawa: Efficient Top-Down BTG Parsing for Machine Translation Preordering , ACL-2015
Differing from Nakagawa's implementation in which using the online Passive-Aggressive (PA) algorithm to train preorderer, we adopt several parallel techniques to parallelise the PA algorithm and train the preorderer in parallel. This application is more fast and robust when training on automatically aligned datasets.
Building HieraParser requires a modern C++ (>=C++11) compiler and the CMake build system.
Please make sure your complier version (gcc/clang) supports "pthread" before compiling.
To compile, do the following
mkdir build
cd build/
cmake ..
make
./bin/train -input data/train.en.annot -align data/train.en.aligned -model hierp.model
[main arguments]:
-beam: maximum beam size during parsing (default 20)
-batch: batch size of training examples.
-shuffle: shuffle the training examples during each iteration, recommended
-iterations: maximum iteration to training the reordering model (default 20)
-input: path to input file of the source language.
-align: path to alignment file.
-model: path to model file [output].
-threads: the number of threads used for training.
-kbest: using k-best derivations, it should be a number smaller than beam size. (default: 5)
-strategy: which parallel strategy to use
[ 1. mini-batch learning,
2. distributed averaging,
3. iteratively distributed averaging ]
-
- is avaliable for test (online training)
./bin/parse -input data/train.en.annot -align data/train.en.aligned -model hierp.model
[main arguments]:
-beam: maximum beam size during parsing (default 20)
-input: path to input file of the source language.
-model: path to model file [input].
-threads: the number of threads to use for parsing (default : auto detected).
- It was implemented with (C++11 STL) built-in multi-threading library.
- farmhash is used, instead of boost::hash_combine or std::hasher in STL.
- Added the multi-threading support for parsing.
Compared to TD-BTG-Preorderer, HieraParser is faster (4~6 times) and more accurate.
If you have any problem, please contact the author.
Copyright (C) 2017 Hao WANG, Waseda University.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent