Sciweavers

170 search results - page 23 / 34
» Parsing with Non-Deterministic Functions
Sort
View
TREC
2001
13 years 8 months ago
The QUANTUM Question Answering System
We participated to the TREC-X QA main task and list task with a new system named QUANTUM, which analyzes questions with shallow parsing techniques and regular expressions. Instead...
Luc Plamondon, Guy Lapalme, Leila Kosseim
ACL
1998
13 years 8 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...
CVPR
2008
IEEE
14 years 9 months ago
Recognition by association via learning per-exemplar distances
We pose the recognition problem as data association. In this setting, a novel object is explained solely in terms of a small set of exemplar objects to which it is visually simila...
Tomasz Malisiewicz, Alexei A. Efros
TBILLC
2007
Springer
14 years 1 months ago
A Computational Grammar for Georgian
In this paper, I give an overview of an ongoing project which aims at building a full-scale computational grammar for Georgian in the Lexical Functional Grammar framework and try t...
Paul Meurer
JMLR
2008
230views more  JMLR 2008»
13 years 7 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...