1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
from __future__ import print_function
from __future__ import unicode_literals
from builtins import str, bytes, dict, int
import os
import sys
sys.path.insert(0, os.path.join(os.path.dirname(__file__), "..", ".."))
from pattern.search import search
from pattern.en import parsetree
# Constraints ending in "+" match one or more words.
# Pattern.search() uses a "greedy" approach:
# it will attempt to match as many words as possible.
# The following pattern means:
# one or more words starting with "t",
# followed by one or more words starting with "f".
t = parsetree("one two three four five six")
m = search("t*+ f*+", t)
print(t)
print(m)
print("")
for w in m[0].words:
print("%s matches %s" % (w, m[0].constraint(w)))
# "*" matches each word in the sentence.
# This yields a list with a Match object for each word.
print("")
print("* => %s" % search("*", t))
# "*+" matches all words.
# This yields a list with one Match object containing all words.
print("")
print("*+ => %s" % search("*+", t))
|
