What it does
Finds a portmanteau between two words using a graph search that finds words to link between them!
It favours larger overlaps between words, and tries first with common words and falls back to uncommon ones, for only the highest quality portmanteaus.
How I built it
It's a Rust program that hosts a web app. The searching is done on the backend using a custom graph search implementation and prefix data store to link words together quickly.
Challenges I ran into
It was generating low quality portmanteaus so I switched to a weighted graph search and weighted by the overlap between words.
Accomplishments that I'm proud of