1999 search results - page 53 / 400 » Dependently Typed Grammars |
ISMIR
2004
Springer
15 years 7 months ago
2004
Springer
Pregroups had been conceived as an algebraic tool to recognize grammatically well-formed sentences in natural languages [3]. Here we wish to use pregroups to recognize well-formed...
107
click to vote
ACL
2009
14 years 11 months ago
2009
This paper describes a parsing model for speech with repairs that makes a clear separation between linguistically meaningful symbols in the grammar and operations specific to spee...
108
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
136
click to vote
STACS
2004
Springer
15 years 7 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
124
click to vote
CATS
2007
15 years 3 months ago
2007
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...