# doc-cache created by Octave 7.3.0
# name: cache
# type: cell
# rows: 3
# columns: 2
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 13
fuzzy_compare


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 1560
 -- Command: [RES] = fuzzy_compare ("STRING1", STRING_SET,
          [CORRECTNESS])

     Compare a string with a set of strings and returns the positions in
     the set of strings at which there are the fields that best fit the
     one we are comparing.

     The distance used to compare the words is the Levenshtein distance
     and for more details see
     <http://en.wikipedia.org/wiki/Levenshtein_distance>.

     This function must be called with one output argument RES which
     contains the positions of the elements in STRING_SET which best fit
     the given word.  The tolerance that is used to determine if a field
     of the list fits or not the given word is a function of the length
     of the word and of the minimum distance of the word from all the
     elements of the list.  The more the length, the more the tolerance.
     The less the minimum, the less the tolerance but if the minimum is
     close to the length of the word, the tolerance must be small
     because it means that no field in the list is really fitting the
     given word.  So that the function is:

     tolerance = 2 * (length-minimum) * minimum / length.

     The first input argument must be a string containing the word to
     compare.

     The second input argument must be a vector of strings or a
     cell_array of strings and should contain the fields to use for the
     comparison.

     The third input argument is optional and represents a fixed
     tolerance that will replace the implemented one.

     See also: odeset,odeget,levenshtein.


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 80
Compare a string with a set of strings and returns the positions in the
set o...



# name: <cell-element>
# type: sq_string
# elements: 1
# length: 11
levenshtein


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 912
 -- Command: [DIST] = levenshtein ("STRING1", "STRING2", [UPPER_BOUND])
 -- Command: [DIST, D] = levenshtein ("STRING1", "STRING2",
          [UPPER_BOUND])

     This function file can be used to compare two strings and it uses
     the Levenshtein distance as definition of metric between strings.
     More details at
     <http://en.wikipedia.org/wiki/Levenshtein_distance>.

     This function must be called with two output arguments: DIST is the
     distance between the two strings and D is the matrix computed by
     Levenshtein algorithm.

     The first and the second input arguments are the two strings to be
     compared.  This comparison is case-sensitive.

     The third argument is optional and fixes an upper bound for the
     distance.  If the distance is greater than this limit then the
     function ends and returns a value equal to Inf.

     See also: odeset, odeget, fuzzy_compare.


# name: <cell-element>
# type: sq_string
# elements: 1
# length: 80
This function file can be used to compare two strings and it uses the
Levensh...





