| W13-3411 | matching as well ) . Second , | feature matching | is equivalent to maximizing the |
| P80-1013 | the feature annotations . For | feature matching | , we must return to the original |
| P97-1042 | Additionally , this version of rule | feature matching | does not cater for rules whose |
| E97-1042 | Additionally , this version of rule | feature matching | does not cater for rules whose |
| C86-1040 | antecedent . A straightforward | feature matching | technique was used to do this |
| S15-2076 | allows for a more flexible sort of | feature matching | . Rather than looking for the |
| S15-2076 | friend of a friend approach to | feature matching | . For example , suppose that |
| D14-1026 | ) morphological and syntactic | feature matching | , ( b ) stem matching . Based |
| W13-3411 | of objects turn gray . In the | feature matching | activity , the goal is to match |
| W13-3411 | correct strategy for either the | feature matching | game or the log-likelihood game |
| W12-6325 | the test corpus . The attribute | feature matching | problem is considered as the |
| W13-3411 | possible it certainly achieves | feature matching | as well ) . Second , feature |
| W04-2410 | are usually based on a strict | feature matching | measure rather than on co-occurrence |
| W05-0107 | software provided included some | features matching | . not discussed in class . In |
| E87-1049 | free rules augmented with some | feature matching | mechanism . However , this treatment |
| W12-6325 | which is the product of attribute | feature matching | and not the similarity of the |
| P80-1013 | may use the ~ convention . 6.2 . | Feature Matching | So far variables have matched |
| W11-2010 | terms of context building and | feature matching | operations . In the near future |
| D14-1089 | comparison as opposed to exact | feature matching | if dependency paths are to be |
| W13-3411 | the three activities . First , | feature matching | is a weaker , attainable version |
