Keywords: dejean02a

Next: First Experiment Up: The ALLiS Algorithm Previous: Refinement

## Parsing

Once a set of rules is learned, it has to be applied to data. For this purpose, several tools have been used: CASS [see][]Abneycass, XFST [see][]XFST, fsgmatch [see][]LTTTT, and XIP [see][]XIP2001. XIP offers the most appropriate formalism and a good parsing speed. The results presented in this paper have been obtained using XIP. ALLiS rules have to be converted into the adequate (XIP) format. Here are the rules we discussed in the preceding version.

    1> ?[i-np=+, C:NN ].
    2> ?[C:IN ], ?[i-np=~, W:order ,C:NN ], ?[C:TO ].
    2> ?[i-np=~, W:have ,C:NN ].

XIP allows the ordering rules. A straightforward way to implement exceptions is to apply them after their ``mother'' rule. The first rule adds the feature i-np and is applied first (level 1). The other rules, exceptions of the first, are triggered after (level 2), and delete the feature i-np thanks to the operator `=~`.