+
+
+
+
Introducing RECALL: AI study rooms, vector parsing, and active recall. Learn More
Coursework AI Validation Layer

Your Coursework,
Searchable.

Upload class slides, textbook PDFs, and syllabus notes. Query your second brain with exact-page citation highlights, and build flashcards dynamically.

Start now
onboard with your syllabus →
Halftone Brain Illustration
recall-workspace://cs-4830-nlp
INDEXED
USER

What did the professor say about the self-attention mechanism in Lecture 4?

ASSISTANT

According to Lecture 4 (slide 14), the self-attention mechanism allows the model to associate each individual word in the input sequence with all other words. This solves the long-term dependency problem in sequential data processing without needing recurrent layers.

Source Citation Viewer
No active source selected
Supabase Vector Hybrid Indexing
[ PIPELINE INFRASTRUCTURE ]

How Recall indexes your coursework

01 // INGESTION

1. Upload Documents

Drag and drop slides, textbooks, and syllabus notes. We secure them on Supabase Storage with signed-URL authorization.

POST /api/v1/documents
multipart/form-data
02 // EXTRACTION

2. Processing Workers

Celery workers run extraction jobs. Layout-aware parsers isolate charts, math formulas, and lists before vector embedding.

embed_chunks_task.delay()
vector(1536) index
03 // CHAT

3. Hybrid Query

Retrieve semantically matched chunks using hybrid keyword search. Stream answers directly inline with citations.

RRF hybrid search match
SSE text/event-stream
Advanced Parsing Engine

Layout-aware extraction.

Standard text extraction tools fail when handling complex coursework materials. Textbooks have sidebars, research papers use double-column layouts, and slides contain overlapping diagrams.

Recall reconstructs documents as a structured layout tree before chunking. Math formulas are isolated, tables are mapped to markdown grids, and text is read in reading-order rather than layout position.

Formula LaTeX translation support
OCR capability for scanned lecture notes
+
+
DOCUMENT ANALYSIS LAYERFIG 04: VECTOR CHUNKING
Ingestion Chunking Diagram
+
ACTIVE RECALL ASSESSMENTQ-DECK 1

Why do we scale the dot product of Query and Key by 1/√d_k in self-attention?

Active Recall Cycles

Spaced repetition.

Passively reading textbook highlights does not lead to long-term memory. Recall automatically converts your lecture materials into study decks of flashcards and dynamic multiple-choice question sets.

The platform monitors your study session history and Schedules cards using a modified SM-2 memory decay model. Review sessions are calculated exactly when memory retention is about to fall below 80%.

Memory Curve Graph
SM-2 Decay Model scheduler

Adapts spacing intervals (I = I * EF) based on user response accuracy scores.

Visual Syllabus Mapping

Interactive subject networks.

Recall clusters related lecture notes, slides, and homework sets into a visual concept graph. Instead of viewing files as standalone entities, you see how they connect to build the course curriculum.

Nodes are color-graded based on active recall quiz success rates. A red node highlights a concept with failing flashcard history, indicating exactly where to focus study sessions before the exam.

Prerequisite concept path tracking
Cross-subject course map linkages
+
SUBJECT CLUSTERING ENTITY GRAPHFIG 09: KNOWLEDGE LINKS
Knowledge Network Graph

[ TECHNICAL SPECIFICATIONS ]

A study assistant built for complexity.

01 // INGESTION

Layout-Aware RAG

Extracts charts, math equations, and slides instead of indexing raw unformatted flat text.

02 // ACTIVE RECALL

Spaced Repetition

Generates flashcards and quizzes, tracking recall cycles using the SM-2 scheduler algorithm.

03 // DYNAMIC DEPTH

ELI5 Explanation

Instantly scales the complexity of answers up and down using a dynamic explain range slider.

04 // CONCEPT MAPS

Automatic Graphs

Connects subject concepts into structured visual graphs to expose specific study gaps.

Adjust explanations to fit your memory gaps.

Drag the range slider below to see how Recall adapts answer complexities on the fly.

+
+
CONCEPT STUDY: BACKPROPAGATIONLevel: Undergrad

Self-attention operates by mapping a query vector against a set of key vectors to compute similarity weights, which are then applied to value vectors: Attention(Q, K, V) = softmax(QKᵀ / √d_k)V. This allows token representations to be updated dynamically based on global sequence context, facilitating parallelized compute.

[ ELI5 ][ HIGH SCHOOL ][ UNDERGRAD ][ RESEARCH / PHD ]

Recall is building the study validation layer

Get started today to ingest notes and query your coursework.

Create account →