## SVM
^{cfg} ## Support Vector Machine for Weighted Context Free GrammarsAuthor: Thorsten Joachims <thorsten@joachims.org> Version: 2.01 |

*SVM ^{cfg}* is an implementation of the Support Vector Machine (SVM) algorithm for learning a weighted context free grammar as described in [1]. The goal is to learn an accurate model from supervised training data, so that this model predicts the correct tree

Compared to a conventional probablistic context free grammar (PCFG), the SVM algorithm can handle overlapping and dependent attributes attached to grammar rules. In particular, the weight of an instantiated rule can depend on the complete terminal sequence, the span of the rule, and the spans of the children trees. This implementation is not meant to be a specialized and properly tuned parser for natural language, but a flexible and extensible tool for learning models in a wide range of domains. In particular, it is easy to add attributes that reflect the properties for the particular domain at hand.

This implementation is an instance of *SVM ^{struct}*. More information on

http://download.joachims.org/svm_cfg/v2.01/svm_cfg.tar.gz

Please send me email and let me know that you got it. The archive contains the source code of the most recent version of *SVM ^{cfg}*, which includes the source code of

gunzip –c svm_cfg.tar.gz | tar xvf –This expands the archive into the current directory, which now contains all relevant files. You can compile

makeThis will produce the executables

SVM* ^{cfg}* consists of a learning module (

Usage is much like *SVM ^{light}*. You call it like

svm_cfg_learn -c 1.0 train.dat modelwhich trains an SVM on the training set

General options: -? -> this help -v [0..3] -> verbosity level (default 1) -y [0..3] -> verbosity level for svm_light (default 0) Learning options: -c float -> C: trade-off between training error and margin (default 0.01) -p [1,2] -> L-norm to use for slack variables. Use 1 for L1-norm, use 2 for squared slacks. (default 1) -o [1,2] -> Slack rescaling method to use for loss. 1: slack rescaling 2: margin rescaling (default 1) -l [0..] -> Loss function to use. 0: zero/one loss (default 0) Kernel options: -t int -> type of kernel function: 0: linear (default) 1: polynomial (s a*b+c)^d 2: radial basis function exp(-gamma ||a-b||^2) 3: sigmoid tanh(s a*b + c) 4: user defined kernel from kernel.h -d int -> parameter d in polynomial kernel -g float -> parameter gamma in rbf kernel -s float -> parameter s in sigmoid/poly kernel -r float -> parameter c in sigmoid/poly kernel -u string -> parameter of user defined kernel Optimization options (see [1]): -q [2..] -> maximum size of QP-subproblems (default 10) -n [2..q] -> number of new variables entering the working set in each iteration (default n = q). Set nsize of cache for kernel evaluations in MB (default 40) The larger the faster... -e float -> eps: Allow that error for termination criterion (default 0.01) -h [5..] -> number of iterations a variable needs to be optimal before considered for shrinking (default 100) -k [1..] -> number of new constraints to accumulate before recomputing the QP solution (default 100) -# int -> terminate optimization, if no progress after this number of iterations. (default 10000) Output options: -a string -> write all alphas to this file after learning (in the same order as in the training set) Structure learning options: --s [1..] -> Maximum length of sentences to use (default 10) --p {0,1} -> Use parent annotation for rules (default 0) --a {0,1} -> Use borders as feature (default 0) --b {0,1} -> Use length of parent span as feature (default 0) --c {0,1} -> Use length of childrens spans as features (default 0) --d {0,1} -> Use difference between children spans as feature (default 0) -l {0,1} NOTE: Added loss type '1' in addition to the 0/1-loss '0' Loss type '1' uses (1-F_1) as the loss.

The option `--s` allows you to specify a maximum sentence length, so that all longer sentences are ignored in the experiment. Option `--p` turns on parent annotation of rules as described in [2]. The remaining structure option (`--a` to `--d`) select different types of features to include in the representation. For more details on the meaning of these options consult the description of *SVM ^{light}* and references [1][3].

The input file `example_file` contains the training examples. The file format is the same in the Penn Treebank with the slight modifications described in [2] (e.g. removal of epsilon rules). For example, the following bracketed tree is an example with the terminal symbols in the leaves.

('root' (S (NP (DET the) (N cat)) (VP (V ran))))

Note that all trees have to start with the special root symbol `'root'`. Note also that the current version of the code ignores the terminals, but starts with the pre-terminals.

The result of `svm_cfg_learn` is the model which is learned from the training data in `example_file`. The model is written to two files starting with `model_file` and having suffixes `.svm` and `.grammar`. To make predictions on test examples, `svm_cfg_classify` reads this file. `svm_cfg_classify` is called as follows:

svm_cfg_classify [options] example_file model_file output_file

For all test examples in `example_file` the predicted parse trees are written to `output_file`. There is one line per test example in `output_file` in the same order as in `example_file`. The test file has the same format as the training file (i.e. if you do not know the correct parse tree for the test example, you have to make up a bogus one).

You will find a small example problem with 29 examples from the Penn Treebank at

http://download.joachims.org/svm_cfg/examples/example5.tar.gz

Download this file into your svm_cfg directory and unpack it with

gunzip -c example5.tar.gz | tar xvf -

This will create a subdirectory `example5`. There are 29 examples in the file `train.dat`. To run the example, execute the commands:

`svm_cfg_learn --s 40 -c 0.1 -l 1 --a 1 --b 1 --c 1 example5/train.dat example5/model`

`svm_cfg_classify example5/train.dat example5/model example5/predictions`

The first command trains using all sentences of length at most 40, the regularization parameter `C` equal to `0.1`, the `F _{1}`-loss, and features

This software is free only for non-commercial use. It must not be distributed without prior permission of the author. The author is not responsible for implications from the use of this software.

- Fixed bug that lead to ignoring additional rule features in
`svm_cfg_classify`.

**[1]** I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun. Support Vector Learning for Interdependent and Structured Output Spaces, ICML, 2004. [Postscript] [PDF]

**[2]** M. Johnson, PCFG models of linguistic tree representations. Computational Linguistics, 1999.

**[3]** T. Joachims, Making Large-Scale SVM Learning Practical. Advances in Kernel Methods - Support Vector Learning, B. Schölkopf and C. Burges and A. Smola (ed.), MIT Press, 1999. [Postscript (gz)] [PDF]