This assignment is part of a series of experimental programming projects.
Below is the goal of this assignment. We are asking you to achieve this goal in the best, most efficient way you can. Five programmers will be selected to complete this task.
In your bid, please include the following:
- The programming language you intend to use
- The general method you propose
GOAL:
Server side, find the fastest NGRAM algorithm (word ngram) that finds all combinations of words in a string, with no transposing – a flat NGRAM. There will be various versions (each NGRAM program can be narrowed by “1” “2”.
NGRAM1 = single words in the string
NGRAM2 = ngrams of 2 word stings (“the cat”, “cat ran”, “ran quickly”)
Etc. up to 10