| |
|
|
p.specht
| Unscharfe String-compare ===================== it is not integrally simply, Inputs with Tippfehlern of computer nevertheless award let. The Levenshtein-Algorithmus allows at least, simple Preller or. Auslassungen To discern. something rather is with Databases The SOUNDEX-function, The though mostly for english optimiert is.
the yellow of egg is the Original-Levenshtein anyway not yet. it missing z.B. a Änderung the "Kostenbewertung" (Variable cost&) in dependence of possible Hörfehlern (y,ü,i,j ; sh sch ; t d ; p b; k g; h _ ), and much other More. here first time a Base-Proc to that rumspielen:
'### P. woodpecker Nov. 2010; XProfan 11a Interpreter ###
Window Title "Levenshtein-distance (Stringvergleich)"
Cls @rgb(200,200,100)
print " EINGABETEIL SELBST GESTALTEN!"
waitinput
END
proc LD' Compute Levenshtein-Distance
parameters s$,t$
s$=lower$(s$):var m&=len(s$)
t$=lower$(t $):var n&=len(t $)
declare d&[m&,n&],i&,j&,cost&,mi&,c&
case m& = 0 : return n&
case n& = 0 : return m&
i&=0 : while i&<=m& : d&[i&,0]=i& : inc i& : endwhile
j&=0 : while j&<=n& : d&[0,j&]=j& : inc j& : endwhile
i&=1
WHILE i&<=m&
j&=1
While j&<=n&
cost&=1
case Mid$(s$,i&,1)=Mid$(t$,j&,1):cost& = 0
mi&=d&[i&-1,j&]+1
c&=d&[i&,j&-1]+1
case c&<mi& : mi&=c&
c&=d&[i&-1,j&-1]+cost&
case c&<mi& : mi&=c&
d&[i&,j&]=mi&
inc j&
EndWhile
inc i&
ENDWHILE
return d&[m&,n&]
Endproc
|
|
|
| XProfan 11Computer: Gerät, daß es in Mikrosekunden erlaubt, 50.000 Fehler zu machen, zB 'daß' statt 'das'... | 04/10/21 ▲ |
|
|
|
|
RudiB. |
Unscharfe String-compare
the hears itself almost as Heisenbergsche Unschärfe-Relation on. is me To high....sound however very interestingly. but this is a problem not time Date with its mighty machines so really To 100% umsetzen can. and the are there Yes now really well.... have me already of these trouble rumgeschlagen. there's particularly time, if you a letters To plenty or Zuwenig in the string/word have, then have You really already lost....there goes only approach and probability . is difficult...... |
|
|
| |
|
|
|
p.specht
| there could you too Michael Wodrichs Umsetzung the undertow. "KÖLNER PHONETIK" help! board-Suchbegriff: Kölner Phonetik Soundex greeting
P.s.: Date using whom MCPA-Algorithmus, velvet adaptiven Improvements. Description (engl.) on the 2021-04-14 yet here: [...] |
|
|
| Computer: Gerät, daß es in Mikrosekunden erlaubt, 50.000 Fehler zu machen, zB 'daß' statt 'das'... | 04/14/21 ▲ |
|
|
|
|
Michael W. | under "Soundexing" and "Phonetik" there with Wikipedia so some above. |
|
|
| |
|
|
|
p.specht
| too of Michael there were something to Kölner Phonetik: [...] |
|
|
| XProfan 11Computer: Gerät, daß es in Mikrosekunden erlaubt, 50.000 Fehler zu machen, zB 'daß' statt 'das'... | 05/08/21 ▲ |
|
|
|