Re: What are my options for dictionary hashing?

On Sep 25, 10:53 am, BruceMcF <agil...@xxxxxxxxxxxx> wrote:
On Sep 25, 12:56 am, John Passaniti <john.passan...@xxxxxxxxx> wrote:

Nope.  symtab at best can only tell you the popularity of words you
have seen in the past.  Some of those words will certainly be popular
in the future (for example, ":" and ";").  But other words will be
popular only within a window.  symtab doesn't consider a window; it is
just the cumulative frequencies of the symbols seen so far.  Thus, you
believe that just because a particular word was popular in the past,
it will necessarily be popular in the future.  If it is-- great.  If
not, then it uselessly takes up space near the top of the tree.

Except if the past *is* "an indicator of future performance", why
bother with all the counting? Why not do a survey of a large body of
code, and build a binary tree with the top 64 words by frequency at
the head of the tree at the outset. You'd need to include provision
for "not yet defined", but in return you save all the count bytes.

Because every application is different.
.

Relevant Pages

  • Re: Ladybird Bags
    ... valence for over the window and made another for the laundry room ... plan and maybe make a tote, ... And I honestly don't see why they are so popular. ...
    (rec.crafts.textiles.needlework)
  • Re: Ladybird Bags
    ... valence for over the window and made another for the laundry room ... plan and maybe make a tote, ... And I honestly don't see why they are so popular. ...
    (rec.crafts.textiles.needlework)
  • Re: Do I need a window?
    ... quantity from a discretely sampled data of finite length. ... choose a window that can be tuned to ... While I could stand in front of a room of fellow engineers and defend a choice of window by "it's popular _and_ it doesn't matter much anyway", defending it with "'cause it's popular" would quite deservedly get me laughed out of the room. ...
    (comp.dsp)
  • Re: What are my options for dictionary hashing?
    ... popular only within a window. ... then it uselessly takes up space near the top of the tree. ... CHForth, 16 bit DOS applications ...
    (comp.lang.forth)
  • Re: What are my options for dictionary hashing?
    ... popular only within a window. ... just the cumulative frequencies of the symbols seen so far. ... then it uselessly takes up space near the top of the tree. ...
    (comp.lang.forth)