7. The computer-implemented method of claim 6 , wherein said text-alignment algorithm comprises a version of a Needleman-Wunsch algorithm for text alignment of two sequences of text strings.
7. The computer-implemented method of claim 6 , wherein said text-alignment algorithm comprises a version of a Needleman-Wunsch algorithm for text alignment of two sequences of text strings. 8. The computer-implemented method of claim 7 , wherein said version of the Needleman-Wunsch algorithm is weighted such that said performing the version of the Needleman-Wunsch algorithm on the sequence of text strings from the textual description of the particular item and the other sequence of text strings from the textual description of the given item penalizes a gap detected between the two sequences more than a mismatch detected between the two sequences of text strings.