Trie Tools

Browse all available trie tools.

Available tools

Literal Word Trie Node Table Construct a literal UTF-16-code-unit trie with stable insertion IDs and at most 128 nodes; repeated words share one terminal, empty words terminate the root.
Prefix Trie Completion Explicit Score Order Order explicit scored prefix completions by descending score with stable source ties, retaining distinct occurrence IDs; no authoritative autocomplete dictionary.
Prefix Trie Compressed Edge Node Expander Expand an explicit compressed rooted trie edge table into stable insertion-code-unit nodes, validating complete unique-parent acyclic structure and unambiguous outgoing first characters; IDs are reallocated, not preserved.
Prefix Trie Leaf Branch Classification Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; classify structural leaf/unary/branch independently of terminal membership, preserving all nodes.
Prefix Trie Literal Prefix Completion Count Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; count distinct terminal completions, not duplicate original word observations or inferred dictionary frequencies.
Prefix Trie Literal Prefix Completion List Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; select terminal word completions in source-node order, including the prefix itself if terminal.
Prefix Trie Literal Prefix Node Lookup Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; locate an exact literal prefix node, retaining matched code-unit length and missing-edge witness.
Prefix Trie Node Depth Profile Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; profile structural UTF-16 edge depth independently of grapheme or Unicode-code-point length.
Prefix Trie Node Table Structure Audit Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; validate complete acyclic single-root structure and edge uniqueness, rejecting ambiguous/missing references.
Prefix Trie Node Terminal Count Table Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; count terminal descendants including self at every node; trie terminals are distinct words, not observation counts.
Prefix Trie Path Compressed Edge Table Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; compress unary nonterminal chains to multi-code-unit edge labels while retaining source endpoint IDs and all terminal boundaries.
Prefix Trie Query Missing Edge Witness Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; report the first missing literal edge with matched prefix; a fully matched nonterminal path is structurally present, not a missing edge.
Prefix Trie Terminal Membership Bit List Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; test exact terminal word membership for each supplied query, preserving empty queries and repeated occurrences.
Prefix Trie Terminal Word Path List Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; list all terminal literal word paths in source node order, including an explicitly terminal root as the empty word.
Prefix Trie Terminal Word Weight Totals Aggregate nonnegative supplied word occurrence weights before trie completion scoring; exact literal word identity, no inferred corpus frequency.
Prefix Trie Unary Chain Spans Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; inventory maximal compressible nonterminal unary chains, stopping at terminal words even when they have one child.
Prefix Trie Unique Completion Check Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; resolve a completion only when exactly one terminal word exists; missing or tied evidence remains null.
Prefix Trie Word Longest Stored Prefix Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; find the longest stored terminal word that prefixes a query, not merely the deepest nonterminal matched node.
Prefix Trie Word Shortest Unique Prefix Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; find the shortest literal prefix uniquely completing to a stored terminal word; a word that prefixes others may have no unique prefix.