File: function.levenshtein.html

package info (click to toggle)
php3 3%3A3.0.18-0potato1.1
  • links: PTS
  • area: main
  • in suites: potato
  • size: 17,736 kB
  • ctags: 11,198
  • sloc: ansic: 108,120; sh: 2,512; php: 2,024; yacc: 1,887; makefile: 1,038; perl: 537; pascal: 238; awk: 90; cpp: 28; sql: 11
file content (354 lines) | stat: -rw-r--r-- 5,733 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
<HTML
><HEAD
><TITLE
>levenshtein</TITLE
><META
NAME="GENERATOR"
CONTENT="Modular DocBook HTML Stylesheet Version 1.57"><LINK
REL="HOME"
TITLE="PHP Manual"
HREF="manual.html"><LINK
REL="UP"
TITLE="String functions"
HREF="ref.strings.html"><LINK
REL="PREVIOUS"
TITLE="join"
HREF="function.join.html"><LINK
REL="NEXT"
TITLE="ltrim"
HREF="function.ltrim.html"><META
NAME="HTTP_EQUIV"
CONTENT="text/html; charset=ISO-8859-1"></HEAD
><BODY
CLASS="refentry"
BGCOLOR="#FFFFFF"
TEXT="#000000"
LINK="#0000FF"
VLINK="#840084"
ALINK="#0000FF"
><DIV
CLASS="NAVHEADER"
><TABLE
WIDTH="100%"
BORDER="0"
CELLPADDING="0"
CELLSPACING="0"
><TR
><TH
COLSPAN="3"
ALIGN="center"
>PHP Manual</TH
></TR
><TR
><TD
WIDTH="10%"
ALIGN="left"
VALIGN="bottom"
><A
HREF="function.join.html"
>Prev</A
></TD
><TD
WIDTH="80%"
ALIGN="center"
VALIGN="bottom"
></TD
><TD
WIDTH="10%"
ALIGN="right"
VALIGN="bottom"
><A
HREF="function.ltrim.html"
>Next</A
></TD
></TR
></TABLE
><HR
ALIGN="LEFT"
WIDTH="100%"></DIV
><H1
><A
NAME="function.levenshtein"
>levenshtein</A
></H1
><DIV
CLASS="refnamediv"
><A
NAME="AEN36685"
></A
><P
>    (PHP3 CVS only, PHP4 &#62;= 4.0.1)</P
>levenshtein&nbsp;--&nbsp;
     Calculate Levenshtein distance between two strings		
    </DIV
><DIV
CLASS="refsect1"
><A
NAME="AEN36688"
></A
><H2
>Description</H2
><DIV
CLASS="funcsynopsis"
><A
NAME="AEN36690"
></A
><P
></P
><P
><CODE
><CODE
CLASS="FUNCDEF"
>int <B
CLASS="function"
>levenshtein</B
></CODE
> (string str1, string str2)</CODE
></P
><P
><CODE
><CODE
CLASS="FUNCDEF"
>int <B
CLASS="function"
>levenshtein</B
></CODE
> (string str1, string str2, int cost_ins, int cost_rep, int cost_del)</CODE
></P
><P
><CODE
><CODE
CLASS="FUNCDEF"
>int <B
CLASS="function"
>levenshtein</B
></CODE
> (string str1, string str2, function cost)</CODE
></P
><P
></P
></DIV
><P
>&#13;		 This function returns the Levenshtein-Distance between the
     two argument strings or -1, if one of the argument strings
     is longer than the limit of 255 characters (255 should be
		 more than enough for name or dictionary comparison, and 
     nobody serious would be doing genetic analysis with PHP).
    </P
><P
>&#13;     The Levenshtein distance is defined as the minimal number of
     characters you have to replace, insert or delete to transform
     <TT
CLASS="parameter"
><I
>str1</I
></TT
> into <TT
CLASS="parameter"
><I
>str2</I
></TT
>.
     The complexity of the algorithm is <TT
CLASS="literal"
>O(m*n)</TT
>,
     where <TT
CLASS="literal"
>n</TT
> and <TT
CLASS="literal"
>m</TT
> are the
     length of <TT
CLASS="parameter"
><I
>str1</I
></TT
> and
     <TT
CLASS="parameter"
><I
>str2</I
></TT
> (rather good when compared to
     <A
HREF="function.similar-text.html"
><B
CLASS="function"
>similar_text()</B
></A
>, which is O(max(n,m)**3),
     but still expensive).  
    </P
><P
>&#13;		 In its simpelest form the function will take only the two
     strings as parameter and will calculate just the number of
     insert, replace and delete operations needed to transform
     <TT
CLASS="parameter"
><I
>str1</I
></TT
> into <TT
CLASS="parameter"
><I
>str2</I
></TT
>.
    </P
><P
> 
		 A second variant will take three additional parameters that
		 define the cost of insert, replace and delete operations.
     This is more general and adaptive than variant one, but not
     as efficient.
		</P
><P
>  
		 The third variant (which is not implemented yet) will be
		 the  most general and adaptive, but also the slowest alternative.
		 It will call a user-supplied function that will determine the
		 cost for every possible operation.
		</P
><P
>&#13;		 The user-supplied function will be called with the following 
     arguments:
     <P
></P
><UL
><LI
><P
>&#13;		 	  operation to apply: 'I', 'R' or 'D'
       </P
></LI
><LI
><P
>&#13;		 	  actual character in string 1
       </P
></LI
><LI
><P
>&#13;			  actual character in string 2
       </P
></LI
><LI
><P
>&#13;			  position in string 1
       </P
></LI
><LI
><P
>&#13;		 	  position in string 2
       </P
></LI
><LI
><P
>&#13;			  remaining characters in string 1
       </P
></LI
><LI
><P
>&#13;			  remaining characters in string 2
       </P
></LI
></UL
>
		 The user-supplied function has to return a positive integer
		 describing the cost for this particular operation, but it
		 may decide to use only some of the supplied arguments.
		</P
><P
> 
		 The user-supplied function approach offers the possibility to
		 take into account the relevance of and/or difference between 
     certain symbols (characters) or even the context those symbols
     appear in to determine the cost of insert, replace and delete 
     operations, but at the cost of loosing all optimizations done
     regarding cpu register utilization and cache misses that have
     been worked into the other two variants. 
		</P
><P
>&#13;     See also <A
HREF="function.soundex.html"
><B
CLASS="function"
>soundex()</B
></A
>, 
     <A
HREF="function.similar-text.html"
><B
CLASS="function"
>similar_text()</B
></A
>
		 and <A
HREF="function.metaphone.html"
><B
CLASS="function"
>metaphone()</B
></A
>.
    </P
></DIV
><DIV
CLASS="NAVFOOTER"
><HR
ALIGN="LEFT"
WIDTH="100%"><TABLE
WIDTH="100%"
BORDER="0"
CELLPADDING="0"
CELLSPACING="0"
><TR
><TD
WIDTH="33%"
ALIGN="left"
VALIGN="top"
><A
HREF="function.join.html"
>Prev</A
></TD
><TD
WIDTH="34%"
ALIGN="center"
VALIGN="top"
><A
HREF="manual.html"
>Home</A
></TD
><TD
WIDTH="33%"
ALIGN="right"
VALIGN="top"
><A
HREF="function.ltrim.html"
>Next</A
></TD
></TR
><TR
><TD
WIDTH="33%"
ALIGN="left"
VALIGN="top"
>join</TD
><TD
WIDTH="34%"
ALIGN="center"
VALIGN="top"
><A
HREF="ref.strings.html"
>Up</A
></TD
><TD
WIDTH="33%"
ALIGN="right"
VALIGN="top"
>ltrim</TD
></TR
></TABLE
></DIV
></BODY
></HTML
>