burning my hair
woohoo
					woohoo
 
							
						



 Do you care to test the latter hypothesis? 

							
						
"

							
						
 Many current implementations of fuzzy search are based on the Levenshtein distance - a metric defined on the space of words of an alphabet. Pattern recognition is based on - or can be modeled as - the distance - i.e.difference/similarity - of two patterns. A fuzzy search based on the Levenshtein distance can be used to recognize patterns. When I noticed the permutation of characters etc...in the text of your post, I automatically thought of the Levenshtein distance! 

							
						
Comment