https://github.com/ritu-thombre99/optimal-binary-search-tree-for-dictionary-implementation
Given a document, dictionary was created using optimal binary search tree for this document where words with highest term frequency appear near the root of OBST. And when a word from user-input is to be found in this OBST-Dictionary, output the level in OBST at which this word was found.
https://github.com/ritu-thombre99/optimal-binary-search-tree-for-dictionary-implementation
dictionary information-retrieval obst optimal-binary-search-tree optimalbinarysearchtree
Last synced: 2 months ago
JSON representation
Given a document, dictionary was created using optimal binary search tree for this document where words with highest term frequency appear near the root of OBST. And when a word from user-input is to be found in this OBST-Dictionary, output the level in OBST at which this word was found.
- Host: GitHub
- URL: https://github.com/ritu-thombre99/optimal-binary-search-tree-for-dictionary-implementation
- Owner: ritu-thombre99
- Created: 2020-11-11T11:08:53.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2020-11-11T11:10:19.000Z (over 4 years ago)
- Last Synced: 2025-01-05T06:27:23.486Z (4 months ago)
- Topics: dictionary, information-retrieval, obst, optimal-binary-search-tree, optimalbinarysearchtree
- Language: Jupyter Notebook
- Homepage:
- Size: 3.91 KB
- Stars: 1
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files: