Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Dictionary search without blocking

  • Assuming each dictionary term equally likely in query

    (not really so in practice!), average number of comparisons

    =(1+2∙2+4∙3+4)/8 ~2.6 

  • Exercise: what if the frequencies of query terms

    were non-uniform but known,

    how would you structure the dictionary search tree?

Speaker notes:

Content Tools


There are currently no sources for this slide.