8 Kicks

String comparison algorithm (likeness)(alexandermp.com)

submitted by alexandermpalexandermp(110) 1 year, 8 months ago

Compare strings. How much alike are 2 strings. Pseudo semantic analysis. Levenshtein distance.

1 comment |category: |Views: 403

tags: another

new Add a live kick counter to your blog >> liveImage

You can even customize the image by choosing your own colors, and then clicking the button below to update the preview and the html code:

  • "Kick It" text
  • "Kick It" background
  • kick count text
  • kick count background
  • border

Simply copy and paste this HTML into your blog post.


Users who kicked this story:
flyingkickflyingkick(331) - mgrovesmgroves(260) - WidescreenWidescreen(105) - dvhhdvhh(2)
More who kicked this story...
Comments:

posted by dvhhdvhh(2) 1 year, 8 months ago 0

thecomment system on the site is broken returned an error on a callback (didn't dig further )
however the wikipedia entry (http://en.wikipedia.org/wiki/Levenshtein_distance) specifies some obvious optimization of the levenshtein distance algorithm
you can store only the current and previous row to minimize memory requirement. thus optimizing the memory allocation for your calculations:
http://pastebin.ca/1945598

Reply

information Login or create an account to comment on this story
Submit a Story
View upcoming stories
How else can I help?
Add our feeds to your site

Most Active Users

What's this?