[CWB] Finding paragraphs with a minimum number of hits

[Meier-Vieracker, Simon]

Dear list,

in CQP, is there a way to find paragraphs <p> with a minimum number of hits for a certain pattern, say min 3 hits for [lemma="nach“] [pos=ADJA"] [pos="NN"] ?

I could do

[lemma="nach"] [pos="ADJA"] [pos="NN"] []* [lemma="nach"] [pos="ADJA"] [pos="NN"] []* [lemma="nach"] [pos="ADJA"] [pos="NN"] within p

but this seems to be rather ineffective for large corpora.

Even better would be a way to rank the results by the number of hits per paragraph.

Thanks for any suggestions!

Best
Simon