Dontopedia
Explore

Min Distance

From Dontopedia, the open, paraconsistent wiki. (Last updated 2026-06-11.)

Min Distance has 11 facts recorded in Dontopedia across 5 references, with 2 live disagreements.

11 facts·6 predicates·5 sources·2 in dispute

Mostly:initial value(4), rdf:type(3), assigned from(1)

Maturity scale raw canonical shape-checked rule-derived certified

Initial Valuein disputeinitialValue

  • float('inf')[3]all time · Ffc8abcc 77b2 4a83 8215 F825e433c9b0
  • positive-infinity[3]all time · Ffc8abcc 77b2 4a83 8215 F825e433c9b0
  • float('inf')[4]sourceall time · 34094d4f C249 4e79 922e Dfb9f6ea172a
  • infinity[5]sourceall time · 81b08382 6139 462b A047 4231b5c0a4bb

Rdf:typein disputerdf:type

  • Float[2]all time · Aeec430d 7411 49b3 93d9 B07e3c19c4b3
  • Float[5]all time · 81b08382 6139 462b A047 4231b5c0a4bb
  • Variable[4]sourceall time · 34094d4f C249 4e79 922e Dfb9f6ea172a

Assigned FromassignedFrom

  • dist[1]sourceall time · 3cb97947 2304 4ba1 A2c5 598750f9b2f9

Is VariableisVariable

Updated byupdatedBy

  • Dist[2]all time · Aeec430d 7411 49b3 93d9 B07e3c19c4b3

Initialized WithinitializedWith

  • float('inf')[2]all time · Aeec430d 7411 49b3 93d9 B07e3c19c4b3

Inbound mentions (20)

Other subjects in dontopedia point AT this entity as a value. These are inverse relationships — e.g. "X motherOf this subject" — and answer questions the forward facts can't. Grouped by predicate.

initializesInitializes(5)

updatesUpdates(5)

initializesVariableInitializes Variable(2)

comparedWithCompared With(1)

comparesCompares(1)

findsMinimumOfFinds Minimum of(1)

minimizesMinimizes(1)

tracksTracks(1)

tracksMinimumTracks Minimum(1)

updatesVariableUpdates Variable(1)

uses-min-distance-trackingUses Min Distance Tracking(1)

Timeline

Timeline axis is valid_time — when each source says the fact was true in the world, not when Dontopedia learned about it. Retracted rows are kept for provenance; coloured stripes indicate the context kind.

assignedFrombeam/3cb97947-2304-4ba1-a2c5-598750f9b2f9
dist
initializedWithbeam/aeec430d-7411-49b3-93d9-b07e3c19c4b3
float('inf')
initialValuebeam/ffc8abcc-77b2-4a83-8215-f825e433c9b0
float('inf')
initialValuebeam/ffc8abcc-77b2-4a83-8215-f825e433c9b0
positive-infinity
initialValuebeam/34094d4f-c249-4e79-922e-dfb9f6ea172a
float('inf')
initialValuebeam/81b08382-6139-462b-a047-4231b5c0a4bb
infinity
isVariablebeam/3cb97947-2304-4ba1-a2c5-598750f9b2f9
ex:code-variable
typebeam/aeec430d-7411-49b3-93d9-b07e3c19c4b3
ex:Float
typebeam/81b08382-6139-462b-a047-4231b5c0a4bb
ex:Float
typebeam/34094d4f-c249-4e79-922e-dfb9f6ea172a
ex:Variable
updatedBybeam/aeec430d-7411-49b3-93d9-b07e3c19c4b3
ex:dist

References (5)

5 references
  1. [1]beam-chunk2 facts
    customctx:claims/beam/3cb97947-2304-4ba1-a2c5-598750f9b2f9
    • full textbeam-chunk
      text/plain1 KBdoc:beam/3cb97947-2304-4ba1-a2c5-598750f9b2f9
      Show excerpt
      dist = distance(word, dict_word) if dist < min_distance and dist <= threshold: min_distance = dist closest_word = dict_word return closest_word tokenizer = BertTokenizer.from_pretrained('bert-bas
  2. [2]beam-chunk3 facts
    customctx:claims/beam/aeec430d-7411-49b3-93d9-b07e3c19c4b3
    • full textbeam-chunk
      text/plain1 KBdoc:beam/aeec430d-7411-49b3-93d9-b07e3c19c4b3
      Show excerpt
      #### 1. Use a Trie for Dictionary Lookups ```python class TrieNode: def __init__(self): self.children = {} self.is_end_of_word = False class Trie: def __init__(self): self.root = TrieNode() def insert(
  3. customctx:claims/beam/ffc8abcc-77b2-4a83-8215-f825e433c9b0
  4. [4]beam-chunk2 facts
    customctx:claims/beam/34094d4f-c249-4e79-922e-dfb9f6ea172a
    • full textbeam-chunk
      text/plain1 KBdoc:beam/34094d4f-c249-4e79-922e-dfb9f6ea172a
      Show excerpt
      word_embeddings = KeyedVectors.load_word2vec_format('path/to/word2vec.txt', binary=False) def find_nearest_neighbor(embedding, word_embeddings): min_distance = float('inf') nearest_neighbor = None for word in word_embeddings.in
  5. [5]beam-chunk2 facts
    customctx:claims/beam/81b08382-6139-462b-a047-4231b5c0a4bb
    • full textbeam-chunk
      text/plain1 KBdoc:beam/81b08382-6139-462b-a047-4231b5c0a4bb
      Show excerpt
      dp[i][j] = dp[i - 1][j - 1] else: dp[i][j] = 1 + min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]) return dp[len1][len2] def spelling_correction(input_text): """Apply spelling correction

See also

Keep researching

Missing something or suspicious of what's here? Kick off a research session — a Claude agent will investigate, cite its sources, and file new facts into a dedicated context you can review before accepting into the shared view.