Fast and resource-friendly Python phrase matcher.

• sortedcontainers

It takes a plain pattern file as input.

sepak bola
pencetak gol terbanyak
sir bobby charlton
bobby charlton
musim lalu
musim ini
satu di antara
kesalahan defensif
kesalahan defensif terbesar
...

from phrasematcher import PhraseMatcher

matcher = PhraseMatcher('model_dirname', pattern_file='patterns.txt')

text = '''menurut analisa squawka , mu adalah satu di antara lima kesebelasan
          dengan kesalahan defensif terbesar di epl musim lalu -- walau hanya
          tiga gol yang masuk ke gawang mereka dari sejumlah kesalahan itu .'''

for match in matcher.match(text):
    print(match)

matcher = PhraseMatcher('model_dirname')

Short answer: I'm bored.

Long answer: Doing n-gram lookups is a waste of time and resources. Here we will reject candidates with OOV, lookup only first and last tokens and then check if the candidate pattern is in the hashtable.