CompleteMe

Learning Goals

• Practice breaking a program into logical components
• Testing components in isolation and in combination
• Applying Enumerable techniques in a real context
• Reading text from and writing text to files

CompleteMe

Everyone in today’s smartphone-saturated world has had their share of interactions with textual “autocomplete.” You may have sometimes even wondered if autocomplete is worth the trouble, given the ridiculous completions it sometimes attempts.

But how would you actually make an autocomplete system?

In this project, CompleteMe, we’ll be exploring this idea by a simple textual autocomplete system. Perhaps in the process we will develop some sympathy for the developers who built the seemingly incompetent systems on our phones…

Data Structure – Introduction to Tries

A common way to solve this problem is using a data structure called a Trie. The name comes from the idea of a Re-trie-val tree, and it’s useful for storing and then fetching paths through arbitrary (often textual) data.

A Trie is somewhat similar to binary trees, but whereas each node in a binary tree points to up to 2 subtrees, nodes within our retrieval tries will point to N subtrees, where N is the size of the alphabet we want to complete within.

Thus, for a simple latin-alphabet text trie, each node will potentially have 26 children, one for each character that could potentially follow the text entered in a search so far. (In graph theory terms, we could classify this as a Directed, Acyclic graph of order 26, but hey, who’s counting?)

What we end up with is a broadly-branched tree where paths from the root to the leaves represent “words” within the dictionary.

Take a moment and read more about Tries:

• Tries writeup in the DSA Repo
• Tries Wikipedia Article

Input File

Of course, our Trie won’t be very useful without a good dataset to populate it. Fortunately, our computers ship with a special file containing a list of standard dictionary words. You can find it in the terminal at this path: /usr/share/dict/words

Using the unix utility wc (word count), we can see that the file contains 235886 words:

$ wc -l /usr/share/dict/words
235886

Should be enough for us!

Support Tooling

Please make sure that, before your evaluation, your project has the following:

• SimpleCov reporting accurate test coverage statistics

Iteration 1

Basic Interaction Model (Interface)

We’ll expect to interact with your completion project from an interactive pry session, following a model something like this:

# open pry from root project directory
# We are not concerned about the return values of methods unless explicitly indicated below.
require "./lib/complete_me"

completion = CompleteMe.new

completion.insert("pizza")

completion.count
=> 1

completion.suggest("piz")
=> ["pizza"]

dictionary = File.read("/usr/share/dict/words")

completion.populate(dictionary)

completion.count
=> 235886

completion.suggest("piz")
=> ["pize", "pizza", "pizzeria", "pizzicato", "pizzle", ...]

Iteration 2

Usage Weighting

The common gripe about autocomplete systems is that they give us suggestions that are technically valid but not at all what we wanted.

A solution to this problem is to “train” the completion dictionary over time based on the user’s actual selections. So, if a user consistently selects “pizza” in response to completions for “pizz”, it probably makes sense to recommend that as their first suggestion.

To facilitate this, your library should support a select method, which takes a substring and the selected suggestion. You will need to record this selection in your trie and use it to influence future selections to make.

Here’s what that interaction model should look like:

require "./lib/complete_me"

completion = CompleteMe.new

dictionary = File.read("/usr/share/dict/words")

completion.populate(dictionary)

completion.suggest("piz")
=> ["pize", "pizza", "pizzeria", "pizzicato", "pizzle", ...]

completion.select("piz", "pizzeria")

completion.suggest("piz")
=> ["pizzeria", "pize", "pizza", "pizzicato", "pizzle", ...]

Substring-Specific Selection Tracking

A simple approach to tracking selections would be to simply “count” the number of times a given word is selected (e.g. “pizza” - 4 times, etc). But a more sophisticated solution would allow us to track selection information per completion string.

That is, we want to make sure that when selecting a given word, that selection is only counted toward subsequent suggestions against the same substring. Here’s an example:

require "./lib/complete_me"

completion = CompleteMe.new

dictionary = File.read("/usr/share/dict/words")

completion.populate(dictionary)

completion.select("piz", "pizzeria")
completion.select("piz", "pizzeria")
completion.select("piz", "pizzeria")

completion.select("pi", "pizza")
completion.select("pi", "pizza")
completion.select("pi", "pizzicato")

completion.suggest("piz")
=> ["pizzeria", "pize", "pizza", "pizzicato", "pizzle", ...]

completion.suggest("pi")
=> ["pizza", "pizzicato", "pize", "pizzeria", "pizzle", ...]

In this example, against the substring “piz” we choose “pizzeria” 3 times, making it the dominant choice for this substring.

However for the substring “pi”, we choose “pizza” twice and “pizzicato” once. The previous selections of “pizzeria” against “piz” don’t count when suggesting against “pi”, so now “pizza” and “pizzicato” come up as the top choices.

Iteration 3

Word Deletion and Tree Pruning

Let’s add a feature that lets us delete words from the tree. When deleting a node, we’ll need to consider a couple of cases.

First, make sure that we adjust our tree so that the node relating to the removed word no longer seen that word as a valid word. This means that subsequent suggestions should no longer return it as a match for any of its substrings.

For “intermediate” nodes (i.e. nodes that still have children below them), this is all you need to do.

However, for leaf nodes (i.e. nodes at the end of the tree), we will also want to completely remove those nodes from the tree. Since the leaf node in question no longer represents a word, and there are no remaining nodes below it, there’s no point in keeping the leaf node in the tree, so we should remove it.

Additionally, once we remove this node, we would also want to remove any of its parents for which it was the only child. That is – if, once we remove our word in question, the node above it is now a path to nowhere, we should also remove that node. This process would repeat up the chain until we finally reach a “word” node that we want to keep around.

For example, if the word trying was in our Trie (as well as the word try) then the ‘y’ node and ‘g’ node would be “word” nodes. If we were to delete the word trying from the Trie, then the nodes for ‘i’, ‘n’ and ‘g’ should be removed, not just the ‘g’ node.

Iteration 4

Denver Addresses

Working with words was interesting, but what about a bigger dataset? Check out this data file (you’ll want the CSV version) that contains all the known addresses in the city of Denver. Use the full_address field (the last column in the row). Can you make your autocomplete work with that dataset?

Substrings

Could your word lookup possibly handle middle-of-the-word matches? So that com would list both the possibilities complete and incomplete? How does this change the memory requirements of your running program?

Visual Interface

Can you create a graphical user interface for your code? Something that a “normal person” might plausibly use? Consider a toolkit like Shoes or Ruby Processing.

Expectations

This project will be evaluated according to the Mod 1 Project Rubric.