For this assignment, you will build an indexer that constructs an inverted index

Question

For this assignment, you will build an indexer that constructs an inverted index of n-gram, which are
discrete, continuous unit of two or more characters. I expect you to look up the algorithm on multiple
online sources and (of course) note the sources (just put the info in your code). I expect you to not
look at source code. You can write this in any language you want.
1. We will use the Jargon File for a source text; it has been uploaded to a new folder to your repo
2. You will need to handle spaces and line breaks
3. You need to look through to note how some :words: are <bounded>
4. You should produce an index that lists
a. The token
b. Its relative frequency
c. Its absolute frequency (the count of its appearances)
5. The program should be runnable from a command line, with the ability to pass in relevant
inputs (e.g., input file, output file, n-gram length) on the command line or via text entry (e.g.,
using Scanner in Java)

Explanation / Answer

Coded in go. Please find the source code in: https://gitlab.com/agrawall.lokesh/ngram-invertedindex

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.