681 search results - page 46 / 137 » Parsing as Natural Deduction |
108
click to vote
CICLING
2003
Springer
15 years 3 months ago
2003
Springer
In this work1 we obtain robust category-based language models to be integrated into speech recognition systems. Deductive rules are used to select linguistic categories and to matc...
LACL
1998
Springer
15 years 1 months ago
1998
Springer
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...
IANDC
2006
14 years 9 months ago
2006
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
JAR
2007
14 years 9 months ago
2007
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
110
click to vote
ICMI
2003
Springer
15 years 2 months ago
2003
Springer
Many user interfaces, from graphic design programs to navigation aids in cars, share a virtual space with the user. Such applications are often ideal candidates for speech interfa...