implement binary search in JS over index of stemmed, non-ordinary words in JSON object

radekstepan / octopy

a blog aware static site generator

3 stars 1 forks source link

implement binary search in JS over index of stemmed, non-ordinary words in JSON object #21

Closed radekstepan closed 13 years ago

radekstepan commented 13 years ago

http://www.nczonline.net/blog/2009/09/01/computer-science-in-javascript-binary-search/

radekstepan commented 13 years ago

http://oreilly.com/catalog/jscook/chapter/ch01.html

radekstepan commented 13 years ago

mention the complexity of search determining approx max time for a given index size of x articles of y words

radekstepan commented 13 years ago

Stop words:

"a", "an", "and", "are", "as", "at", "be", "but", "by", "for", "if", "in", "into", "is", "it", "no", "no", "not", "of", "on", "or", "s", such", "t", "that", "the", "their", "they", "then", "there", "these", "this", "to", "was", "will", "with"

radekstepan commented 13 years ago

include Porter stemmer in py and js to get not just exact results and save on space

radekstepan commented 13 years ago

Turn ftp://ftp.ox.ac.uk/pub/wordlists/dictionaries/knuth_words.gz into an array and determine speed in JavaScript. If this is fast, anything will.

test how well we can transfer such a large dictionary, cache in localStorage of the user?

radekstepan commented 13 years ago

Utilize http://api.jquery.com/category/plugins/templates/ if success with binary search