Sciweavers

44 search results - page 9 / 9
» On-line Approximate String Matching in Natural Language
Sort
View
ICALP
2011
Springer
12 years 9 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
CORR
2000
Springer
84views Education» more  CORR 2000»
13 years 5 months ago
Using a Diathesis Model for Semantic Parsing
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...
Jordi Atserias, Irene Castellón, Montse Civ...
IIS
2003
13 years 7 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 7 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh