In this paper we describe a rule-based formalism for the analysis and labelling of texts segments. The rules are contextual rewriting rules with a restricted form of negation. They allow to underspecify text segments not considered relevant to a given task and to base decisions upon context. A parser for these rules is presented and consistence and completeness issues are discussed. Some results of an implementation of this parser with a set of rules oriented to the segmentation of texts in propositions are shown.
CITATION STYLE
Wonsever, D., & Mine, J. L. (2001). Contextual rules for text analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2004, pp. 509–523). Springer Verlag. https://doi.org/10.1007/3-540-44686-9_52
Mendeley helps you to discover research relevant for your work.