Jump to content

Talk:Approximate string matching

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nanobear~enwiki (talk | contribs) at 23:52, 27 December 2008 (Expanding: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing Stub‑class
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
Note icon
This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

This article says "transpositions" are not considered primitive operations. What is a transposition? Danielx 05:39, 13 August 2006 (UTC)[reply]

A transposition is a swap in the position of two letters. I've added the definition to the article.Bill 16:51, 7 September 2006 (UTC)[reply]

Serious flaw?

In the article, one sentence is "For example, if the pattern is coil, foil differs by one substitution, coils by one insertion, oil by one deletion, and coal by two subsitutions." "coil" and "coal" differ by 2 subsitutions? How? I can only see the "i" is subsitute by "a".

Yes, you're right. "coal" should have been "foal". I've fixed it.Bill 16:51, 7 September 2006 (UTC)[reply]

Citations needed

I've flagged the assertions in this article that likely hold "as is" or with some rewording with {{citationneeded}} tags, but which I feel would be best backed up with specific citations. The citationneeded tags are not intended to be challenges -- I won't be removing the assertions.

I'll see what I can do about tracking down some specific citations in the spirit of {{sofixit}}. -- QTJ 21:15, 10 November 2006 (UTC)[reply]

Expanding

I think this article should be expanded somewhat. I'd like to have at least 1) a formal definition of the problem, 2) a brute-force algorithm, 3) a better algorithm (which one?)

Any suggestions? Offliner (talk) 23:52, 27 December 2008 (UTC)[reply]