A job matching platform built at NuSeat using the novel L-Trees algorithm — a dynamically-sorted categorical tree powered by LLMs. The tree's state guides the LLM in asking the right questions to match candidates with job postings. Later evolved into CL-Trees (chronological variant for memory) and ultimately DynamicContextObjects built on pgvector.
Matching candidates to jobs requires understanding nuanced preferences
L-Trees: dynamic, LLM-powered categorical tree algorithm
Traditional keyword matching misses semantic similarities
Tree state fed to LLM to guide question selection
Conversation context needed to guide follow-up questions
CL-Trees for chronological task memory and up-summarization