Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Shallow parsing based on comma values
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
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.