Lightweight Data Markup Language     and Information Transfer          Sayandeep Khan         Drakoon Aerospace           ...
Containts→The notion of Language ⬔ What is missing→A language with an inter-sentence relation ⬔ The notion of Sprache  ⬔ T...
The Notion of LanguageAlphabet: A set of charachter (basic symbols that can notbe decomposed), written ∑String: Any finite...
What is missing?⬔ The language is basically a set of terminal symbols.⬔ The generation of the terminal symbols are governe...
Example⬔ Statements in english language (Each terminal statement):      » Iron is heavier than water      » Iron sinks in ...
Remarks⬔ Notice that the English language alone can not deducethe two steps as shown in the example.⬔ Hence the english la...
Notion of Sprache⬔ The sprache is built upon a Language, with anintroduced order relation.⬔ Asssume the following applies:...
The statement relations⬔ α and β are commutatively related: Written α,β⬔ α and β are non commutatively related: Written α ...
The statement relations⬔ Immediately, it is clear:    =∊,    ~∊,    :∊>    #∊>
Application of Sprache⬔ Imagine, we want to desccribe the properties of anobject O . Imagine, properties A, and B are conj...
Conclusion⬔ Using the notion of Sprache, the description of datarelated to anything can be reduced to a strictly relatedse...
Upcoming SlideShare
Loading in …5
×

Ldml - public

143 views
131 views

Published on

Published in: Technology, Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
143
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Ldml - public

  1. 1. Lightweight Data Markup Language and Information Transfer Sayandeep Khan Drakoon Aerospace Invention Report Public Release March 13 2012
  2. 2. Containts→The notion of Language ⬔ What is missing→A language with an inter-sentence relation ⬔ The notion of Sprache ⬔ The statement relations ⬔ Combinatorial Description→Application of Sprache: the Design of LDML ⬔ Basics ⬔ Translation : Description guided action ⬔ Application : Machine guided investigation
  3. 3. The Notion of LanguageAlphabet: A set of charachter (basic symbols that can notbe decomposed), written ∑String: Any finite length sequence of elements of ∑. Thetotal sets of strings is written ∑*Grammar: A quadruple (V, T, G, S), where S is a set ofstart symbols, and T is a set of what is called terminalsymbols. V is called total vocabulary. S,T ⊂ V. G is a setof rules, that mapsσ → τ where both σ and τ ∊ (V∪T)*, and τ≠ϕLanguage: The set {w ∊T : S generates w} is a languagegenerated by the grammar
  4. 4. What is missing?⬔ The language is basically a set of terminal symbols.⬔ The generation of the terminal symbols are governedby the grammar⬔ However no strict relation between each terminalstatement is defined.⬔ In science, every two statement is Strictly related: withhelp of the one, the other can be deduced.
  5. 5. Example⬔ Statements in english language (Each terminal statement): » Iron is heavier than water » Iron sinks in water » Water is denser than airwith zero assitance from physics (which defines terms like„sinking“ and „denser“, and assigns logical relations), thesesentences can not be linked together.⬔ Using knowledge of physics, the axiom of transitivity maybe applied Iron sinks in water AND water is denser than air⇒ Iron sinks in water AND water sinks in air (From definition)⇒ Iron sinks in Air. (Transitivity)
  6. 6. Remarks⬔ Notice that the English language alone can not deducethe two steps as shown in the example.⬔ Hence the english language alone can not relate thestatements in an order relation like{statement one, statement two} > {statement three}⬔ Hence, we propose a language that has such an orderrelation defined onto it. Hence, we have {language, orderrelation}. We call this tuple a Sprache. Written as§(G,k) :={L(G), k} where k is the set of order relations.
  7. 7. Notion of Sprache⬔ The sprache is built upon a Language, with anintroduced order relation.⬔ Asssume the following applies: ∀ α,β ∊ L(G), ∃ ≻ | A ≻ β , α ∊ A, α ⊁ ϕ⬔ Define: k : ⋃≻⬔ Then the sprache is defined as: §(G) : {L(G), k}
  8. 8. The statement relations⬔ α and β are commutatively related: Written α,β⬔ α and β are non commutatively related: Written α > β⬔ α is defined as β : Written α : β⬔ α is equivalent as β : Written α = β⬔ α is nagetive to β : Written α ~ β⬔ α maps to β : Written α # β⬔ α and β related via unknown : Written α ?
  9. 9. The statement relations⬔ Immediately, it is clear: =∊, ~∊, :∊> #∊>
  10. 10. Application of Sprache⬔ Imagine, we want to desccribe the properties of anobject O . Imagine, properties A, and B are conjectured tobe intrinsic to O, but not observed. We write: O > (A,B)⬔ Imagine, of object O , properties C, and D areobserved . We write: O > (C,D)⬔ Imagine of an object O , properties E is measured tobe F. We write: O>(E:F)⬔ It is clear that the notion of Sprache, with a finite setof relations, can relate the properties of O, generating acomplete scientific description.
  11. 11. Conclusion⬔ Using the notion of Sprache, the description of datarelated to anything can be reduced to a strictly relatedset of statements. Missing relations indicate lack ofknowledge, worth investigating.⬔ The notion of sprache can highlight whereknowledge is missing, so a scientist examining theobject can immediately focus on missing knowledge⬔ Next : the combinatorial model of application ofsprache, a Sprache Prototype developed by BDA, theLDML, the LDML grammar, and applications of LDML

×