| D13-1024 | generated by an upward pass of the | suffix trie | . At each node through the upward |
| D13-1024 | the suffix tree T is called a | suffix trie | , which we denote S . A suffix |
| W04-0107 | discusses how the branching count in a | suffix trie | can be exploited to identify |
| D13-1024 | measured for varying depth of the | suffix trie | with different penalties . Interpolated |
| W09-0715 | However , per default TnT uses a | suffix trie | of length 10 to handle unknown |
| D09-1142 | form for predicting gender using | suffix trie | models . When a new word is encountered |
| D13-1024 | subtree rooted at the node j of the | suffix trie | S ( x ) . Definition 2 . Let |
| C04-1152 | main suffix trie ( MST ) , is a | suffix trie | ( Gusfield , 1997 ) for all the |
| C04-1152 | first , which we term the main | suffix trie | ( MST ) , is a suffix trie ( |
| D13-1024 | m starting at the root of the | suffix trie | S . The entries in W correspond |
| C04-1152 | straightforward extensions of known | suffix trie | construction techniques ( Gusfield |
| D13-1024 | parameters correspond to paths in the | suffix trie | that do not branch i.e. sequence |
| W09-0715 | Unknown words are handled by a | suffix trie | and successive abstraction . |
| W13-4308 | To handle the unknown words , | suffix trie | and successive abstraction are |
| W99-0612 | and the ones introduced in the | suffix trie | may differ . The left context |
| D13-1024 | suffix trie , which we denote S . A | suffix trie | also has a tree structure , but |
| D13-1024 | 2011 ) , which are based on the | suffix trie | or tree , where subtrees correspond |
| D09-1070 | sets over a prefix trie and a | suffix trie | , we merge clusters between the |
| D13-1024 | number of nodes . An example of a | suffix trie | S and the associated suffix tree |
| D13-1024 | smoothing . 3.1 Proximal step on the | suffix trie | For squared ` 2 penalties , the |
