| Trees | Indices | Help |
|
|---|
|
|
Given a trie, find all occurrences of a word in the trie in a string. Like searching a string for a substring, except that the substring is any word in a trie. Functions: match Find longest key in a trie matching the beginning of the string. match_all Find all keys in a trie matching the beginning of the string. find Find keys in a trie matching anywhere in a string. find_words Find keys in a trie matching whole words in a string.
|
|||
longest key or None |
|
||
list of keys |
|
||
list of tuples (key, start, end) |
|
||
list of tuples (key, start, end) |
|
||
|
|||
DEFAULT_BOUNDARY_CHARS =
|
|||
|
|||
Find all the keys in the trie that match full words in the string. Word boundaries are defined as any punctuation or whitespace.
|
|
|||
DEFAULT_BOUNDARY_CHARS
|
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Tue Feb 5 17:59:49 2013 | http://epydoc.sourceforge.net |