Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!rpi!uupsi!sunic!kth.se!cyklop.nada.kth.se!news
From: d88-jwa@byse.nada.kth.se (Jon W{tte)
Newsgroups: comp.compression
Subject: What is a trie ?? (was Re: fast string compr.?)
Message-ID: <D88-JWA.91May26212010@byse.nada.kth.se>
Date: 26 May 91 19:20:13 GMT
References: <LACA.91May20141838@vipunen.hut.fi>
	<1991May23.235530.11443@looking.on.ca>
	<24May91.206106.345@franklin.com>
Sender: news@nada.kth.se (Mr News)
Distribution: comp
Organization: Royal Institute of Technology, Stockholm, Sweden
Lines: 18
In-reply-to: bill@franklin.com's message of 24 May 91 20:51:06 GMT

In article <24May91.206106.345@franklin.com> bill@franklin.com (bill) writes:

   From: bill@franklin.com (bill)

   BTW, the *correct* answer to the question of the "normal" way of
   storing the lexicon is this: store the lexicon as a trie. This is

What is a trie ? I've seen it mentioned over and again in this
group, but not being native english I haven't heard the word
elsewhere. I'm probably familiar with the data structure when
you explain it to me, but until then, I remain in the dark.

Any input gladly accepted,

--
						Jon W{tte
						h+@nada.kth.se
						- Power !