Lambek Calculus Proofs and Tree Automata

Tiede, Hans-Jörg

doi:10.1007/3-540-45738-0_15

Cited by 8 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have PT(G) ⊆ Parse(G). Tiede [16] explains that both PT(G) and Parse(G) are regular tree languages.…”

Section: Parse Trees and Languagesmentioning

confidence: 99%

Learning discrete categorial grammars from structures

Besombes¹,

Marion²

2008

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of discrete classical categorial grammars with linguistic examples.1991 Mathematics Subject Classification. 68Q32,68T50,03B47.In 1988, I was a student in "Maîtrise de Mathématques Discrêtes" at Lyon University, and Serge Grigorieff was one of my professors. I was fascinating by the course on computability that he gave. I followed him when he moved to the university Paris 7 and I made a master thesis on Kolmogorov complexity. Then I made a PhD thesis under his supervision. I got a lot out of our discussions and our works in his small office in Jussieu, and in particular the ability to ask questions and to study relationships between information, complexity and computability. We wrote together a paper on Kolmogorov complexity several years later, and I studied computational linguistic and grammatical inference, with the same spirit. This paper with Jérôme, which is my first PhD student, follows this line and is dedicated to him. I owe a lot to him and not only from a scientific point of view . . .

show abstract

“…We have PT(G) ⊆ Parse(G). Tiede [16] explains that both PT(G) and Parse(G) are regular tree languages.…”

Section: Parse Trees and Languagesmentioning

confidence: 99%

Learning discrete categorial grammars from structures

Besombes¹,

Marion²

2008

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

show abstract

“…In this area, Tiede (2001) has obtained interesting results, showing that while the Lambek systems (N)L are weakly CF, their expressivity in terms of strong capacity goes beyond that of CF grammars. Kanazawa (1998) has studied formal learning theory for categorial grammar within Gold's paradigm of identification in the limit on the basis of positive data.…”

Section: Generative Capacity and Computational Complexitymentioning

confidence: 99%

Categorial Grammar and Formal Semantics

Moortgat

2006

Encyclopedia of Cognitive Science

View full text Add to dashboard Cite

Categorial grammar is a lexicalized grammar formalism based on logical type theory. A categorial lexicon assigns one or more types to the atomic elements of a language; the assembly of form and meaning is accounted for in terms of the rules of inference for these types, seen as formulae of a grammar logic. Cross‐linguistic variation results from extending the invariant core of the grammar logic with facilities for structural reasoning.

show abstract

A Logic for Categorial Grammars: Lambek’s Syntactic Calculus

Moot¹,

Retoré²

2012

The Logic of Categorial Grammars

View full text Add to dashboard Cite

Lambek Calculus Proofs and Tree Automata

Cited by 8 publications

References 11 publications

Learning discrete categorial grammars from structures

Learning discrete categorial grammars from structures

Categorial Grammar and Formal Semantics

A Logic for Categorial Grammars: Lambek’s Syntactic Calculus

Contact Info

Product

Resources

About