If this is your first visit, be sure to
check out the FAQ by clicking the
link above. You may have to register
before you can post: click the register link above to proceed. To start viewing messages,
select the forum that you want to visit from the selection below.

If I understand correctly, *99 means there may be 0-99 words between the earths (or lords).

Hope this helps.

--Jim

P.S. From a little more experimenting, it appears that 3 is the practical limit for this technique.
I tried using the "lord" search, with the hits from 3 lords as the search limits.
With a "PHRASE search" ['] it didn't seem to get out of the 'Compile' stage.
With a "Linear PHRASE" search [;], which was much slower for 2 0r 3 hits, it did seem to keep chugging. The status text looked like it eventually quit, so I aborted the search, to discover that it must have kept going. It reported 8 verses in 565 seconds, got into 2Ch before I aborted.

Is this more specific?

I want to be able to execute a computer-based search whose objective is to find all verses in which a specified Hebrew word, or Strong’s Number occurs N times (where N is an integer between 1 and 99).
For example, suppose I specify the Hebrew word אָרֶץ:

If N = * (or is not specified), the search will find and display exactly 853 verses in which אָרֶץoccurs 1 or more times. This is the current behavior.

If N = 3, the search will find and display 21 verses with exactly 3 occurrences of אָרֶץ

If N = 4, the search will find and display 1 verse with exactly 4 occurrences of אָרֶץ

If N = 5, the search will find and display 1 verse with exactly 5 occurrences of אָרֶץ

If I understand correctly, *99 means there may be 0-99 words between the earths (or lords).

Hope this helps.

--Jim

P.S. From a little more experimenting, it appears that 3 is the practical limit for this technique.
I tried using the "lord" search, with the hits from 3 lords as the search limits.
With a "PHRASE search" ['] it didn't seem to get out of the 'Compile' stage.
With a "Linear PHRASE" search [;], which was much slower for 2 0r 3 hits, it did seem to keep chugging. The status text looked like it eventually quit, so I aborted the search, to discover that it must have kept going. It reported 8 verses in 565 seconds, got into 2Ch before I aborted.

Hint: enter the search on the command line and then open the Advanced Search Engine. It is much quicker for this kind of search.
Mike

I did not do the VLM steps, but depended on the statistics that BW reported. For non-standard searches I have in a few situations found the VLM counts to be more reliable than the reported search statistics.

There is a small learning curve to use the VLM; once you've done it a few times it will go quickly. One way to open it is the F7 key.

A general way...

Reading the first post, I thought initially that the intent was to find any verse that used any word N # of times.

As MBushell noted, use the Graphical Search Engine=GSE. The search will run much more quickly.

If you are looking for any word repeated N # of times (and you are not interested in specifying what that word is), try the attached QF files. One is for Hebrew WTM, the other for Greek BGM.
I started with this command line entry: '#1 *25 #1 *25 #1

You will note that using "#1" is a way of asking that all the words be the same. The *25 is arbitrary. You can in/decrease that as you wish.
With that command line, I then opened the GSE which set up my initial parameters.
Running a search mostly returned hits of verses with multiple conjunctions, prepositions, particles, or pronouns.
Note in my GSE query that I eliminated those by double-clicking the first word box and add inclusion/exclusion elements. (That's why the first box has the +/- in it.)
As you seek to limit your results you may choose to add more exclusion words/forms.