| D14-1029 | contain 10n nodes . Then we use fast | patternmatching | ( Zhang et al. , 2009 ) to convert |
| C92-4204 | Basically , these programs use | patternmatching | ( enhanced ' with boolean selection |
| J93-3001 | than the systems classified as | patternmatching | systems . We put the systems |
| A88-1002 | fragmentary recognition using | patternmatching | techniques . The fragments it |
| P02-1018 | This paper describes a simple | patternmatching | algorithm for post-processing |
| J79-1082 | to either of the processes . As | patternmatching | is a recursive process this ability |
| E87-1010 | that the case for statistical | patternmatching | for syntactic classification |
| D13-1052 | Ft in ( b ) by using the fast | patternmatching | technique ( Zhang et al. , 2009 |
| E06-2030 | detection is based on textual | patternmatching | rules that look for simple grammatical |
| C86-1067 | simultaneously . The process is basically a | patternmatching | of paths with the case frame |
| D10-1027 | into translation forest by rule | patternmatching | ( Mi et al. , 2008 ) . We use |
| E93-1034 | of prosodic objects such as by | patternmatching | on antecedent terms ( see comment |
| D13-1052 | to 10n nodes before we use fast | patternmatching | ( Zhang et al. , 2009 ) to convert |
| H94-1033 | We added two new finite-state | patternmatching | modules to PLUM between MUC-4 |
| P02-1018 | nodes with their antecedents . The | patternmatching | algorithm combines both simplicity |
| C90-3094 | language fo r representation and | patternmatching | tasks , while using an ATMS to |
| P02-1018 | This paper describes a simple | patternmatching | algorithm for recovering empty |
| C00-1035 | the disambiguating power of the | patternmatching | algorithln . The ORAEL-system |
| N04-1005 | predicates in MATCH . Second , the | patternmatching | approach uses the entire grammar |
| H94-1033 | semantic properties . The new | patternmatching | component applies FS patterns |
