---
title: "Search: Query Matching via Lexical, Graph, and Embedding Methods"
url: https://daily.dev/posts/search-query-matching-via-lexical-graph-and-embedding-methods-s5vi2kqol
source_url: https://eugeneyan.com/writing/search-query-matching
type: article
source: "Eugene Yan"
published: 2026-05-31T07:40:24.324Z
updated: 2026-05-31T08:23:23.454Z
tags: ["nlp", "embeddings"]
reading_time: 18
upvotes: 0
comments: 0
language: en
---

> ## Documentation Index
> Fetch the complete documentation index at: https://daily.dev/llms.txt
> Use this file to discover all available pages before exploring further.

# Search: Query Matching via Lexical, Graph, and Embedding Methods

**[Eugene Yan](https://daily.dev/sources/eugeneyan)** · 18 min read · 0 upvotes · 0 comments

## Summary

A comprehensive overview of three main approaches to query matching in search systems: lexical (preprocessing, expansion, relaxation, translation), graph-based (knowledge graphs for query expansion), and embedding-based (self-supervised and supervised representation learning). Real-world examples from DoorDash, Uber, Yahoo, Amazon, Facebook, GrubHub, and JD illustrate how each method works in production. The post concludes that these approaches are complementary — most systems layer embeddings on top of lexical and graph methods rather than replacing them.

## Full article

daily.dev links to this article rather than hosting it. Read it at the original source: <https://eugeneyan.com/writing/search-query-matching>

---

Tags: [#nlp](https://daily.dev/tags/nlp), [#embeddings](https://daily.dev/tags/embeddings)

[View this post on daily.dev](https://daily.dev/posts/search-query-matching-via-lexical-graph-and-embedding-methods-s5vi2kqol)