Evan Martin wrote:
On 8/3/06, Timwi timwi@gmx.net wrote:
Julien Lemoine wrote:
First of all, I grabbed the whole content of english/french wikipedia in june 2006. Then, everything is compiled is a final state machine (about 200Mb for english wikipedia).
Can you explain in greater detail what your finite-state machine looks like? Is it like a directed graph?
The right data structure for this sort of thing is called a "trie", and Googling it will turn up lots of information. Though I'm not sure if the original poster knows this term.
I know, and his is indeed a trie. But that word is rarely used. Look at his work: He has perfectly implemented a trie with a lot of thought, but without knowing the word "trie" :-p
Timwi