We propose 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 weights to proof 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 (for humans)” or “more coherent (combining words that make sense together)”. The resulting system of weighted theorem proving can be implemented either as a best-first proof serach strategy or as a polynomial-time approximation of proof search for NP-complete parsing problems.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We introduce the notion of derived tree corresponding with a derivation in the nonassociative Lambek calculus with product, and examine languages of derived trees determined by categorial grammars employing the calculus as a type reduction system. We prove that the class of derived tree languages of nonassociative Lambek grammars with product contains only regular tree languages.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.