Elamur Research⌕
☰
home / papers / 2007 / SVO triple based Latent Semantic Analysis for recognising textual entailment

SVO triple based Latent Semantic Analysis for recognising textual entailment

Paper · 2007 · Gaston Burek, Christian Pietsch and Anne De Roeck

Summary

The paper addresses the RTE-3 task, which asks whether a text T supports the conclusion that a hypothesis H is true. The authors argue that earlier uses of Latent Semantic Analysis for entailment were weakened by treating text as an unordered bag of words, so they make LSA aware of grammatical role. They parsed the Reuters News Corpus with Minipar and extracted subject–verb–object triples through a small AWK and Prolog pipeline. Each word in a triple was stemmed with Snowball and tagged with its role. Co-occurrence counts within triples fed three separate matrices, one each for subjects, verbs and objects, and each matrix was reduced by SVD to 200 dimensions. For each pair, every n-gram of T and H is projected into these spaces. The best match per slot gives three similarity scores, and a hand-tuned weighted threshold makes the decision. The prototype scored 0.5638 accuracy on the development set and 0.5500 on test, modestly above chance. The authors say it beats an earlier LSA entailment system and shows that structured input helps even purely distributional methods.

Key points

  • Data: the RTE-3 development set has 800 T–H pairs, half of them positive, spread over the IE, IR, QA and SUM sub-tasks. The sub-task labels were ignored. The only knowledge source was the Reuters corpus (RCV1).
  • SVO extraction from Minipar triples covers four clause types:
    • intransitive clauses get an empty object slot;
    • ditransitive clauses become two triples, the second with an empty verb plus the indirect object;
    • predicatives are treated like transitive clauses.
  • The matrices were cut to 1000 × 5000 because SVDLIBC (LAS2) never finished on a 5000 × 5000 matrix and failed with "imtqlb failed to converge". The 1000 row stems split into 347 subject, 356 verb and 297 object stems.
  • Scoring: average slot similarity is higher for entailing pairs, e.g. subject 0.244 vs 0.196 and object 0.323 vs 0.277. Verb scores are much lower overall. Each slot score is divided by its average, subject and object get weight 3 (σ = ω = 3), and entailment is predicted when q > 14.
  • Accuracy was 0.5638 on development and 0.5500 on test. The model is symmetric, so it cannot tell that T entails H from H entailing T.

Interesting ideas

  • I1. Build a separate distributional space per grammatical role instead of one shared space, so a word used as an agent is compared only with other agents.
  • I2. Compare two texts slot by slot, taking the maximum similarity per role, then divide each slot score by its own corpus average before combining. This stops a naturally low-scoring slot like the verb from being drowned out.
  • I3. Encode argument structures as fixed slots with explicit empty fillers: an intransitive clause keeps an empty object, and a ditransitive clause is split into two linked triples.
  • I4. When the structural extractor cannot handle a construction, such as clauses embedded inside other clauses, fall back to enumerating candidate spans and let a scoring step choose among them.
  • I5. Handle the direction of entailment by checking whether the hypothesis words are more general than the text words, using term frequency as a proxy for specificity.

For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

  • I1 (world): role-split similarity tables in the compiled knowledge could rank candidate matches between entities and predicates more sharply than a single role-blind embedding.
  • I2 (answer): when checking a question frame against text frames, per-role normalised scores would make agent, predicate and patient evidence comparable and easy to explain.
  • I3 (frames): a uniform frame shape with explicit "no filler" markers keeps downstream matching simple and makes missing arguments visible rather than silently absent.
  • I4 (frames): spans taken from the UD subtree could serve as a logged, explainable fallback filler wherever frame extraction fails on nested clauses.
  • I5 (answer): an asymmetric check of general versus specific, backed by WordNet hypernymy or frequency, could stop the reader from accepting a specific claim from a vaguer text.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

 Institutions

 Fields, topics and concepts

📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 16,667 worksArtificial Intelligence · 16,194 worksArts and Humanities · 16,039 worksLanguage and Linguistics · 15,891 works

🧭 Topics 1Research subjects and languages the work is about.Reasoning · 1,426 works

Cite

Cite as Gaston Burek, Christian Pietsch and Anne De Roeck. 2007. SVO triple based Latent Semantic Analysis for recognising textual entailment. Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing.

The paper itself, not this page. BibTeX from the library's record of the work.

@inproceedings{burek2007svo,
  title = {{SVO triple based Latent Semantic Analysis for recognising textual entailment}},
  author = {Gaston Burek, Christian Pietsch and Anne {De Roeck}},
  booktitle = {Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
  year = {2007},
  doi = {10.3115/1654536.1654559},
  url = {https://doi.org/10.3115/1654536.1654559}
}

References

7 references, 1 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. M. W. Berry. 1992. Large-scale sparse singular value computations. The International Journal of Supercomputer Applications, 6(1):13–49, Spring. ↗
  2. Daoud Clarke. 2006. Meaning as context and subsequence analysis for entailment. In Proceedings of the Second PASCAL Challenges Workshop on Recognising Textual Entailment, Venice, Italy. find
  3. D. D. Lewis, Y. Yang, T. Rose, and F. Li. 2004. RCV1: A new benchmark collection for text categorization research. Journal of Machine Learning Research, 5:361–397. ↗
  4. Dekang Lin. 1994. PRINCIPAR – an efficient, broad-coverage, principle-based parser. In Proc. COLING-94, pages 42–488, Kyoto, Japan. ↗
  5. M. F. Porter. 1980. An algorithm for suffix stripping. Program, 14(3):130–137. ↗
  6. G. Salton, A. Wong, and C. S. Yang. 1975. A vector space model for automatic indexing. Commun. ACM, 18(11):613–620. ↗
  7. Karen Spärck Jones. 1972. A statistical interpretation of term specificity and its application in retrieval. Journal of Documentation, 28(1):11– 21. Reprinted 2004 in 60(5):493–502 and in Spärck Jones (1988). ↗

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/burek-2007-svo-triple-based-latent-semantic/