Levenshtein Edit Distance Between Strings

Posted by Cleve Moler,

How can you measure the distance between two words? How can you find the closest match to a word in a list of words? The Levenshtein distance between two strings is the number of single character deletions, insertions, or substitutions required to transform one string into the other. This is also known as the edit distance.... read more >>

Latent Semantic Indexing, SVD, and Zipf’s Law 5

Posted by Cleve Moler,

Latent Semantic Indexing, LSI, uses the Singular Value Decomposition of a term-by-document matrix to represent the information in the documents in a manner that facilitates responding to queries and other information retrieval tasks. I set out to learn for myself how LSI is implemented. I am finding that it is harder than I thought.... read more >>

Householder Seminar HHXX on Numerical Linear Algebra 2

Posted by Cleve Moler,

The Householder meetings on Numerical Linear Algebra have been held roughly every three years since 1961. The twentieth, with the logo HHXX, was held June 18th through 23rd at Virginia Tech in Blacksburg, Virginia. I've been to 17 of the meetings. They have been an important part of my professional life and I've written Cleve's Corner articles and blog posts about them, MathWorks News & Notes, and Householder XIX.... read more >>

My Erdös Number and My Trump Number 3

Posted by Cleve Moler,

I've long known that my Erdös Number is 3. This means that the length of the path on the graph of academic coauthorship between me and mathematician Paul Erdös is 3. Somewhat to my surprise, I recently discovered that I can also trace a chain of coauthorship to Donald J. Trump. My Trump number is 5.... read more >>

These postings are the author's and don't necessarily represent the opinions of MathWorks.