Maria Teresa Pazienza

Learn More
Are linguistic properties and behaviors important to recognize terms? Are statistical measures effective to extract terms? Is it possible to capture a sort of termhood with computation linguistic techniques? Or maybe, terms are too much sensitive to exogenous and pragmatic factors that cannot be confined in computational linguistic? All these questions are(More)
[11] Dan Klein and Christopher D. Manning. Fast exact inference with a factored model for natural language parsing. Another more practical line of activity includes an error analysis to identify the classes of errors done by the two algorithms, so that strategies to cope with them can be designed. For Collins' parsers this would imply the introduction of(More)
In this paper we investigate a novel method to detect asymmetric entailment relations between verbs. Our starting point is the idea that some point-wise verb selectional preferences carry relevant semantic information. Experiments using WordNet as a gold standard show promising results. Where applicable, our method, used in combination with other(More)
In this paper we define a measure for textual entailment recognition based on the graph matching theory applied to syntactic graphs. We describe the experiments carried out to estimate measure’s parameters with SVM and we report the results obtained on the Textual Entailment Challenge development and testing set.
Natural language processing will not be able to compete with traditional information retrieval unless high-coverage techniques are developed. It is commonly agreed that a poor encoding of the semantic lexicon is the bottleneck of many existing systems. A hand encoding of semantic knowledge on an extensive basis is not realistic; hence, it is important to(More)