Sciweavers

120 search results - page 8 / 24
» How Much Can We Gain from Supervised Word Alignment
Sort
View
ACL
1992
13 years 11 months ago
Estimating Upper and Lower Bounds on the Performance of Word-Sense Disambiguation Programs
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
William A. Gale, Kenneth Ward Church, David Yarows...
IEEEMSP
2002
IEEE
118views Multimedia» more  IEEEMSP 2002»
14 years 3 months ago
Similarity matching of continuous melody contours for humming querying of melody databases
Music query-by-humming is a challenging problem since the humming query inevitably contains much variation and inaccuracy. Many of the previous methods, which adopt note segmentat...
Yongwei Zhu, Mohan S. Kankanhalli, Qi Tian
WWW
2011
ACM
13 years 5 months ago
Web scale NLP: a case study on url word breaking
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
Kuansan Wang, Christopher Thrasher, Bo-June Paul H...
PKDD
2004
Springer
324views Data Mining» more  PKDD 2004»
14 years 3 months ago
Orange: From Experimental Machine Learning to Interactive Data Mining
Abstract. Orange (www.ailab.si/orange) is a suite for machine learning and data mining. It can be used though scripting in Python or with visual programming in Orange Canvas using ...
Janez Demsar, Blaz Zupan, Gregor Leban, Tomaz Curk
NIPS
2001
13 years 11 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning