Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Lambek calculus

Sortuj według:

Ogranicz wyniki do:

Combining logical and distributional methods in type-logical grammars

Moot R.

Journal of Language Modelling

2018

Vol. 6, No. 2

287--317

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.

Derived Tree Languages of Nonassociative Lambek Categorial Grammars with Product

Kandulski M.

Fundamenta Informaticae

2003

Vol. 55, nr 3,4

349-362

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.