Combining logical and distributional methods in type-logical grammars

Richard Moot 1
1 TEXTE - Exploration et exploitation de données textuelles
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : In this paper, we will look at a low-level way of combining distributional and logical ideas into a single formal system. This will be an instantiation of a more general system, adding weight stop roof rules. These weights will not measure some sort of “confidence the proof is valid”, but rather act as a way to prefer some proofs over others, where preference can mean “easier to process (forhumans)” or “more coherent (combining words that make sense together)”. There sulting system of weighted theorem proving can be implemented either as a best-first proof search strategy or asapolynomial-time approximation of proof search for NP-complete parsing problems.
Document type :
Journal articles
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download
Contributor : Richard Moot <>
Submitted on : Wednesday, November 29, 2017 - 10:29:05 AM
Last modification on : Thursday, May 16, 2019 - 8:22:01 PM


Files produced by the author(s)


  • HAL Id : lirmm-01651508, version 1



Richard Moot. Combining logical and distributional methods in type-logical grammars. Journal of Language Modelling, Institute of Computer Science, Polish Academy of Sciences, Poland, 1970. ⟨lirmm-01651508⟩



Record views


Files downloads