Return-Path: X-Original-To: apmail-commons-dev-archive@www.apache.org Delivered-To: apmail-commons-dev-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id E9814105B9 for ; Fri, 17 Jan 2014 20:32:37 +0000 (UTC) Received: (qmail 69046 invoked by uid 500); 17 Jan 2014 20:32:34 -0000 Delivered-To: apmail-commons-dev-archive@commons.apache.org Received: (qmail 68967 invoked by uid 500); 17 Jan 2014 20:32:34 -0000 Mailing-List: contact dev-help@commons.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: "Commons Developers List" Delivered-To: mailing list dev@commons.apache.org Received: (qmail 68958 invoked by uid 99); 17 Jan 2014 20:32:34 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 17 Jan 2014 20:32:34 +0000 X-ASF-Spam-Status: No, hits=1.5 required=5.0 tests=HTML_MESSAGE,RCVD_IN_DNSWL_LOW,SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (athena.apache.org: domain of ted.dunning@gmail.com designates 209.85.223.170 as permitted sender) Received: from [209.85.223.170] (HELO mail-ie0-f170.google.com) (209.85.223.170) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 17 Jan 2014 20:32:28 +0000 Received: by mail-ie0-f170.google.com with SMTP id u16so4219208iet.29 for ; Fri, 17 Jan 2014 12:32:08 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :content-type; bh=ubss9OCDAB7QgolOpghH1EzSErAExdgD2Eds1ZFiQp8=; b=VIY1eSCo2qJCp48Ywi5IXGf+AJuR3GW4Du2+4SgwKhfJg+48qfzlRGnRSCIgR08Dc9 ID0SGPILLeb+7DI7uF+R26HsB6Vj1adveaHQOscfIPMlzMt6mYJIm+mohl+C7BqbwKh9 YFD9C7ZUkvqiL+9sK6wUx9klwUR8KwIrMbrPod2xXOenB0qhOdLLDeQuT6+RRRxc79cY tl0BAOucAkf3EZBmOVNXw51a+49nIJTxoRNnR4KO5Iwz5ed0R5o81f2WsCgi7hzNB/Ic 5vgJquhTzKKf97mwV1igmsH1vIcF/39Kt/E6kP+ds+4Qz7mu857kN0+otrYmt+cinXNN hI2g== X-Received: by 10.50.4.9 with SMTP id g9mr367515igg.22.1389990728181; Fri, 17 Jan 2014 12:32:08 -0800 (PST) MIME-Version: 1.0 Received: by 10.64.87.231 with HTTP; Fri, 17 Jan 2014 12:31:38 -0800 (PST) In-Reply-To: References: <52D6F340.5070305@oliver-heger.de> From: Ted Dunning Date: Fri, 17 Jan 2014 12:31:38 -0800 Message-ID: Subject: Re: [LANG] New class called StringAlgorithms? To: Commons Developers List Content-Type: multipart/alternative; boundary=001a11c3184e982f4704f0306fa1 X-Virus-Checked: Checked by ClamAV on apache.org --001a11c3184e982f4704f0306fa1 Content-Type: text/plain; charset=UTF-8 On Fri, Jan 17, 2014 at 4:11 AM, Benedikt Ritter wrote: > > A concrete use case could be a query engine which allows customizing its > > string matching algorithm. > > > > Is this really a use case? It sounds very constructed to me. Have you ever > thought "I'd like to query on google, but I'd like suggestions to be > matched using Levenshtein Distance algorithm"? > This is definitely a use case. Furthermore, Levenshtein distance is often parametrized with edit costs and possible an edit cost matrix. Tuning a system for best accuracy by injecting alternative distance functions is a common activity whether in a spelling suggestion system or DNA alignment program. --001a11c3184e982f4704f0306fa1--