How can we decide if our selection of examples is complete?

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• What if the spaces of the page opened to show all the alternatives and variations, sources and materials, references and combinatoric possibilities latent within it?question0.769
  Imagines a page that reveals its hidden combinatorial potential.
• Proving that a program meets accomplishment specifications must be based on assumptions about the world, the information it makes available to the program and the effects of the program's actions as well as on facts about the program itself.claim0.768
  Claim about the nature of accomplishment verification.
• Everything should be made as simple as possible, but not simpler.quote0.765
  Einstein's assertion invoked to explain why BMR preserves accuracy while reducing complexity
• Viewing the system as a collection of applications is a valid and useful approach.claim0.762
  Foundational assumption for the pattern language.
• What I have shown gives a first very rough approximation to a necessary morphology of architecture.claim0.760
• If the header here were to say, 'Formal logic and layout conventions,' the contents of this page would likely be read as an example of those terms.hypothesis0.753
  Conditional prediction that a header inflects the reading of the text block.
• The apparent style of the examples in the book is the structure that follows directly from the use of living processes.claim0.753
• We can sense, ahead of time, the quality of the completed whole, even when we cannot yet visualize it.claim0.752