What technology/algorithm should be used to abstract meaning or keywords from a passage of text?
Hi and thanks for looking!
Is it possible (and practical) to search a string for arbitrary-length repeating patterns?
I’ve recently developed a huge interest in cryptography, and I’m exploring some of the weaknesses of ECB-mode block ciphers. A common attack scenario involves encrypted cookies, whose fields can be represented as (relatively) short hex strings.
Verify uniqueness of new content
I’m working on a review site, where there is a minor issue with almost duplicate reviews across items. Just a few words are changed. It would be very nice to be able to uncover these duplicates before they are approved by a moderator, and I’m hoping someone could chime in on the best strategy to get there.
Good technique for search text tokenization
We are looking for a way to tokenize some text in the same or similar way as a search engine would do it.
doing a full permutation search and replace on a string
I’m writing an app that does something like a custom number (license) plate generator tool where if I ask for the plate “robin” it will suggest I try:
Address search from large text file
Basically I want to develop a Address lookup(part of my project) using C# (and I can use SQL if necessary). I have a very large text file which have all the UK address and postcodes. Addresses needs to be looked up from this text file.
Auto-completion or Suggest
How does Google or amazon implement the auto-suggestion at their search box. I am looking for the most used algorithm with technology stack.
Querystring Advanced Search where there are about 20 search fields
I am creating an advanced search page where there are about 20 search fields for a user to filter their search. My question deals with the query string, Is it standard web development practice to have say 20 parameters in a querystring?
heuristic for searching through non-perfectly sorted data
Given sorted data, the search solution is obvious. Given unsorted data, sensible options are sort then search or just linear search.
Binary Search Programming implementation
Binary Search, as we all know requires the elements to be sorted. But we have to take care of unsorted elements too, in the worst case. If the input size is very large, is it a good idea to sort the elements everytime? Can we not just check the elements that they are not sorted or not and proceed to sorting and proceed to sorting only if they are unsorted?