| Adaptive Pattern-based Bilingual Data Mining | Table 2 lists the three classes and the corresponding regular expressions in Microsoft .Net Framework6. |
| Adaptive Pattern-based Bilingual Data Mining | The matching process is actually quite simple, since we transform the learnt patterns into standard regular expressions and then make use of existing regular expression matching tools (e. g., Microsoft .Net Framework) to extract translation pairs. |
| Adaptive Pattern-based Bilingual Data Mining | However, to make our patterns more robust, when transforming the selected patterns into standard regular expressions , we allow each character class to match more than once. |
| Previous work | For example, the DIPRE algorithm by Brin (1998) used string-based regular expressions in order to recognize relations such as author-book, while the SNOWBALL algorithm by Agichtein and Gravano (2000) learned similar regular expression patterns over words and named entity tags. |
| Previous work | Hearst (1992) used a small number of regular expressions over words and part-of-speech tags to find examples of the hypernym relation. |
| Previous work | such as Ravichandran and Hovy (2002) and Pantel and Pennacchiotti (2006) use the same formalism of learning regular expressions over words and part-of-speech tags to discover patterns indicating a variety of relations. |