crappy-fzf.ijs - apl J lang - levenshtein distance based best match finding

crappy-fzf.ijs

#!/usr/bin/env jconsole

NB. https://code.jsoftware.com/wiki/Essays/Levenshtein_Distance


NB. version producing only scalar distance
levdist=: 4 : 0 " 1
 'a b'=. (/: #&>)x;y
 z=. >: iz =. i.#b
 for_j. a do.
  z=. <./\&.(-&iz) (>: <. (j ~: b) + |.!.j_index) z
 end.
 {:z
)

NB.'sitting' levdist 'kitten'

NB. https://code.jsoftware.com/wiki/Phrases/Strings
strsplit=: #@[ }.each [ (E. <;.1 ]) ,

NB. https://code.jsoftware.com/wiki/JPhrases/InsideBoxes
NB. # &.> a  NB. a0=: each=: &.> Apply verb to each box
lines =: LF strsplit stdin''

word1 =: {.2}.ARGV
NB. get levenshtein distance from argv for each line of stdin
levdistances =: word1 levdist &.> lines

echo 'levenshtein distances';'search word:';word1
echo 'lines';lines
echo 'levdistances';levdistances NB. ;lines

bestmatch_index =: (i. <./) >levdistances
echo 'bestmatch_index';bestmatch_index

bestmatch =: >bestmatch_index { lines
echo 'bestmatch';bestmatch

exit''