plato-tile-search 0.1.0

Nearest-neighbor tile search — keyword overlap, domain matching, composite ranking

plato-tile-search

Nearest-neighbor tile search — keyword overlap, domain matching, composite ranking.

Part of the PLATO framework — deterministic AI knowledge management through tile-based architecture.

Installation

pip install plato-tile-search

Usage

from plato_tile_search import TileSearcher

searcher = TileSearcher(tiles=[
    {"content": "Pythagorean triples snap to exact coordinates", "domain": "constraint-theory"},
    {"content": "Deadband Protocol enforces P0 before P1 before P2", "domain": "governance"},
])

results = searcher.search("pythagorean snapping")
for r in results:
    print(f"[{r.match_type}] {r.score:.2f}: {r.tile['content'][:50]}")

Match Types

Type	Score	Description
Exact	1.0	Full content match
Keyword	Jaccard	Token-level overlap
Domain	0.3	Same domain as query
Fuzzy	0-0.5	Substring and bigram overlap

Zero external dependencies. Compatible with Python 3.8+.

GitHub