Sciweavers

704 search results - page 65 / 141
» A Note on Typing Feature Structures
Sort
View
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 9 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
118
Voted
ICFP
2010
ACM
15 years 3 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
119
Voted
ACL
1998
15 years 3 months ago
HPSG-Style Underspecified Japanese Grammar with Wide Coverage
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
Yutaka Mitsuishi, Kentaro Torisawa, Jun-ichi Tsuji...
IJCNLP
2005
Springer
15 years 8 months ago
Relation Extraction Using Support Vector Machine
This paper presents a supervised approach for relation extraction. We apply Support Vector Machines to detect and classify the relations in Automatic Content Extraction (ACE) corpu...
Gum-Won Hong
152
Voted
ECOOP
1992
Springer
15 years 6 months ago
An Object-Oriented Language-Database Integration Model: The Composition-Filters Approach
This paper introduces a new model, based on so-called object-composition filters, that uniformly integrates database-like features into an object-oriented language. The focus is o...
Mehmet Aksit, Lodewijk Bergmans, Sinan Vural