Dan Gilmor: Key battles forge fate of free software

 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Dan Gilmor: Key battles forge fate of free software
# 1  
Old 05-23-2003
Dan Gilmor: Key battles forge fate of free software

http://www.siliconvalley.com/mld/sil...or/5911376.htm

FREEDOM DINGED: The free-software movement has surmounted all kinds of obstacles in its short history, moving from a political statement to a prominent position inside the world's largest companies............(see link above)
Login or Register to Ask a Question

Previous Thread | Next Thread

3 More Discussions You Might Find Interesting

1. Cybersecurity

Free Radius Software (GNU)

hi i have heared that there is a package called freeradius used for authenticating!!! actually i want to learn more about it but i cant find details on how to use it? is it based on client server model i.e should i have to install in both client and the server machines ? i am... (2 Replies)
Discussion started by: u.n.i.x
2 Replies

2. UNIX for Dummies Questions & Answers

Free unix software

I used to have a free software on my computer to practice unix. Unfortunately, I had to rebuild the laptop after it was infected by a virus. Now I cannot remember the website where to download the software. Can anyone point me to a site? Thanks! (2 Replies)
Discussion started by: Ernst
2 Replies

3. UNIX Desktop Questions & Answers

want to know hot to get free unix software

:mad: :confused: (1 Reply)
Discussion started by: rolando
1 Replies
Login or Register to Ask a Question
LevenshteinXS(3pm)					User Contributed Perl Documentation					LevenshteinXS(3pm)

NAME
Text::LevenshteinXS - An XS implementation of the Levenshtein edit distance SYNOPSIS
use Text::LevenshteinXS qw(distance); print distance("foo","four"); # prints "2" print distance("foo","bar"); # prints "3" DESCRIPTION
This module implements the Levenshtein edit distance in a XS way. The Levenshtein edit distance is a measure of the degree of proximity between two strings. This distance is the number of substitutions, deletions or insertions ("edits") needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same. A good point to start is: <http://www.merriampark.com/ld.htm> CREDITS
All the credits go to Vladimir Levenshtein the author of the algorithm and to Lorenzo Seidenari who made the C implementation <http://www.merriampark.com/ldc.htm> SEE ALSO
Text::Levenshtein , Text::WagnerFischer , Text::Brew , String::Approx AUTHOR
Copyright 2003 Dree Mistrut <dree@friul.it> Modifications Copyright 2004 Josh Goldberg <josh@3io.com> This package is free software and is provided "as is" without express or implied warranty. You can redistribute it and/or modify it under the same terms as Perl itself. perl v5.14.2 2004-06-29 LevenshteinXS(3pm)