Sciweavers

205 search results - page 14 / 41
» A CCG Approach to Free Word Order Languages
Sort
View
LREC
2010
219views Education» more  LREC 2010»
13 years 9 months ago
Approaches to Text Mining Arguments from Legal Cases
Abstract. This paper describes recent approaches using text-mining to automatically profile and extract arguments from legal cases. We outline some of the background context and mo...
Adam Wyner, Raquel Mochales Palau, Marie-Francine ...
TASLP
2002
86views more  TASLP 2002»
13 years 7 months ago
High-level approaches to confidence estimation in speech recognition
Abstract--We describe some high-level approaches to estimating confidence scores for the words output by a speech recognizer. By "high-level" we mean that the proposed me...
Stephen Cox, Srinandan Dasmahapatra
CL
2000
Springer
13 years 7 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
POPL
2004
ACM
14 years 8 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
FPCA
1989
13 years 12 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler