English dictionary fun

[blue]master #[/blue] grep -xE '[qwertyuiop]+' english3.txt | wc -L
11

[blue]master #[/blue] grep -xE '[qwertyuiop]{11}' english3.txt
proprietory
rupturewort

[blue]master #[/blue] grep -xE '[asdfghjkl]+' english3.txt | wc -L
8

[blue]master #[/blue] grep -xE '[asdfghjkl]{8}' english3.txt
alfalfas
falashas
galahads
haggadah

[blue]master #[/blue] grep -xE '[zxcvbnm]+' english3.txt | wc -L
3

[blue]master #[/blue] grep -xE '[zxcvbnm]{3}' english3.txt
bbc
bmx
mcc
xxv
xxx

* Search word list to match input template
* Input characters: a-z or A-Z (case insensitive) are hardwired to their places
*   in the input string
* Leading and trailing spaces are trimmed.
* All other characters (including spaces if embedded) are considered blanks
*   in their respective places except trailing asterisk(s)
* Trailing asterisks are used to add additional word lengths to search.

skeleton = LOWER(ALLTRIM(THISFORM.Text1.Value))
skelLen = LEN(m.skeleton)

* Calc length(s) of words to search
IF RIGHT(m.skeleton,1) = '*'
 minLen = m.skelLen - 1
 FOR ii = m.skelLen-1 TO 1 STEP -1
  IF SUBSTR(m.skeleton,m.ii) = '*'
   minLen = m.minLen - 1
  ELSE
   EXIT
  ENDIF
 ENDFOR
 whereCl = 'LEN(TRIM(Word))>=' + LTRIM(STR(m.minLen)) + ' AND ' ;
         + 'LEN(TRIM(Word))<=' + LTRIM(STR(m.skelLen))
 skelLen = m.minLen
ELSE
 whereCl = 'LEN(TRIM(Word))=' + LTRIM(STR(m.skelLen))
ENDIF

* Form where clause
FOR ii = 1 TO m.skelLen
 cChar = SUBSTR(m.skeleton,m.ii,1)
 IF BETWEEN(m.cChar,'a','z')
  whereCl = m.whereCl + ' AND SUBSTR(Word,'+LTRIM(STR(m.ii))+',1)="' + m.cChar + '"'
 ENDIF
ENDFOR

IF USED('Temp')
 USE IN Temp
ENDIF

* Select words into Temp.dbf
sfx = IIF(THISFORM.Op1.Value=1, '', 'Fr')
SELECT Word ;
  FROM Words&sfx ;
  INTO TABLE Temp ;
  WHERE &whereCl

*WordList.Grid1.RecordSource = 'Temp.dbf'
*WordList.Grid1.Column1.ControlSource = 'Temp.Word'
THISFORM.LbResults.Caption = LTRIM(TRANS(RECCOUNT(),'99,999,999'))
WordList.Grid1.Refresh()

*USE IN Temp

*WITH THISFORM
*.CmdSearch.Enabled = .F.
*.Text1.Value = ''   && Reset
*.Text1.SetFocus()
*ENDWITH

[blue]Option Explicit

Public Sub example()
    Dim re As RegExp
    Dim mymatches As MatchCollection
    Dim fso As New FileSystemObject
    Dim lp As Long
    Dim max As Long
    Dim pattern As Variant
    
    Set re = New RegExp
    For Each pattern In Array("qwertyuiop", "asdfghjkl", "zxcvbnm")
        max = 0
        With re
            .pattern = "^([" & pattern & "]+)$"
            .MultiLine = True
            .Global = True
            Set mymatches = .Execute(fso.OpenTextFile("d:\downloads\english3.txt", ForReading).ReadAll)
         End With
         For lp = 0 To mymatches.Count - 1
            If Len(mymatches(lp)) > max Then max = Len(mymatches(lp))
         Next
         For lp = 0 To mymatches.Count - 1
            If Len(mymatches(lp)) = max Then Debug.Print pattern & "(" & max & "): " & mymatches(lp)
         Next
     Next
End Sub[/blue]

Index the table (the word list) on length of word.

Loop through the table in descending order (so, start with the longest word in the table).

For each row on the keyboard:

  From the current word, remove those letters that are also present in the current keyboard row
  (there is a built-in VFP function which does that)

   If the result of the above operation is an empty string

      Record the current word as a hit

   If we have now found a hit for the current row AND the current word is shorter than
   the hit

      We've finished with this row

   End of loop on each row of the keyboard

End of loop on current word

result [teal]= [][/teal]
ARGF[teal].[/teal]each_line chomp[teal]:[/teal] [b]true do[/b] [teal]|[/teal]word[teal]|[/teal]
    [teal][[/teal][i][green]'qwertyuiop'[/green][/i][teal],[/teal] [i][green]'asdfghjkl'[/green][/i][teal],[/teal] [i][green]'zxcvbnm'[/green][/i][teal]].[/teal]each_with_index [b]do[/b] [teal]|[/teal]row[teal],[/teal] nr[teal]|[/teal]
        [b]next if[/b] [purple]0[/purple] [teal]>[/teal] longer [teal]=[/teal] word[teal].[/teal]length [i][green]<=>[/green][/i] result[teal][[/teal]nr[teal]][[/teal][purple]0[/purple][teal]].[/teal]length [b]rescue[/b] [purple]1[/purple]

        [b]if[/b] word[teal].[/teal]chars[teal].[/teal]all? [teal]{|[/teal]char[teal]|[/teal] row[teal].[/teal][b]include[/b][teal]?[/teal] char [teal]}[/teal] [b]then[/b]
            result[teal][[/teal]nr[teal]] = [][/teal] [b]if[/b] longer [teal]>[/teal] [purple]0[/purple]
            result[teal][[/teal]nr[teal]].[/teal]push word
        [b]end[/b]
    [b]end[/b]
[b]end[/b]

puts result

[blue]master #[/blue] ruby ruby/longest-word.rb english3.txt 
proprietory
rupturewort
alfalfas
falashas
galahads
haggadah
bbc
bmx
mcc
xxv
xxx