Hi all,
I am new to UIMA C++ Framework. Please point me how can I use it for the 
following task:
Given a set of strings, find all occurrencies of them in text buffer. For each 
string, all possible combinations in word order must be considered. No lexical 
or language analysis needed, just tokenize the input and perform the search. 
How can it be done by means of the UIMA C++, in most efficient way? Thanks!

Reply via email to