Search Sciweavers | Sciweavers

19

ICGI
1998
Springer

124views Natural Language Processing» more ICGI 1998»

13 years 9 months ago

In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...

Isabelle Tellier

claim paper

Read More »

15

click to vote

LACL
1998
Springer

113views Automated Reasoning» more LACL 1998»

Lambek Calculus Proofs and Tree Automata

13 years 9 months ago

Download www.iwu.edu

Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...

Hans-Jörg Tiede

claim paper

Read More »

9

click to vote

IANDC
1998

70views more IANDC 1998»

The Generating Power of Total Deterministic Tree Transducers

13 years 5 months ago

Download www.cse.unsw.edu.au

ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...

Sebastian Maneth

claim paper

Read More »

10

click to vote

ACL
1998

90views Computational Linguistics» more ACL 1998»

Prefix Probabilities from Stochastic Tree Adjoining Grammars

13 years 6 months ago

Download acl.ldc.upenn.edu

Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta

claim paper