Page History

...

Discussion: Coding Scheme Search and Indexing

• Traversing Coding Schemes
  • OBI and GO would be the starting place to determine ability needed to traverse from one coding scheme to the next.   We have this captured and will consider.
• Indexing
  • Index Qualifiers
    • Scott described how we currently index qualifiers.  Qualifiers are stored in a file as a list that are grouped together and parsed into the index.   The list is added to the parent document as part of the block join implementation.  
  • LexEVS 6.4 Implementation
    • Scott discussed the status of 6.4 and noted that we've noticed some result differences in going form a single index to multi indexes.   The scoring is based on the frequency of a term - and we can boost the score.  There is a junit that tests the boosting of terms, but we aren't sure this is a credible issue or not.   Approximations are going to make this difficult.  Larry suggested that the raking be considered only for the individual source and not across all sources.  
    • Gilberto described a search result page where results could be split by vocabulary sources.  To do this, the list of sources could be presented to the user and the user could select the source from a pop-up.  The browser would need to be updated. 
    • Even with multiple indexes, exact matches will always be at the top of the results. Similar weighting should also be preserved.  
    • Larry requested that we share with the group how it worked in 6.3 and how it now is returned in 6.4 once fully implemented.  
    • Scott noted that we could always write our own analyzer, but then we'd need to maintain and support.
    • Stop word list is still valid in new implementation.   

Discussion: LEXEVS Loader Improvements

• OWL Loader
  
  • LexEVS-586 (OWL2 Changed Properties)
    • Used to support inferencing.   GO and OBI may have this already.
    • Examples include - hasUncle, hasFather, etc.

{scrollbar:icons=false}

...