Lines Matching refs:word
8 representation of an unordered word list (dictionary).
22 a label and each word is represented by the labels in one path from
202 """Generates a DAFSA from a word list and returns the source node.
204 Each word is split into characters so that each character is represented by
205 a unique node. It is assumed the word list is not empty.
209 def ToNodes(word):
211 if not 0x1F < ord(word[0]) < 0x80:
213 if len(word) == 1:
214 return chr(ord(word[0]) & 0x0F), [None]
215 return word[0], [ToNodes(word[1:])]
216 return [ToNodes(word) for word in words]
220 """Generates a word list from all paths starting from an internal node."""
223 return [(node[0] + word) for child in node[1] for word in to_words(child)]
286 """Generates a new DAFSA where nodes that represent the same word lists
434 """Generates C++ code from a word list"""