GitHub / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ritu-thombre99%2FOptimal-Binary-Search-Tree-for-Dictionary-Implementation
PURL: pkg:github/ritu-thombre99/Optimal-Binary-Search-Tree-for-Dictionary-Implementation
Stars: 2
Forks: 1
Open issues: 0
License: None
Language: Jupyter Notebook
Size: 3.91 KB
Dependencies parsed at: Pending
Created at: over 4 years ago
Updated at: about 1 month ago
Pushed at: over 4 years ago
Last synced at: 5 days ago
Topics: dictionary, information-retrieval, obst, optimal-binary-search-tree, optimalbinarysearchtree