On Some Aspects of Implementing a Pattern Engine based on Regular Expressions over Feature Structures
Recently, we have witnessed an emergence of information extraction oriented pattern specification languages, most of which exploit finite-state devices. This paper focus on some aspects of implementing a pattern engine, whose rules are regular expressions over flat feature structures.
In particular, a method for efficiently processing such patterns is described.
PISKORSKI Jakub;
2008-05-21
Institute for Parallel Processing (IPP), Bulgarian Academy of Sciences
JRC38214
Additional supporting files
| File name | Description | File type | |
|---|
