bruteSearch | NLP.Adict |
Cost | |
1 (Type/Class) | NLP.Adict |
2 (Data Constructor) | NLP.Adict |
costDefault | |
1 (Function) | NLP.Adict |
2 (Function) | NLP.Adict.CostDiv |
CostDiv | |
1 (Type/Class) | NLP.Adict.CostDiv |
2 (Data Constructor) | NLP.Adict.CostDiv |
DAWG | |
1 (Type/Class) | NLP.Adict.DAWG, NLP.Adict |
2 (Data Constructor) | NLP.Adict.DAWG, NLP.Adict |
DAWGM | NLP.Adict.DAWG, NLP.Adict |
delete | |
1 (Function) | NLP.Adict |
2 (Function) | NLP.Adict.CostDiv |
edgeMap | NLP.Adict.Trie, NLP.Adict |
empty | NLP.Adict.Trie |
Filter | NLP.Adict.CostDiv |
findAll | NLP.Adict |
findNearest | NLP.Adict |
follow | NLP.Adict.Trie |
fromDAWG | NLP.Adict.DAWG, NLP.Adict |
fromLang | NLP.Adict.Trie |
fromList | NLP.Adict.Trie, NLP.Adict |
fromTrie | NLP.Adict.DAWG, NLP.Adict |
Group | NLP.Adict.CostDiv |
implicitDAWG | NLP.Adict.Trie, NLP.Adict |
insert | |
1 (Function) | NLP.Adict.Trie |
2 (Function) | NLP.Adict |
3 (Function) | NLP.Adict.CostDiv |
lookup | NLP.Adict.Trie |
mkSub | NLP.Adict.CostDiv |
mkSubMap | NLP.Adict.CostDiv |
Node | |
1 (Type/Class) | NLP.Adict.DAWG, NLP.Adict |
2 (Data Constructor) | NLP.Adict.DAWG, NLP.Adict |
nodes | NLP.Adict.DAWG, NLP.Adict |
Pos | NLP.Adict |
posMod | NLP.Adict.CostDiv |
predic | NLP.Adict.CostDiv |
root | NLP.Adict.DAWG, NLP.Adict |
rootValue | NLP.Adict.Trie, NLP.Adict |
Sub | NLP.Adict.CostDiv |
SubMap | NLP.Adict.CostDiv |
subNodes | NLP.Adict.DAWG, NLP.Adict |
subOn | NLP.Adict.CostDiv |
subst | |
1 (Function) | NLP.Adict |
2 (Function) | NLP.Adict.CostDiv |
toCost | NLP.Adict.CostDiv |
toCostInf | NLP.Adict.CostDiv |
toList | NLP.Adict.Trie |
Trie | |
1 (Type/Class) | NLP.Adict.Trie, NLP.Adict |
2 (Data Constructor) | NLP.Adict.Trie, NLP.Adict |
TrieM | NLP.Adict.Trie, NLP.Adict |
unSub | NLP.Adict.CostDiv |
valueIn | NLP.Adict.DAWG, NLP.Adict |
Weight | NLP.Adict |
weight | NLP.Adict.CostDiv |
Word | NLP.Adict |