Sciweavers

1054 search results - page 117 / 211
» A Formalization of the Turing Test
Sort
View
ICGI
2004
Springer
15 years 11 months ago
Partial Learning Using Link Grammars Data
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
Erwan Moreau
KI
2004
Springer
15 years 11 months ago
Generation of Sentence Parse Trees Using Parts of Speech
This paper proposes a new corpus-based approach for deriving syntactic structures and generating parse trees of natural language sentences. The parts of speech (word categories) of...
Tunga Güngör
DEXAW
2003
IEEE
99views Database» more  DEXAW 2003»
15 years 11 months ago
A Coloured Petri Net Trust Model
Public-key infrastructures are a prerequisite for security in distributed systems and for reliable electronic commerce. It is their goal to provide the authenticity of public keys...
Peter Lory
APLAS
2003
ACM
15 years 11 months ago
A Program Inverter for a Functional Language with Equality and Constructors
We present a method for automatic program inversion in a first-order functional programming language. We formalize the transformation and illustrate it with several examples inclu...
Robert Glück, Masahiko Kawabe
CL
2000
Springer
15 years 10 months ago
A Logic Programming Application for the Analysis of Spanish Verse
Logic programming rules are provided to capture the rules governing formal poetry in Spanish. The resulting logic program scans verses in Spanish to provide their metric analysis. ...
Pablo Gervás