11 KiB
Número2 Lingua
Binary tree path key and step logic value body to have
base data of all digital format and math, which can
run as skill lib for terminator AI in FPGA or software.
Started as definition of the 72 whores of babel to learn a computer count;
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE properties SYSTEM "http://java.sun.com/dtd/properties.dtd">
<properties>
<comment>Undefined (Tree root)</comment><!-- TODO: Move this to enlish and replace with only ones and zeros chars ?? lol -->
<entry key="FF-ZZZ-zzz.DentalIso639Dash1Alpha2">und</entry>
<entry key="FF-ZZZ-zzz.DentalIso639Dash2SlashBAlpha3">und</entry>
<entry key="FF-ZZZ-zzz.DentalIso639Dash2SlashTAlpha3">und</entry>
<entry key="FF-ZZZ-zzz.DentalIso639Dash3">und</entry>
<entry key="FF-ZZZ-zzz.DentalGematria10.todoConverterToStibitzLaterLOL">0011,0100,0101,0110,0111,1000,1001,1010,1011,1100</entry>
<entry key="FF-ZZZ-zzz.DentalGematria10">0,1,2,3,4,5,6,7,8,9</entry>
<entry key="FF-ZZZ-zzz.DentalGematria10DTMF">zero,one,two,three,four,five,six,seven,eight,nine</entry>
<entry key="FF-ZZZ-zzz.DentalGematria10IPA">/ˈziːˈro/,/wʌn/,/tuː/,/tɹiː/,/ˈfaʊ.ə/,/faɪf/,/sɪks/,/ˈsɛvən/,/eɪt/,/ˈnaɪnə/</entry>
<entry key="FF-ZZZ-zzz.DentalGematriaTeen11">11,12,13,14,15,16,17,18,19</entry>
<entry key="FF-ZZZ-zzz.DentalGematriaTeen11DTMF">eleven,twelf,threeteen,fourteen,fiveteen,sixteen,seventeen,eightteen,nineteen</entry>
<entry key="FF-ZZZ-zzz.DentalGematriaTeen11IPA">/ɪˈlɛv.ən/,12,13,14,15,16,17,18,19</entry>
<entry key="FF-ZZZ-zzz.DentalGematriaTeenPlural">1's,2's,3's,4's,5's,6's,7's,8's,9's</entry>
<entry key="FF-ZZZ-zzz.DentalGematriaTeenPluralDTMF">ones,twoes,threes,fours,fives,sixxes,sevens,eights,nines</entry>
<entry key="FF-ZZZ-zzz.DentalGematriaTeenPluralIPA">/wʌnz/,2s,3s,4s,5s,6s,7s,8s,9s</entry>
<entry key="FF-ZZZ-zzz.DentalGematria16">A,B,C,D,E,F</entry>
<entry key="FF-ZZZ-zzz.DentalGematria16DTMF">aee,bee,cee,dee,eee,eef</entry>
<entry key="FF-ZZZ-zzz.DentalGematria16IPA">/eɪ/,/biː/,/siː/,/diː/,/iː/,/ɛf/</entry>
<entry key="FF-ZZZ-zzz.DentalGematria27">10,20,30,40,50,60,70,80,90,100,200,300,400,500,600,700,800,900,1000,2000,3000,4000,5000,6000,7000,8000,9000</entry>
<entry key="FF-ZZZ-zzz.DentalGematria27DTMF">ten,twenty,thirdty,fourty,fivety,sixty,seventy,eighty,nenety,honderd,twohonderd,threehondered,fourhundered,vifehondered,sixhondered,eighthondered,ninehondered,duizend,twwduizend,dreduizent,futduizem,vifduizen,sesduizem,agduizem,negduizen</entry>
<entry key="FF-ZZZ-zzz.DentalGematria27IPA">/tɪn/,/ɪˈlɛv.ən/,etc1,fourty,fivety,sixty,seventy,eighty,nenety,honderd,twohonderd,threehondered,fourhundered,vifehondered,sixhondered,eighthondered,ninehondered,duizend,twwduizend,dreduizent,futduizem,vifduizen,sesduizem,agduizem,negduizen</entry>
</properties>
Goal first stable release
- registrate china four corner reserved keyword set
- registrate terminator pie slices
- registrate matrix index move is tables
- import all lingua classic data (31K human languages)
- import all locale/iso+globetrotter data
- define all dental numbers(num+word+ipa+dtmf) for all languages
- import all CAS Registry data (270 million records)
- impl all bit based formats (1 bit)
- impl all trit based formats (octal = 3 bit)
- impl DEC144 (MSX BASIC NUMBER)
- impl 7HFF (unlimited math fraction type for octal-CPU)
- impl unitXC recursieve SI cross unit converter
Goal second stable release
Add all math functions ever found by a human.
Define every bit format and/or "struct" ever created on
all platforms and all architechtures of humankind.
This is the china based abacus octopussy DNA for skynet.
Write locale without locale
Howto write Dutch in Spaokenburgs ?
Locale loc = new Locale("NL");
System.out.println(loc.getDisplayName(new Locale("EN"))); // Dutch
System.out.println(loc.getDisplayName(new Locale("NL"))); // Nederlands
System.out.println(loc.getDisplayName(new Locale("NL_utr_spa"))); // Dutch...
As lingua key slut and without iso codes;
52-ACB-a.52-ACB-aee+.etc
Now without ascii latin or ascii numbers;
˦꜓꜉꜉꜏꜏˦꜏꜕꜍.˦꜓꜉꜉꜏꜏˦꜏꜕꜍꜑.etc
Howto format Hindi numbers ?
NumberFormat nf = NumberFormat.getInstance(new Locale("hi"));
System.out.println(nf.parse("४२").intValue()); // 42
System.out.println(nf.format(123)); // 123...
N2L Orginal
Tree key format;
<sectorId><zoneId>-<setId><chainId><netId>-<outerId><middleId><innerId>
- The sector can either be a phylosector, in which the constituent languages are considered to be in a diachronic relationship one with another, or a geosector, in which languages are grouped geographically rather than historically
- The second numeral is used to represent the ten zones into which each geosector is divided for referential purposes. The component zones, like the sectors, are described as either phylozones or geozones
- The second part of the linguascale consists of three capital letters, division into sets, chains and nets.
- The third and final part of the linguascale consists of up to three lowercase letters
N2L TreeKey Extended
DIFF with orignal lingua tree path key;
- Added support for an plus sign at the end to indicate an unofficial entry
- First two decimals are now hex
This means the 52 is still 52 but as hex which is another number internally.
This gives tree space to define all computer languages/schema's and number types.
N2L TreeKey Binary
Ascii:
52-ACB-aee+ = 11 bytes
Namespaces;
<sectorId><zoneId>-<setId><chainId><netId>-<outerId><middleId><innerId><bitFlags>
Minimal bits: <4><4>-<6><6><6>-<6><6><6><8> = 52 bits
Normal bytes; <1>-<3>-<3><1> = 8 bytes
Thats to basic byte allignment with just a bit of padding...
Now align to 72 bits or 9 bytes to work on 144 bit cpu.
Simple bytes aligned; <1><1>-<3>-<3>-<1> = 9 bytes
Extend octal aligned; <6><6><6>-<9>-<6><6><6>-<6><6><6><9> = 72 bits
N2L key slug;
<spaceId><subId><etherId>-<sectorId+zoneId>-<setId><chainId><netId>-<outerId><middleId><innerId><bitFlags>
space id 6 bit;
- 0-31 = locked by legacy (key input, if ascii try old human key converter)
- 32 = sage master system version space 0x20
- 33+ = reserved for major schema version upgrades
sub space id 6 bit;
- 0-31 = reserved for metatron Atari AI
- 32 = No2Lingua sub space for local and remote (generic core language)
- 33 = No2Lingua App Remote (NoStr relay remote signed apps)
- 34 = No2Lingua App Local (NoStr local application coded in N2L)
- 35+ = reserved for furture use
ether space id 6 bit;
- 0 = Default impl version
- 1+ = Alternative api version for libs
sector+zone 9 bit;
- bit 0-8 = 256 zone Ids with 256 sector Ids
Set of <setId><chainId><netId> 6 bit
- 0 = "A" index value of ascii upper case
- Z+ = locked by legacy
- 63 = no value
Set of <outerId><middleId><innerId> 6 bit
- 0 = "a" index value of ascii lower case
- z+ = locked by legacy
- 63 = no value
Flags as 9 bit
- bit 0 = '+' indicate 'new' type key (temp RFC number)
- bit 1 = '-' indicate private type key (refuse in public api's)
- bit 2-7 = free
- bit 8 = '?' no value given (in search request)
N2L TreeKey Slug
The TreeKey is searched down to match nearest implementation.
This is indication is done with slug's up to a maximum of;
Four N2L binary tree slugs deep.
4 x 144 = 576 bit N2L Search request domain
N2L TreeKey Font
Extend octal key: <6><6><6>-<9>-<6><6><6>-<6><6><6><9> = 72 bits = 9 bytes
Maybe encoding as bytes;
public static final OctoBitConverter<String> HEX_DIPAVALI = new OctoConvStringHexUtf8(new String[] {
"˧˥˩","˧˩˥","˧˥˦","˧˩˨","˧˦˦","˧˨˨","˧˥˥","˧˩˩","˥˩˧","˩˥˧","˥˦˧","˩˨˧","˦˦˧","˨˨˧","˥˥˧","˩˩˧"
}); // note: In real unicode renderer this (_LRPATH) renders as a single glyph per hex nibble.
Maybe encoding as tone letter or the china value, as seen in the pi terminators;
public enum T006ᖟ implements TerminatorPartᶦᶦ<T006ᖟ> {
PART_1("˦","四","4"),PART_2("˨","五","5"),PART_3("꜓","六","6"),
PART_4("꜕","七","7"),PART_5("꜊","八","8"),PART_6("꜏","九","9"),
;
}
public enum T009ᖟ implements TerminatorPartᶦᶦ<T009ᖟ> {
PART_1 ("˦","藍","blue"),PART_2 ("˨","皓","white"), PART_3 ("꜓","紅","red"),
PART_4 ("꜕","橙","orange"),PART_5 ("꜉","綠","green"),PART_6 ("꜋","黃","yellow"),
PART_7 ("꜍","褐","brown"),PART_8 ("꜏","黑","black"),PART_9 ("꜑","紺","purple"),
;
}
Maybe use a new triangle based number font to render trit based number parts.
TODO create new triangle tone letter based number glyphs.
Folding 3 tone letters into a triangle gives 1++ trit numbers.
Example for 1 trit with Hebrew vowels, but dots/lines have wrong offset:
△ִ▽ִ
△ֵ▽ֵ
△ֶ▽ֶ
Número2 Lingua Sainte Automatique Semblance
NOTE WIP mind map example
HolyAS is sort of ASM version of VHDL.
HolyBBX runs on HolyAS (100% to FPGA)
HolyC++ runs on HolyAS (100% to FPGA)
HolyJ++ runs on HolyAS (80% two FPGA)
Key slug deps on pie terminators
Pie terminator dep on BASIC keyword list
BASIC depends on value type parser: CodePointArrayFromUtf8 = FF-AAA-aaa = ˨꜋꜑... = 黑紅藍
Utf8 depends on ByteMSB and ByteLSB, etc etc
<lang:BASIC_KEY>.<WORD_1>.<DUTCH> = <CPAUtf8> <value>
FF-ZZZ-aaa.FF-YYY-aaa.79-AAA = FF-AAA-aaa 紺
FF-ZZZ-aaa.FF-YYY-aaa.52-ACB-a = FF-AAA-aaa Paars
52-ACB-a.FF-YYY-aaa.52-ACB-a = Nederlands
52-ACB-a.FF-YYY-aaa.52-ABA-c = Dutch
VS
52-ACB-a.52-ACB-a.FF-YYY-aaa = Nederlands
52-ACB-a.52-ABA-c.FF-YYY-aaa = Dutch
.name = feature
ascii has no meaning, think in triangle numbers !!!
// options so extend
52.extendSaber = {
[] = FF-YYY-aaa, // name = Dutch
[AAA -> range BBB -> 0] = FF-YYY-aaa, // name = Dutch
FF-ZZZ-abd, // DentalGlottoCode = nl
FF-ZZZ-sdf, // DentalIso639Dash1Alpha2 = dutc1256
}
// force "name" extesion on DILITHIUM
52-ACB.forceSaber = {
FF-YYY-aaa,
}
// force the children or the next child slug
FF-YYY-aaa.forceField {
52 -> 0, // force deeper up all levels
[70-80] @ FF-YXX-cde // for childs in range 70 to 80 to use forceField of arg
[] = FF-ZZZ-aaa, // force all children to have arg impl
}
FF-ZZZ.lockField {
a, // lock FF-ZZZ.a
b*, // lock FF-ZZZ.b++
[c*-d*] = FF-ABC-bb, // lock all c and d child with arg impl
[] = FF-ABC-ac, // lock all childs with arg impl
[e-z] @ FF-XYZ-xyz.FF-ZZB-aba
}
TSlug bipolar tree paths;
52* tree schema defines the
52*. tree schema
<USE_TYPE>.<DATA_TYPE>.<ENCODE_TYPE> = <BODY_TYPE> value
VS
<USE_TYPE>.<ENCODE_TYPE>.<VALUE_TYPE> = <BODY_TYPE> {
value
}
<USE_TYPE>.<IN_TYPE>.<OF_TYPE>.<SOUL_TYPE> = <BODY_TYPE> {
value
}
It looks like JS, one big key value map with recursive encoded keys and bodies.
With schema object keys slugs like LDAP oid's, but now with triangles as;
<6><6><6>-<9>-<6><6><6>-<6><6><6><9>
Than a computer knows what a "Integer" is and howto add an other "Integer".
And and render or voice it in any native human dialect.
You really want terminator AI ?