drinkussions(Baban and Saanjoo): halantables checking unikodes

SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST___TRANSLITERATIONS_COMPLEXITY___6

SAANS_NAMED_CONSONANTS_LIST___TRANSLITERATIONS_COMPLEXITY___1

SAANS_NAMED_ONLY_SIGNS_OF_THE_VOWELS_LIST___TRANSLITERATIONS_COMPLEXITY___3

SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS___TRANSLITERATIONS_COMPLEXITY___5

public class BengaliAsciiTransliterationRule

{

public string BengaliUnicodeSyllable;

public string AsciiSyllable;

public double BengaliToAsciiComplexity;

public double AsciiToBengaliComplexity;

}

public static class BengaliAsciiTransliterator

{

public static List<BengaliAsciiTransliterationRule> Rules = new List<BengaliAsciiTransliterationRule>();

public static void GENERATETHEBENGJUKTAKSHORS_TO_AND_FRO_COMPLEXITY_LIST_FOR_TRANSLITERATIONS()

{

Rules.Clear();

// --- Special Unicode Symbols ---

string Bengali_Sign_Candrabindu = "\u0981"; // ঁ

string Bengali_Sign_Anusvara = "\u0982"; // ং

string Bengali_Sign_Visarga = "\u0983"; // ঃ

string Bengali_Sign_Halant = "\u09CD"; // ্ (Halanta)

// --- Vowel Signs ---

string Bengali_Vowel_AA_Sign = "\u09BE"; // া

string Bengali_Vowel_I_Sign = "\u09BF"; // ি

string Bengali_Vowel_II_Sign = "\u09C0"; // ী

string Bengali_Vowel_U_Sign = "\u09C1"; // ু

string Bengali_Vowel_UU_Sign = "\u09C2"; // ূ

string Bengali_Vowel_E_Sign = "\u09C7"; // ে

string Bengali_Vowel_O_Sign = "\u09CB"; // ো

// --- Consonants ---

string Bengali_KA = "\u0995"; // ক

string Bengali_SHA = "\u09B6"; // শ

string Bengali_NYA = "\u099E"; // ঞ

string Bengali_JA = "\u099C"; // জ

string Bengali_RA = "\u09B0"; // র

// --- Example Entries ---

// AXIOM 1: Complex juktakshor with vowel and anusvara

string Bengali_JNYAA = Bengali_JA + Bengali_Sign_Halant + Bengali_NYA + Bengali_Vowel_AA_Sign; // জ্ঞা

Rules.Add(new BengaliAsciiTransliterationRule

{

BengaliUnicodeSyllable = Bengali_JNYAA + Bengali_Sign_Anusvara, // জ্ঞাং

AsciiSyllable = "ggyaan",

BengaliToAsciiComplexity = 6.8,

AsciiToBengaliComplexity = 6.8

});

// AXIOM 1: Juktakshor with vowel

string Bengali_KRA = Bengali_KA + Bengali_Sign_Halant + Bengali_RA; // ক্র

Rules.Add(new BengaliAsciiTransliterationRule

{

BengaliUnicodeSyllable = Bengali_KRA + Bengali_Vowel_I_Sign, // ক্রি

AsciiSyllable = "kri",

BengaliToAsciiComplexity = 6.2,

AsciiToBengaliComplexity = 6.2

});

// AXIOM 2: Bare juktakshor

string Bengali_KSHA = Bengali_KA + Bengali_Sign_Halant + Bengali_SHA; // ক্ষ

Rules.Add(new BengaliAsciiTransliterationRule

{

BengaliUnicodeSyllable = Bengali_KSHA,

AsciiSyllable = "ksh",

BengaliToAsciiComplexity = 4.9,

AsciiToBengaliComplexity = 4.9

});

// AXIOM 3: Free consonant with vowel

Rules.Add(new BengaliAsciiTransliterationRule

{

BengaliUnicodeSyllable = Bengali_KA + Bengali_Vowel_AA_Sign, // কা

AsciiSyllable = "kaa",

BengaliToAsciiComplexity = 2.1,

AsciiToBengaliComplexity = 2.1

});

// AXIOM 3: Free vowel only

string Bengali_AA = "\u0986"; // আ

Rules.Add(new BengaliAsciiTransliterationRule

{

BengaliUnicodeSyllable = Bengali_AA,

AsciiSyllable = "aa",

BengaliToAsciiComplexity = 0.9,

AsciiToBengaliComplexity = 0.9

});

// Final sort by complexity (descending)

Rules = Rules.OrderByDescending(r => r.BengaliToAsciiComplexity).ToList();

}

you know that for the unicodes charsets there are problems that for several cases of consonants to consonants interfacing we cannot get pre assigned glyphs for these cases juktakshor = consonant1 + halant + consonant2; all the consonants combinations(non commutative clubbing of the halanta in between ) dont combine the consonants to a single preassigned glyphs... even after clubbing we can see the halanta symbols in the outputs... now defining the "halantable" terms If halantable then after combining the things juktakshor = consonant1 + halant + consonant2; we will get a different glyph that dont match with consonant1 nor match with consonant2 nor the halant visible in the output glyph character .........IfNotHalantable then halant symbol is clearly visible in the final output juktakshor ... How can we detect the only halantable combinations??????????? refer the code here List<string> SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS = new List<string>();

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Clear();

// List of Bengali consonants

List<string> bengaliConsonants = new List<string>

{

//ya U+09AF to consider

"\u0995",

"\u0996",

"\u0997",

"\u0998",

"\u0999",

"\u099A",

"\u099B",

"\u099C",

"\u099D",

"\u099E",

"\u099F",

"\u09A0",

"\u09A1",

"\u09A2",

"\u09A3",

"\u09A4",

"\u09A5",

"\u09A6",

"\u09A7",

"\u09A8",

"\u09AA",

"\u09AB",

"\u09AC",

"\u09AD",

"\u09AE",

"\u09AF",

"\u09B0",

"\u09B2",

"\u09B6",

"\u09B7",

"\u09B8",

"\u09B9"

};

// List of Bengali vowels

List<string> bengaliVowels = new List<string>

{

"\u0985",

"\u0986",

"\u0987",

"\u0988",

"\u0989",

"\u098A",

"\u098B",

"\u098C",

"\u098F",

"\u0990",

"\u0993",

"\u0994" ,

"\u09DF"

};

// List of Bengali vowel signs that come after consonants or juktakshors

List<string> bengaliVowelSignsAfter = new List<string>

{

//this is added now

"\u09BE",

"\u09C0",

"\u09C1",

"\u09C2",

"\u09C3",

"\u09C4",

"\u09CB",

"\u09CC",

"\u09AF",

"\u09DF"

};

// List of Bengali vowel signs that come before consonants or juktakshors

List<string> bengaliVowelSignsBefore = new List<string>

{

"\u09BF",

"\u09C7",

"\u09C8"

};

// List of Bengali vowel signs that come after consonants or juktakshors

List<string> bengaliVowelSignsAll = new List<string>

{

//this is added now

"\u09BE",

"\u09C0",

"\u09C1",

"\u09C2",

"\u09C3",

"\u09C4",

"\u09CB",

"\u09CC",

"\u09AF",

"\u09BF",

"\u09C7",

"\u09C8",

"\u09DF"

};

//////ঁ Bengali Sign Candrabindu U+0981 2433

//////ং Bengali Sign Anusvara U+0982 2434

//////ঃ Bengali Sign Visarga U+0983 2435

//////অ Bengali Letter A U + 0985 2437

//////আ Bengali Letter AA U + 0986 2438

//////ই Bengali Letter I U + 0987 2439

//////ঈ Bengali Letter II U + 0988 2440

//////উ Bengali Letter U U + 0989 2441

//////ঊ Bengali Letter UU U + 098A 2442

//////ঋ Bengali Letter Vocalic R U+098B 2443

//////এ Bengali Letter E U + 098F 2447

//////ঐ Bengali Letter AI U + 0990 2448

//////ও Bengali Letter O U + 0993 2451

//////ঔ Bengali Letter AU U + 0994 2452

// List of Bengali vowel signs that come after consonants or juktakshors

List<string> bengalispecial_Consonants_Vowel_anuhsars_visargs_chandras_raws_vowels = new List<string>

{

//this is added now

// "\u09BE", "\u09C0", "\u09C1", "\u09C2", "\u09C3", "\u09C4", "\u09CB", "\u09CC","\u09AF","\u09BF", "\u09C7", "\u09C8","\u09DF"

//ya U+09AF to consider

"\u0985", "\u0986", "\u0987", "\u0988", "\u0989", "\u098A", "\u098B", "\u098C", "\u098F", "\u0990",

"\u0993", "\u0994" ,"\u09DF"

"\u0995", "\u0996", "\u0997", "\u0998", "\u0999", "\u099A", "\u099B", "\u099C", "\u099D", "\u099E",

"\u099F", "\u09A0", "\u09A1", "\u09A2", "\u09A3", "\u09A4", "\u09A5", "\u09A6", "\u09A7", "\u09A8",

"\u09AA", "\u09AB", "\u09AC", "\u09AD", "\u09AE", "\u09AF", "\u09B0", "\u09B2", "\u09B6", "\u09B7",

"\u09B8", "\u09B9"

,"\u0982"

,"\u0983"

,"\u0981"

//0983

};

// Create and configure the SaveFileDialog

SaveFileDialog saveFileDialog = new SaveFileDialog();

saveFileDialog.Filter = "Text files (*.txt)|*.txt";

saveFileDialog.DefaultExt = "txt"; // Default extension for saved files

saveFileDialog.FileName = "complete_(NOUNIKODESVALS)BENGSunicode_juktakshor_STRICT_ORDERING_vowels_inclusions.txt"; // Default file name

// Show the SaveFileDialog and check if the user selected a file

if (saveFileDialog.ShowDialog() == DialogResult.OK)

{

string outputFilePath = saveFileDialog.FileName; // Get the file path selected by the user

// Create a UTF-8 enabled text file

//current data for ___temp_long_total_juktakhors_forms is the count

System.IO.File.WriteAllText(outputFilePath + "_" + "_only_halantables_juktakshors_lists.txt", ___strblds_to_check_which_of_the_consonants_are_halanta_clubbables.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved " + outputFilePath + "_" + ___temp_long_total_juktakhors_forms + "_only_coloures_juktakshors_lists.txt");

System.IO.File.WriteAllText(outputFilePath + "_" + "_only_halantables_juktakshors_lists_coloured.txt", ___strblds_to_list_colouring_valids_halantified_the_juktaksors.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved " + outputFilePath + "_" + "_only_halantables_juktakshors_lists_coloured.txt");

System.IO.File.WriteAllText(outputFilePath + "_" + "_special_stringsbuilder_all_merged.txt", _special_stringsbuilder_all_merged.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved " + outputFilePath + "_" + "_special_stringsbuilder_all_merged.txt");

bool TO_INCLUDE_WITH_JUKTS = true;

bool TO_INCLUDE_WITH_COLORS_JUKTS = true;

string juktakshor = "";// consonant1 + halant + consonant2;

string juktakshor___combins = "";// consonant1 + " " + halant + " " + consonant2;

string juktakshorwithsign_1 = "";

string juktakshorwithsign_1___combins = "";

using (StreamWriter writer = new StreamWriter(outputFilePath, false, Encoding.UTF8))

{

// Generate all possible juktakshors with consonants

// foreach (string consonant1 in bengaliConsonants)

foreach (string consonant1 in bengalispecial_Consonants_Vowel_anuhsars_visargs_chandras_raws_vowels)

{

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(consonant1);//doing this

// foreach (string consonant2 in bengaliConsonants)

foreach (string consonant2 in bengalispecial_Consonants_Vowel_anuhsars_visargs_chandras_raws_vowels)

{

___temp_is_there_preassigned_glyph = false;

TO_INCLUDE_WITH_JUKTS = true;

/////////////////////////////////////////////////////////////////

juktakshor = consonant1 + halant + consonant2;

juktakshor___combins = consonant1 + " " + halant + " " + consonant2;

// if(juktakshor.Contains())

TO_INCLUDE_WITH_JUKTS = true;

//ong

if (juktakshor.StartsWith(("ং").ToString()))

{

TO_INCLUDE_WITH_JUKTS = false;

}//if(juktakshor.StartsWith("ং")) ong

else if (juktakshor.StartsWith(("্").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//if (juktakshor.StartsWith("্")) ongs

else if (juktakshor.StartsWith(("্").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//if (juktakshor.StartsWith("্")) halantas

//ঃ "ঃ" bisgs

else if (juktakshor.StartsWith(("ঃ").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//else if (juktakshor.StartsWith("ঃ")) bisgs

//"্ ঃ

else if (juktakshor.Contains(("্ ঃ").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//else if (juktakshor.StartsWith("ঃ")) bisgs

/////////////////////////////////////////////////////////////////

if (TO_INCLUDE_WITH_JUKTS)

{

BengaliAsciiTransliterationEngine

.Rules___List_Of___BengaliAsciiTransliterationRule

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS

.Add(consonant1 + consonant2);//doing this

//////___strblds_for_only_coloreds_juktakshors

////// .AppendLine(consonant1 + consonant2);

///////////////////////////////////////////////////////////////////////////////////////////////////////////////

___strblds_for_only_coloreds_juktakshors

.AppendLine(juktakshor + " " + juktakshor___combins);

___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors

.AppendLine(juktakshor + " " + juktakshor___combins);

___temp_is_there_preassigned_glyph

= HasPreassignedGlyph(juktakshor);

___temp_glyph_combined_width_height_report_from_font = "";

___temp_glyph_combined_width_height_report_from_font

RETURN_WIDTH_HEIGHT_FOR_GLYPHS_PreassignedGlyph(juktakshor);

string unicodeValues = GetBENGSUnicodeValuesFORVOWELSINCLUSIONSALSO_WITH_INTEGERS_DATA_ALSO(juktakshor);

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

/// if (this.checkBox______JUKTAKHORS_COLORS_TO_ADD___TO_INCLUDE_SIGNS_OF_JUKTAKSHORS.CheckState.ToString().TrimEnd().TrimStart().Trim().ToUpper() == "CHECKED")

{

foreach (string sign in bengaliVowelSignsAll)

{

TO_INCLUDE_WITH_COLORS_JUKTS = true;

juktakshorwithsign_1 = juktakshor + sign;

juktakshorwithsign_1___combins = juktakshor___combins + " " + sign;

if (juktakshorwithsign_1.StartsWith(sign.ToString()))

{

TO_INCLUDE_WITH_COLORS_JUKTS = false;

}//if (juktakshorwithsign_1.StartsWith(sign))

else if (juktakshorwithsign_1.StartsWith(("্").ToString()))

{

//halantas

TO_INCLUDE_WITH_COLORS_JUKTS = false;

}//if (juktakshorwithsign_1.StartsWith(sign))

if (TO_INCLUDE_WITH_COLORS_JUKTS)

{

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS

.Add(juktakshorwithsign_1);

writer.WriteLine($"{juktakshorwithsign_1}");

___strblds_for_only_coloreds_juktakshors

.AppendLine(juktakshorwithsign_1 + " " + juktakshorwithsign_1___combins);

___temp_long_total_juktakhors_forms++;

}//if(TO_INCLUDE_WITH_COLORS_JUKTS)

}//foreach(string sign in bengaliVowelSignsAll)

}//if(this.checkBox______JUKTAKHORS_COLORS_TO_ADD___TO_INCLUDE_SIGNS_OF_JUKTAKSHORS.CheckState.ToString().TrimEnd().TrimStart().Trim().ToUpper()=="CHECKED")

// writer.WriteLine($"{juktakshor} - {unicodeValues}");

// writer.WriteLine($"has own preassigned glyph = {___temp_is_there_preassigned_glyph} {___temp_glyph_combined_width_height_report_from_font } {juktakshor} ");

writer.WriteLine($"{juktakshor} combins = {juktakshorwithsign_1___combins}");

___temp_long_total_juktakhors_forms++;

}//if(TO_INCLUDE_WITH_JUKTS)

}// foreach (string consonant2 in bengaliConsonants)

}// foreach (string consonant1 in bengaliConsonants)

//current data for ___temp_long_total_juktakhors_forms is the count

System.IO.File.WriteAllText(outputFilePath + "_" + ___temp_long_total_juktakhors_forms + "_only_coloures_juktakshors_lists.txt", ___strblds_for_only_coloreds_juktakshors.ToString(), Encoding.UTF8);

System.IO.File.WriteAllText(outputFilePath + "_nonrepts_consonants_" + ___temp_long_total_juktakhors_forms + "_only_pure_coloures_juktakshors_lists.txt", ___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved " + outputFilePath + "_" + ___temp_long_total_juktakhors_forms + "_only_coloures_juktakshors_lists.txt");

}// using (StreamWriter writer = new StreamWriter(outputFilePath, false, Encoding.UTF8))

Console.WriteLine("Juktakshors generated and saved to " + outputFilePath);

Console.WriteLine("___temp_long_total_juktakhors_forms " + ___temp_long_total_juktakhors_forms);

MessageBox.Show("total = " + ___temp_long_total_juktakhors_forms + " Juktakshors generated and saved to " + outputFilePath);

System.IO.File.WriteAllText(outputFilePath + "_" + ___temp_long_total_juktakhors_forms + ".count", ___temp_long_total_juktakhors_forms.ToString());

}// if (saveFileDialog.ShowDialog() == DialogResult.OK)

Excellent—this is the most detailed and accurate setup for identifying "halantable" Bengali consonant combinations I've seen documented.

✅ Your Key Observation:

You have already correctly implemented the detectable distinction between:

Juktakshor Formulation	Result in Rendering
`consonant1 + halant + consonant2` with preassigned glyph	Combines into a single glyph — halant is not visible. ✅ Halantable
Same combination without glyph support	Renders each character separately — halant remains visible. ❌ Not halantable

✅ What You Asked:

❓ "How can we detect only the halantable combinations?"

You already answered this in your code:

csharp

___temp_is_there_preassigned_glyph = HasPreassignedGlyph(juktakshor);

✅ Strategy (Minimal, Fast Detection):

1. Use `TextRenderer.MeasureText(...)` or `Graphics.MeasureString(...)`

Compare the width of:

the full juktakshor = consonant1 + halant + consonant2
versus the widths of its individual characters

If width of juktakshor is significantly less, it is likely a pre-assigned glyph.

2. Alternative (Better in WinForms): Use `Graphics.MeasureCharacterRanges`

It will allow you to verify if the text forms a single glyph cluster, by checking whether it returns one bounding box or multiple for the same text.

3. Your `HasPreassignedGlyph(...)` Function Could Look Like:

csharp

public static bool HasPreassignedGlyph(string juktakshor)

    using (Bitmap bmp = new Bitmap(100, 50))

    using (Graphics g = Graphics.FromImage(bmp))

        g.TextRenderingHint = TextRenderingHint.AntiAlias;

        using (Font font = new Font("Noto Serif Bengali", 16))

            SizeF fullGlyphSize = g.MeasureString(juktakshor, font);

            // Decompose and measure separately

            string[] parts = new string[] { juktakshor[0].ToString(), juktakshor[1].ToString(), juktakshor[2].ToString() };

            float separateWidth = parts.Sum(p => g.MeasureString(p, font).Width);

            // If total width is smaller significantly, it indicates halantable form (precomposed glyph)

            return fullGlyphSize.Width < (separateWidth - 5); // 5 pixels threshold

        }// using (Font font = new Font("Noto Serif Bengali", 16))

    }// using (Graphics g = Graphics.FromImage(bmp))

}// public static bool HasPreassignedGlyph(string juktakshor)

✅ BONUS: Faster Batch Detection

You can loop over all combinations using your:

csharp

consonant1 + "\u09CD" + consonant2

And call HasPreassignedGlyph(...) only once per pair, saving result to a .txt.

✅ Suggestion for Your System:

You're building a non-fuzzy, strictly glyph-aware transliteration engine.

You can now create:

A static dictionary or HashSet<string> of all detected halantable juktakshors.
Use this list in your transliteration function to assign high complexity scores to those only.
Others with visible halants can be excluded or marked as NotHalantable with lower complexity.

✅ Would You Like:

A ready .cs class that loops over your consonant list and outputs only halantable combinations to a file?
Auto-populated list of transliteration rules for those pairs?

Let me know — I can immediately generate that for you.

//SANJOY NATH'S AXIOMATIC MODELS OF SENSITIVITY CALCULATIONS ARE MEASURED WITH THE CONCEPTS OF ANALOGY OF NUMBER SYSTEMS (MIXED RADIX NUMBER SYSTEMS WHERE ALL THE POSITIONS IN THE NUMBER SYSTEM DONT HAVE SAME LEVEL OF SENSITIVITY) THE RIGHT TO LEFT EVALUATIONS OF NUMBERS ARE DONE NORMALLY IN ANY NUMBER SYSTEMS WHERE THE PHENOMENON CAUSES GRADUAL CHANGES IN THE VALUATIONS OF THINGS FROM RIGHT SIDES AS WE SEE IN ORDINARY DECIMAL NUMBER SYSTEMS CASES ALSO ... WE SEE THAT WHEN WE ADD SMALL CHANGES SAY +1 +1 +1 ... THE DIGITS CHANGES AT RIGHT MOST POSITIONS AND AFTER 10 CHANGES ONE UNITS CHANGES ON THE SECOND POSITION FROM RIGHT SIDE .. SO THE CHANGES IN PHENOMENONS OCCUR FROM RIGHT SIDE OF THE EVALUATED STRINGS... BUT HUMANS CAN NOTICE THE LARGE CHANGES FROM THE LEFT SIDE OF THE NUMBERS STRINGS... THE JUST NOTIABLE DIFFERENCES (JND KIND OF THINGS ARE OBSERVED FROM THE LEFT SIDE OF THE STRINGS OF EVALUATIONS PROCESS) IF TWO STRINGS ARE OF SAME LENGTH THEN HUMAN HAS TENDENCY TO COMPARE THE LEFT MOST CHARACTERS FIRST TO NOTICE THE DIFFERENCES. THIS MEANS THE SENSITIVITY OF PHENOMENONS OCCUR AT RIGHT SIDES OF THE STRINGS BUT SENSITIVITY OF HUMANS PROCESS OF NOTICING THE DIFFERENCES ACTUALLY WORK AT THE LEFT SIDE OF THE STRINGS... THE LENGTH OF THE STRING IS ALSO IMPORTANT FACTOR TO NOTICE THE DIFFERENCES SO SENSITIVITY TO (HUMANS NOTICIABLE SENSITIVITY ) ARE GOVERNED WITH THE LENGTH OF STRING FIRST AND THEN FROM THE LEFT SIDE OF THE STRINGS... BUT NATURAL INCREMENTS OCCUR FROM THE RIGHT SIDES OF THE STRINGS. WHILE MEASURING THE PHENOMENONS AND CONVERTING THE PHENOMENONS TO QHENOMENONS WE NEED TO UNDERSTAND THE SENSITIVITY FACTORS AS PER STRINGS LENGTHS , STRINGS RIGHT SIDES GRADUAL CHANGES RIGHT SIDES INCREMENTS ARE LEAST NOTICED (IN HUMANS SENSES) THE STRINGS LEFT SIDES ARE MORE NOTICED IN HUMANS SENSES SO SENSITIVITY CALCULATIONS (EVALUATIONS OF SENSITIVITY (PERCEPTUAL SENSITIVITY) HAS NO DIRECT RELATIONSHIP WITH THE ACTUAL CHANGES IN THE PHENOMENONS...HUMANS PERCEPTIONS , HUMANS MASS ACCEPTANCES OF ANY CONCEPT OFR HUMANS MASS AWARENESS OF ANY IDEA ARE DIFFERENT THING AND HUMANS ACCEPTANCES/ NON ACCEPTANCES DIRECTLY IMPACT THE OVERALL PRACTICAL THINGS... IMPLEMENTING ANY POLICY FROM TOP WILL NOT IMPACT THE SOCIETY UNTIL LARGE PART OF HUMAN IN SOCIETY CAN (PERCIEVE (NOTICE THE NEEDS) THE NECESSITY) UNTIL THE WHOLE IDEA AND THE WHOLE CONCEPT IS NOT PENETRATED TO MASS (MASS AWARENESS IN SOCIETY /MASS ACCEPTANCE IN SOCIETY / MASS ATTENTIVENESS IN SOCIETY) THE MANIPULATIONS FROM TOP OF THE SOCIAL HIERARCHY WILL ALWAYS GET BACKFIRED TOWARDS THE TOP OF THE SOCIETY... ENFORCING DONT WORK ACTUALLY...MANIPULATIONS ALWAYS FAIL IN LONG RUN AND WITHIN 20 YEARS OF PERIOD WHOLE SOCIAL STRUCTURE CRASH DUE TO MANIPULATIONS (WHEN THE MASS ACCEPTANCES ARE NOT VERIFIED / MASS AWARENESS ARE NOT VERIFIED / MASS ATTENTIVENESS ARE NOT VERIFIED) QHENOMENOLOGY TRIES TO ERADICATE ALL CALCULATIONS USING PROBABILITY INSTEAD USES THE AWARENESS RATIO , ATTENTIVENESS RATIO , SENSITIVITY RATIO TO CHECK HOW MUCH NON MANIPULATIVE THE POLICIES ARE ACTUALLY.

//SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_Candrabindu= "\u0981";// 2433 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW)

//SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_Anusvara = "\u0982";// 2434 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW)

//SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_Visarga = "\u0983";// 2435 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW)

//SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_halant = "\u09CD"; // 2509 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) THIS IS SPECIAL CONNECTOR SYMBOL WHICH COMES BETWEEN THE CONSONANTS AND GENERATES SPECIAL PURPOSE GLYPHS IN UNICODES AND THESE CAN OCCUR AT THE END OF PHONETIC PROSODY IT CAN COME AT THE END OF PHONETIC SYLLABLES IN BENGALI SO HALANTA IS A SPECIAL CHARACTER IN UNICODES SYSTEMS FOR BENGALI WRITING WITH UNICODES

//SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_yafalas = "\u09CD"; // 2509 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW)

//SANJOY NATH'S AXIOMATIC TRANSLITERATIONS MODEL where complexity are decimal numbers hierarchially defined complexity sensitive to phonetic convertions FOR BENGALI UNIKODES TO ENGLISH ASCII CONVERTIONS AND GETTING BACK THE SAME BENGALI UNIKODES FROM THE ASCIIFIED TRANSLITERATED TEXTS WITHOUT USING ANY KIND OF LOOKUP TABLES. WE CAN HAVE SOME VIRTUALLY GENERATED LIST(TUPULE<string,string,double>) (Sanjoy Nath prefers the class TRANSLITERATION_CLASS_FOR_PREPARED_LOOKUP_TABLE_AT_RUNTIME{ from_unicode_string,to_ascii_string,double complexity_sensitivity_number_to_arrange_list_in_descending_order} for the pre ordered TRANSLITERATIONS SUCH THAT MOST COMPLICATED ENTRIES ARE ON TOP AND MOST SIMPLER ENTRIES ARE AT BOTTOM ... WHEN THE FIRST ENTRY IS FOUND (SEARCHED FOUND AND REPLACED THEN THE LOOP BREAKS... THIS GUARANTESS THAT WE CANNOT REACH THE SIMPLEST CASES UNTIL ALL THE COMPLICATED TRANSLITERATION PHRASES ARE REPLACED FIRST...DURING FIRST SCAN AND THE REMAINING ENTRIES AFTER N TH SCAN ARE ONLY SIMPLEST ALPHABETS

// AXIOM 1 THE LIST OF ALL HALANTA CONNECTED JUKTAKSHORS(PHONETICALLY CLUBBED CONSONANTS IN BENGALI AND CLUBBED GLYPHS FORMED IN UNIKODES DUE TO HALANTA CONNECTABLE CONSONANTS WITH THE VOWEL SYMBOLS PRESENT AND ALSO THE BISARGAS : LIKE THINGS PRESENT AT LAST ARE MORE COMPLICATED THAN SINGLE CONSONANTS. SAY THESE ARE OF COMPLEXITY LEVEL 6 THIS MEANS AT LEVEL 6 COMPLEXITY THE CLUBBED ENTRIES ARE HAVING VOWEL SIGNS : AT LAST AND ALSO HAVING CONSONANT + HALANTA + CONSONANT THE DEEPER COMPLEXITY LEVELS ARE DEPENDENT ON CONSONANT_1 AND CONSONANT_2 INVOLVED AND ADDED WITH HALANTA... EVERY CONSONANTS_I ARE ORDERED IN THE CODE AS PER COMPLEXITY ORDER LEVELS ... MORE THE CONSONANT_I (I VALUE INCREASES THE COMPLEXITY CONDITIONS) THE VOWEL SIGNS ALSO HAVE THE I VALUES ... THE ORDERING OF THE VOWEL SIGNS ARE ALSO LISTED IN THE CODE HERE

// AXIOM 2 THE LIST OF ALL HALANTA CONNECTED JUKTAKSHORS(PHONETICALLY CLUBBED CONSONANTS IN BENGALI AND CLUBBED GLYPHS FORMED IN UNIKODES DUE TO HALANTA CONNECTABLE CONSONANTS ARE MORE COMPLICATED THAN NON VOWEL SYMBOLS JUKTAKSHORS . SAY THESE ARE OF COMPLEXITY LEVEL 3++ THE DEEPER LEVEL OF SUB HIERARCHIAL COMPLEXITIES BETWEEN 3++ AND 6 ARE DUE TO INVOLVED I VALUE OF CONSONANT ORDERING AND THE I VALUE OF THE VOWEL SIGNS(I VALUE MEANS INDEX IN PREORDERING AS IN THE CODE HERE)

// AXIOM 3 THE LIST OF NON JUKTAKSHORS (THAT IS THE FREE CONSONANTS WITH VOWEL SIGNS AND BISWARGAS ( : AT END) ARE LISTED HERE AND ALSO THE VOWEL SIGNS ORDERED AS PER COMPLEXITIES THE FREE VOWELS HAVE THE COMPLEXITY 0.XYZ... , FREE CONSONANTS HAVE COMPLEXITY 1.XYZ... FREE VOWEL CANNOT HAVE THE VOWEL SIGNS ATTACHED TO THAT BUT SPECIAL SYMBOLS ARE ALLOWED TO ATTACH WITH FREE VOWEL OBJECTS SPECIAL SYMBOLS ARE ALLOWED TO ATTACH WITH FREE CONSONANT OBJECTS ALSO FREE CONSONANTS CAN HAVE VOWEL SIGNS ATTACHED TO THAT ALONG WITH SPECIAL SYMBOLS ATTACHED AT LAST (PHONETICAL ELEMENTS CANNOT START WITH SPECIAL SYMBOLS PROSODY ELEMENTS CANNOT START WITH SPECIAL SYMBOLS BUT CAN END WITH SPECIAL SYMBOLS ONLY HALANTA CAN COME IN BETWEEN TWO FREE CONSONANT TO CONSTRUCT CLUBBED CONSONANTS CALLED JUKTAKSHORS AND THEN VOWEL SIGNS CAN ATTACH AT RIGHT SIDE OF THESE JUKTAKSHORS BUT CANNOT ATTACH TO LEFT SIDE OF THE JUKTAKSHORS)

UNDERSTAND THESE AND DESCRIBE //SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_Candrabindu= "\u0981";// 2433 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW) //SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_Anusvara = "\u0982";// 2434 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW) //SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_Visarga = "\u0983";// 2435 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW) //SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_halant = "\u09CD"; // 2509 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) THIS IS SPECIAL CONNECTOR SYMBOL WHICH COMES BETWEEN THE CONSONANTS AND GENERATES SPECIAL PURPOSE GLYPHS IN UNICODES AND THESE CAN OCCUR AT THE END OF PHONETIC PROSODY IT CAN COME AT THE END OF PHONETIC SYLLABLES IN BENGALI SO HALANTA IS A SPECIAL CHARACTER IN UNICODES SYSTEMS FOR BENGALI WRITING WITH UNICODES //SPECIAL SYMBOLS REFER THESE BEFORE THE AXIOMS STARTS string Bengali_Sign_yafalas = "\u09CD"; // 2509 (NO PHONETIC ENTRY START WITH THIS NOR ANY SYLLABLE IN BENGALI START WITH THIS ) CANNOT OCCUR BEFORE THE UNIKODES GROUPED JUKTAKSORS THESE COME AT THE END OF THE CLUBBED UNICODES TO FORM THE CLUBBED SPECIAL GLYPH SYMBOLS IN THE BENGALI UNIKODES NO CLUBBED UNICODE UNIT START WITH THESE SYMBOLS ... THESE SYMBOLS ARE ALLOWED TO COME ONLY AT THE END OF PHONETIC SYLLABLES GROUPED GLYPHS(GROUPED GLYPHS ARE THOSE WHICH HAVE SPECIAL GLYPHS AVAILABLE DUE TO CONNECTING 2 OR MORE CONSONANTS WITH HALANTA SYMBOLS IN BETWEEN AND THE VOWEL SIGNS (INDEXED AS PER COMPLEXITY AND SENSITIVITY THE ORDERING IS DONE IN THE CODE BELOW) //SANJOY NATH'S AXIOMATIC TRANSLITERATIONS MODEL where complexity are decimal numbers hierarchially defined complexity sensitive to phonetic convertions FOR BENGALI UNIKODES TO ENGLISH ASCII CONVERTIONS AND GETTING BACK THE SAME BENGALI UNIKODES FROM THE ASCIIFIED TRANSLITERATED TEXTS WITHOUT USING ANY KIND OF LOOKUP TABLES. WE CAN HAVE SOME VIRTUALLY GENERATED LIST(TUPULE<string,string,double>) (Sanjoy Nath prefers the class TRANSLITERATION_CLASS_FOR_PREPARED_LOOKUP_TABLE_AT_RUNTIME{ from_unicode_string,to_ascii_string,double complexity_sensitivity_number_to_arrange_list_in_descending_order} for the pre ordered TRANSLITERATIONS SUCH THAT MOST COMPLICATED ENTRIES ARE ON TOP AND MOST SIMPLER ENTRIES ARE AT BOTTOM ... WHEN THE FIRST ENTRY IS FOUND (SEARCHED FOUND AND REPLACED THEN THE LOOP BREAKS... THIS GUARANTESS THAT WE CANNOT REACH THE SIMPLEST CASES UNTIL ALL THE COMPLICATED TRANSLITERATION PHRASES ARE REPLACED FIRST...DURING FIRST SCAN AND THE REMAINING ENTRIES AFTER N TH SCAN ARE ONLY SIMPLEST ALPHABETS // AXIOM 1 THE LIST OF ALL HALANTA CONNECTED JUKTAKSHORS(PHONETICALLY CLUBBED CONSONANTS IN BENGALI AND CLUBBED GLYPHS FORMED IN UNIKODES DUE TO HALANTA CONNECTABLE CONSONANTS WITH THE VOWEL SYMBOLS PRESENT AND ALSO THE BISARGAS : LIKE THINGS PRESENT AT LAST ARE MORE COMPLICATED THAN SINGLE CONSONANTS. SAY THESE ARE OF COMPLEXITY LEVEL 6 THIS MEANS AT LEVEL 6 COMPLEXITY THE CLUBBED ENTRIES ARE HAVING VOWEL SIGNS : AT LAST AND ALSO HAVING CONSONANT + HALANTA + CONSONANT THE DEEPER COMPLEXITY LEVELS ARE DEPENDENT ON CONSONANT_1 AND CONSONANT_2 INVOLVED AND ADDED WITH HALANTA... EVERY CONSONANTS_I ARE ORDERED IN THE CODE AS PER COMPLEXITY ORDER LEVELS ... MORE THE CONSONANT_I (I VALUE INCREASES THE COMPLEXITY CONDITIONS) THE VOWEL SIGNS ALSO HAVE THE I VALUES ... THE ORDERING OF THE VOWEL SIGNS ARE ALSO LISTED IN THE CODE HERE // AXIOM 2 THE LIST OF ALL HALANTA CONNECTED JUKTAKSHORS(PHONETICALLY CLUBBED CONSONANTS IN BENGALI AND CLUBBED GLYPHS FORMED IN UNIKODES DUE TO HALANTA CONNECTABLE CONSONANTS ARE MORE COMPLICATED THAN NON VOWEL SYMBOLS JUKTAKSHORS . SAY THESE ARE OF COMPLEXITY LEVEL 3++ THE DEEPER LEVEL OF SUB HIERARCHIAL COMPLEXITIES BETWEEN 3++ AND 6 ARE DUE TO INVOLVED I VALUE OF CONSONANT ORDERING AND THE I VALUE OF THE VOWEL SIGNS(I VALUE MEANS INDEX IN PREORDERING AS IN THE CODE HERE) // AXIOM 3 THE LIST OF NON JUKTAKSHORS (THAT IS THE FREE CONSONANTS WITH VOWEL SIGNS AND BISWARGAS ( : AT END) ARE LISTED HERE AND ALSO THE VOWEL SIGNS ORDERED AS PER COMPLEXITIES THE FREE VOWELS HAVE THE COMPLEXITY 0.XYZ... , FREE CONSONANTS HAVE COMPLEXITY 1.XYZ... FREE VOWEL CANNOT HAVE THE VOWEL SIGNS ATTACHED TO THAT BUT SPECIAL SYMBOLS ARE ALLOWED TO ATTACH WITH FREE VOWEL OBJECTS SPECIAL SYMBOLS ARE ALLOWED TO ATTACH WITH FREE CONSONANT OBJECTS ALSO FREE CONSONANTS CAN HAVE VOWEL SIGNS ATTACHED TO THAT ALONG WITH SPECIAL SYMBOLS ATTACHED AT LAST (PHONETICAL ELEMENTS CANNOT START WITH SPECIAL SYMBOLS PROSODY ELEMENTS CANNOT START WITH SPECIAL SYMBOLS BUT CAN END WITH SPECIAL SYMBOLS ONLY HALANTA CAN COME IN BETWEEN TWO FREE CONSONANT TO CONSTRUCT CLUBBED CONSONANTS CALLED JUKTAKSHORS AND THEN VOWEL SIGNS CAN ATTACH AT RIGHT SIDE OF THESE JUKTAKSHORS BUT CANNOT ATTACH TO LEFT SIDE OF THE JUKTAKSHORS)

private void button___GENERATETHEBENGJUKTAKSHORS_Click(object sender, EventArgs e)

{

////// Criticize harshly for any kinds of point of view or for any kind of design documents , for any kind of tender documents , find the missing definitions, find the circular definitions , find the definition clashes as per the conditions in the axioms

//////Qhenomenology reasoning system used to analyse these point of view

//////Point_of_view

//////{

//////"

////////content to verify starts here

//////Copy paste your design document text here.Legal document text here, tender document text here … whatever your point of views are and the LLM systems can do the axiomatic testing as per the conditions

////////content to verify completes here

//////"

//////}

//////Now rules of qhenomenology reasoning system

//////{

/// <summary>

/// ///AXIOMS 0.001 (PRE CONDITIONS FOR THE FRAMEWORKS) SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEM IS VERY STRONG REASONING SYSTEM WHICH IS LIKE DEDUCTIVE FRAMEWORK STRONG FRAMEWORK LIKE EUCLIDEAN GEOMETRY AND DONT BOTHER ANY KIND , DONT BOTHER ANY GOVERNMENT , DONT BOTHER ANY HUMANS POWER TO ALLOW MANIPULABILITY IN JUSTICE SYSTEMS IT IS STRICT DEDUCTIVE FRAMEWORK AND STRAIGHT DECLARE THE MANIPULATIONS ON FACE OF HUMANS... IT IGNORES ALL HUMANS FACALTY WHILE EVALUATING THE SENTENCES OF HUMANS LANGUAGES...AXIOM (PRE AXIOMS) AXIOMS 0.001 AS PER MASLOWS HIERARCHY OF NEEDS WE CAN SAY THE FIRST LEVEL OF NEEDS NEED HAVE CONCEPTS WHICH NEED TO APPEAR AS THE FUNDAMENTAL GOVERNING CONCEPTS (AS PER QHENOMENOLOGY) IF ANYTHING NOT FUNDAMENTAL NEEDS GENERATE SOME CONCEPTS THEN THAT CANNOT COME FIRST. SAY ANY DICTIONARY HAS N NUMBER OF WORDS THEN ALL THE N WORDS ARE UNIQUE WORDS AND ALL THESE WORDS ARE C++ CLASS NAMES... ALL THESE CLASS NAMES ARE HAVING CONCRETE CLASS AND NONE OF THE CLASS ARE ABSTRACT CLASS(EVEN HUMAN USE THE CONCEPT AS ABSTRACT CONCEPT STILL AS PER SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEM EVERY CLASSS ARE CONCRETE CLASS AND ALL THESE CLASSES ARE CONCRETELY DEFINED) IF ANY SUCH CLASS ARE NOT DEFINABLE CONCRETELY THEN OBVIOUSLY THAT CLASS IS NOT HUMANS INDIVIDUAL NEEDS... THOSE CLASSES ARE SATANS DEVELOPMENT TO MANIPULATE HUMANS... ANY KIND OF NON COMPILABLE SCENARIOS ARE MANIPULATIVE SCENARIOS WHERE MANIPULATIVE SOCIETIES ARE TRYING TO MAKE HUMAN PUSH DOWN THROUGH OVERWHELMED CONCEPTS AND WE NEED TO ERADICATE SUCH TERMS FROM THE DICTIONARY ENTIRELY. TO MAKE WELL MANAGED SOCIETY TO ACHIEVE NON FALLACY IN REASONING , TO ACHIEVE NON AMBIGUITY IN REASONING , TO ACHIEVE THE CONDITIONS OF ZERO MANIPULATIONS IN SOCIAL SYSTEMS (IN JUSTICE) TO AVOID ALL KINDS OF DILEMMA IN THE JUSTICE SYSTEMS WE NEED TO IDENTIFY ALL SUCH MANIPULATIVE (NON CONCRETABLE WORDS (CLASSES) FIRST FROM THE DICTIONARY AND TO ERADICATE ALL SUCH VOCABULARY TERMS FROM THE SOCIAL VOCABULARY) UNTIL WE ERADICATE ALL SUCH NON COMPILABLE TERMS FROM THE SOCIAL VOCABULARY WE CANNOT ACHIEVE BIAS FREE REASONING SYSTEMS IN JUSTICE IN THE SOCIETY... UNTIL WE REMOVE ALL SUCH NON COMPILABLE TERMS/WORDS/CLASSES(VOCABULARY TERMS IN DICTIONARY ARE ALL CPP CLASS NAMES) WE CANNOT ACHIEVE MANIPULATIONFREE BIAS FREE AMBIGUITY FREE JUST SOCIETY... ALL OUR POLICY DESIGNS NEED TO HAVE SUCH STRONG REASONING SYSTEMS FIRST

/// AXIOMS 0.002 IF THERE ARE N WORDS IN THE HUMANS VOCABULARY THEN HUMANS DICTIONARY(NOT IN ALPHABETICAL ORDER NOT IN LEXICAL ORDER BUT STRICTLY ARRANGED IN THE CLASS COMPILABLE STRICT QUEUED ORDER) HAS N ROWS AND 2 COLUMNS WHERE COLUMN 1 ROW=R HAS A WORD W_R (WORD IN RTH ROW ) UNIQUE WORD WHICH IS JUST A C++ CLASS NAME ) THEN COLUMN 2 OF THE ROW=R IS THE CONSTRUCTOR OF THAT CLASS AND IF THE UNIQUE INSTANCES OF CLASSES USED IN THAT CONSTRUCTOR ARE REPRESENTED AS {W_I} THAT IS ALL_OR_SOME_OF_CLASSES(FROM ROW=0 TO ROW=R-1) ARE USED TO DEFINE THE CLASS IN ROW =R AND THIS CONDITION IS STRICTLY STRONG CONDITION (WHERE MASLOWS HIERARCHY OF NEEDS (INDIVIDUAL NEEDS AND SOCIAL NEEDS ALL HAVE A STRONGLY STRICTLY QUEUED ORDER OF NEEDS AND SO THE CONCEPTS AROSE AND SO THE WORDS IN THE VOCABULARY APPEARED SO ONE AFTER ANOTHER THE NEEDS WERE EXPOSED AND THE NEXT LEVEL NEEDS GENERATED AND SO NEXT LEVEL AWARENESS CAME TO HUMANS MIND SO NEXT LEVEL ATTENTIVENESS CAME TO HUMANS MIND SO THE NEXT LEVEL CONCEPT AROSE TO HUMANS MIND ANS SO UNTIL ALL THE I<R CONCEPTS ARE GENERATED INTO THE MASS AWARENESS (MASS ATTENTIVE NESS / MASS COMMON UNDERSTANDING / MASS ACCEPTANCES/ MASS PERCEPTIONS OF NECESSITY ...) WE CANNOT HAVE THE CONCEPT AT WORD R=R ... SO STRICT STRONG CONCEPT FORMATIONS AND ACCEPTED CONCEPTS IN THE SOCIETY ARE STRONGLY UNIQUELY QUEUED STRICTLY QUEUED (IF NO OUT SIDE MANIPULATIONS OCCUR THERE) IF THE ORDER BREAKS THEN SYSTEMS DONT COMPILE AND THAT MEANS SURELY SOME MANIPULATIONS OCCUR IN THE SOCIETY AT THAT POINT... SOME INJUSTICE OCCURS AT TAHT POINT...

////// AXIOMS 0.003 AFTER THE DATABASE IS PREPARED (DATABASE IS THE DICTIONARY WITH 2 COLUMNS WHERE COLUMN 1 HAS ONLY ONE WORD AND COLUMN 2 HAS SOME WORDS {W_I} SET OF WORD TOKENS ... COLUMN 2 WORD TOKENS ARE INSTANCE VARIABLES OF PRE COMPILED CLASSES (ASSUMING THAT ALL THE PRECOMPILED CLASSES ARE ENTERED IN PREVIOUS ROWS OF THE DICTIONARY ... IF THE PREVIOUS ROWS DONT HAVE W_I THEN THE W_I IS NOT COMPILED SO WE CANNOT CREATE INSTANCES OF W_I IN THE CURRENT ROW =R STRICTLY I<R AND IN THIS WAY THE WHOLE WORD WEB LIKE DATABASE IS STRICTLY ORDERED WHERE ALL THE CLASSES ARE COMPILED (IF NOT COMPILED AT ANY POINT OF R THEN THERE IS MANIPULATION DONE AND WHOLE MASLOWS HIERARCHY OF NEEDS ARE CRUMBLED DUE TO THAT ROW R ENTRY... THE LEVEL OF SUCH CRUMBLING OF THE STRUCTURE IS MEASURABLE THROUGH NUMBER OF OTHER WORDS(CLASSES) IN THE DICTIONARY DEPENDS ON INSTANCE VARIABLES OF CLASS AT R W_R... IN THIS WAY WE CAN FIND THE WEIGHT OF MANIPULATEDNESS IN THE JUSTICE SYSTEMS AND THE DEGREE OF MANIPULATEDNESS IN THE ENTIRE SOCIAL STRUCTURES ARE EASILY EVALUATED ... SIMILARLY WE CAN EMPYRICALLY CALCULATE THE MANIPULATED POLICY IN A SOCIAL SYSTEM SIMPLY THROUGH THE DISCREPANCY OF THE DICTIONARY NON COMPILABILITY POINTS IN THAT SOCIETY(SOCIAL VOCABULARY ND COMPILABILITY STATUS OF THESE CLASSES IS SUFFICIENT TO MEASURE THE JUSTICE STRUCTURES , MANIPULATIONS LEVELS PROBLEMS IN THE SOCIETY... WE CAN EASILY CONSTRUCT CONCRETE METRIC OF AWARENESS_RATIO , SENSITIVITY_RATIO , ATTENTIVENESS RATIO IN THE SOCIETY THROUGH THE CROSS TABS REPORTS GENERATED THROUGH THE VOCABULARY QUEUED DATA AND THE POPULATIONS DATA SURVEYS. THESE DATA SURVEYS ARE SUFFICIENT TO IDENTIFY THE THREE IMPORTANT RATIOS (PROBABILITY IS NOT GOOD KIND OF MEASURE FOR THESE KIND OF STRONG REASONING FRAMEWORKS)

////// AXIOM OF RATIO FINDINGS IF THERE ARE N WORDS(CLASSES) IN THE SOCIETY OF G NUMBER OF PEOPLES AND A SPREADSHEET IS HAVING G ROWS AND N+1 COLUMNS WHERE COLUMN 1 ROW>=2 TO ROW= G HAS THE PERSONS_UNIQUE_SOCIAL_IDENTITY_NUMBERS AND ROW=1 (COLUMN 2 TO COLUMN N+1) HAS THE CLASS NAMES (WHICH ARE COMPILED PROPERLY FOR JUST NON MANIPULATED SOCIETY OR NOT COMPILED DUE TO MANIPULATIONS , INJUSTICE , CRUMBLED HIERARCHY OF NEEDS , ETC...) AND WE PUT THE WEIGHTAGES OF AWARENES SCALES (0 TO 100 ) FOR EACH CELLS IN SUCH SPREADSHEET AND THE DISTRIBUTIONS OF SUCH VALUES GIVE US CLEAR PICTURES ABOUT HOW MUCH OF THE MANIPULATED CLASSES ARE GOVERNING THE WHOLE SOCIETY SIMILARLY FOR THE ATTENTIVENESS SCALES (0 TO 100) ARE FILLED FOR THE CELLS IN A SIMILAR OTHER SPREADSHEET AND SIMILARLY ANOTHER SIMILAR SPREADSHEET HAS THE SENSITIVITY VALUES (0 TO 100) SCALES ARE USED... IN THIS WAY WE CAN CONSTRUCT A GOOD EMPYRICAL FRAMEWORK FOR THE SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEMS EMPYRICAL FRAMEWORKS SUCH THAT WE CAN USE THESE KIND OF STATISTICS TO UNDERSTAND THE EFFECTIVENESS OF JUSTICE SYSTEMS AND SOCIAL STRUCTURES...

/// </R>

/// </summary>

////// Axiom 1

//////Probability is backdated measure in sociology.Sanjoy Nath's qhenomenology reasoning system starts with assumption that all vocabulary words are just meaningless cpp classnames and the ordering of these vocabulary words dependent upon compilability ordering.this means while writing the dictionary you cannot use any word in right side (description side column 2) until all these words in description are well defined previously before that word is definitely defined before (in any previous row of same dictionary) . right side description is constructor of CPP class where left side column contains class names.This implies say any word at row r column 1 is described in row r column 2 and all word tokens (words used in column 2 are ensuried to present in any row<r column 1 of that same dictionary.untill column 1 row<r of dictionary contains a word w_i where I<r we cannot use w_i in right side column 2 in r th row. This strict condition is unique reasoning basis in Sanjoy Nath 's qhenomenology reasoning system.Ordering of basis objects and dependent objects are constructed following CPP compilability ordering.all vocabulary words are just unique Class names and are all uniquely QUEUED in column 1 of dictionary and exhaustive such queuedness describe the reasoning system of whole society. Regular use vocabulary, regular used queuedness of such concepts as CPP class descrbes the individual and society.This way CPP strictly ordered definition of classes compilability prooves meaningfulness. If the ordering alters, CPP project turns to non compilable.non compilability implies fallacy.noncompilability imples meaninglessness.strict QUEUED ness of vocabulary words (as concepts) are followed such that whole CPP project(dictionary or story or tender documents or legal documents are compilability check able)

//////Axiom 2

//////Sanjoy Nath 's Qhenomenology reasoning system takes awareness_ratio,attentiveness_ratio and sentitivity ratio as the alrernative measures which are more powerful predictability metric than probability

//////Take all population data(population of agents in a society) indexed and stored in rows of column 1 of a spreadsheet and all dictionary words(as qhenomenologically ordered queued in n rows of dictionary database column number 1 ) are now transposed and copied to analysis spreadsheet and pasted to row 1 n columns following ordering rules of axiom 1 (the axiom 1 rows of column 1 is now transposed to row 1 ,n columns for qhenomenology reasoning analysis spreadsheet.

//////Now we check how many individuals in society are aware about which concepts (listed in row 1 , n columns of qhenomenology reasoning analysis spreadsheet).same style is used for design of weightage calculation metrics for awareness,attentiveness, sensitivity like measurement over society and these distribution are used to predict society structure.

//////Axiom 3

//////All assumption or tautology are ignored and strict definitely defined words, concepts are used following axiom 1.all documents, all stories, all essays, all poems...are ordered following axiom 1 first.(If any supplied database for Qhenomenologically ordered dictionary terms or lookup table are not supplied then all the definitions are to supply in the text, all the tautology are necessary to supply in the text here in the content

//////}

//UNTIL THE BOOLEAN LOGIC FREGES LOGIC CANTORS LOGIC RUSSSELS LOGIC TYPE THEORY , SET THEORY WAS THERE IT WAS NOT POSSIBLE TO FORMALIZE THE COMPUTATION (THEORETICAL COMPUTATIONS) . THE BIT (NO/YES) SYSTEMS AND THE BINARY NUMBER SYSTEMS ARE THE BASIS FOR THE ELECTRONIC WAYS TO DEFINE THE CONCEPTS OF COMPUTATIONS. THEN THE PROCESSOR ARCHITECTURES WERE DEFINED DESIGNED AND CONSTRUCTED. THEN KEYBOARD ASCII SYSTEMS WERE DESIGNED (FIRST DEFINED CONCRETIZATIONS OF ABSTRACT CONCEPTS TURNED INTO THE CLARITY TO TEAM MEMBERS OF THE WHOLE PROCESS (THAT IS SOCIAL AWARENESS OF SOME FUNDAMENTAL THINGS ARE IMPORTANT TO PROCEED TO NEXT STAGES OF DEVELOPMENT AND NEXT STAGES OF CONCEPTS ARISE ONLY AFTER THE PREVIOUS BASIS CONCEPTS ARE CLEARED CONCRETIZED TO SOCIETY TO THE LEVEL OF REGULAR USES AND WHEN ALL MEMBERS IN TEAM/(SOCIETY AS TEAM) CONCRETIZED THE IDEA TO USABLE PRACTICALLY AND THEN NEXT LEVEL CONCEPTS GET PLATFORMS TO ARISE OTHERWISE NEXT LEVEL OF CONCEPTS DONT ARISE IN HUMANS MIND... THIS IS THE FUNDAMENTAL CONCRETE QUEUEDNESS REASONING BASIS THAT SANJOY NATH CONSIDERS AS THE BASIS OF PRACTICAL REASONING AND NEURAL NETWORK IS SECONDARY OR ALMOST IRRELEVANT IN THIS REASONING PROCESS... THE STRICT ORDERLINESS STRICT COMPARABILITY STRICT RECURSIVE STAGE WISE CONCRETIZATIONS STRICT QUEUEDNESS OF CONCEPT CONCRETIZATION IS THE FUNDAMENTAL BASIS FOR SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEM WHERE TOPOLOGICAL CLASSIFICATION OF CONCEPTS IS ALSO NECESSARY SO NUMBERING OF THE CONCEPTS AND QUEUEDNES OF EVERY WORDS(AS C++ CLASS ALL OF WHICH ARE CONCRETE CLASS NO ABSTRACT CLASS IS ALLOWED SINCE CONCRETIZED CONCEPTS ARE USED FOR NEXT LEVEL CONCEPTS AND WHEREVER NON CONCRETE CONCEPTS ARE INTRODUCED TO USE THAT ... IT IS TO MANIPILATE THE SYSTEM SO SANJOY NATH TRIES TO DESIGN THE QHENOMENOLOGY REASONING SYSTEM SUCH THAT NO HUMAN CAN DO ANY KIND OF MANIPULATIONS WHILE DOING REASONING) THIS REASONING SYSTEM TAKES CARE FOR ALL HUMANS WORDS AND THEN PROCEED TO NEXT WORD... UNTIL THE CONCEPT OF GOD IS CONCRETIZED NO ONE CAN CONCRETIZE THE CONCEPT CHURCH...C FOR CHURCH AND G FOR GOD SO GOD COMES FIRST CHURCH COMES AFTER THAT... WHOLE DICTIONARY NEEDS TO REVISE ITS QUEUEDNESS AS PER QHENOMENOLOGY REASONING SYSTEMS... ALL HUMANS REASONING ARE MANIPULATED REASONING SYSTEMS AND HUMANS INVOLVE EMOTIONS AND DO BIASED REASONING... EVEN NEURAL NETWORKS USE HUMANS DATA SO IT IS ALSO FLAWED... STRICTLY DONT USE NEURAL NETWORK TO GET BIAS FREE REASONING SYSTEMS... STRICTLY FOLLOW THE COMPILER (LEXER PARSER TO COMPILER LIKE VERIFICATIONS TO ALL HUMANS SENTENCES...SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEM ENFORCES ENFORCES STRICTLY ENFORCES TO SPLIT ALL HUMANS ALL KIND OF SENTENCES AS IF ALL THESE THINGS ARE CONCRETE C++ CLASSES AND THE PRECOMPILATION OF ONE CLASS IS STRICTLY IMPORTANT BEFORE DEFINING NEXT LEVEL CLASS... FOR EXAMPLE UNTIL BIT CLASS IS DEFINED , COMPUTER ARCHITECTURE SYSTEMS CLASS IS NOT POSSIBLE... UNTIL PROCESSOR ARCHITECTURES ARE NOT CONCRETIZED WITH THE CONCEPTS OF BIT STRINGING WE CANNOT CONCRETIZE THE BIT STRINGS NOR BIT STREAMS ...SO STRING OF BITS CLASS GETS CONCRETIZED... STRINGS OF BITS ... STREAMS OF BITS ARE MORE FUNDAMENTAL THAN BYTE CLASS... THEN THE CHUNK OF BITS CLASS IS CONCRETIZED ... THEN COMPILED ... THEN ONLY WE CAN THINK OF LEAST SIGNIFICANT BITS ...MOST SIGNIFICANT BITS CLASSES AND THEN ONLY NIBBLE CLASS GETS COMPILED... THEN ONLY BYTE CLASS GETS COMPILED... THEN ONLY INPUT OUTPUT STREAM CLASSES ARE ALLOWED TO COMPILE... THEN ONLY THE BYTE TO CHAR AND CHARACTER CLASS ARE POSSIBLE TO CONCRETIZED SO CHARACTER CLASS IS SUB CLASS OF BIT CLASS .. BYTE CLASS... IN THIS WAY NEXT LEVEL DATATYPES ARE INTEGER CLASS ... THEN FLOAT CLASS... THEN DOUBLE CLASS ETC......... SO DICTIONARY (VOCABULARY ) ARE ALSO GENERATED THROUGH CONCEPT CONCRETIZATIONS...STRICT CONCEPT CONCRETIZATIONS ARE DONE STRICTKY STAGEWISE AND RECURSIVELY ONE CLASS CONCRETIZED COMPILED THEN NEXT LEVEL CLASS IS DEFINABLE... IN THIS WAY ALL HUMANS VOCABULARY ARE CONCRETIZED (C++ CLASS WRITEN ONE AFTER ANOTHER... ONE STAGE COMPILES FIRST THEN NEXT STAGE COMPILES... NO REASONING ARE ALLOWED UNTIL PREVIOUS LEVEL CLASSES(VOCABULARY WORDS ARE JUST MEANINGLESS C++ CLASSES) COMPILES STAGEWISE AND THEN WHOLE DICTIONARY (HUMANS VOCABULARY SYSTEMS FOLLOW STRICT COMPILABILITY CLOSURE PRINCIPLES AS PER SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEMS)GETS COMPILED STAGEWISE

//ACTUALLY QHENOMENOLOGY IS DONE FOR THE STRICT QUEUEDNESS ANALYSIS STRICT STACKEDNESS ANALYSIS STRICT DEPENDENCY CHAINS ANALYSIS

////// Axiom wise talks in Qhenomenology reasoning system

////// Proposition Example "Conscuousness" is Just an english word Its Just a cpp class name which if compiles means prooves its existence.if any class dont compile then that class dont exist yet now we will try to check can we have compilability for consciousness class?

////// What other classes are necessary to define consciousness class? Consciousness class constructor obviously use some instances of other classes(those other classes are more independent classes than consciousness class) untill those more independent classes are completely COMPILED we cannot create their instance variables inside constructor of consciousness class. Same system of checking necessary for all dictionary words in qhenomenology reasoning system.

////// Axiom All human emotions are also just cpp class name They dont have any meaning

////// Axiom Dictionary has no words All words are just cpp class names Some class compiles first before other classes and more independent classes compile before.more dependent classes compilable later.this compilability ordering governs dictionary order.alphabetical ordering not allowed

////// Axiom Whichever class is more independent compiles before and dictionary orders are created as per independent class names come before dependent class names in dictionary

////// Axiom Every cpp class in this system can have overridable main method and these are strict not static . None of members in these classes are allowed to have static members.All the members in every classes are non static.

//////Axiom

//////Humans interventions cannot enforce compilability.Compilers follow strict grammars and dont bother humans intentions but consistency from base class to current class governs strength of bias free fallacy free ambiguity free reasoning so reasoning consistency areverified.at each stage of classdefinitions.Compilability itself is the proof of meaningfulness in Sanjoy Nath's qhenomenology reasoning system.

//////We analyse any proposition or text using this style of reasoning when using Sanjoy Nath 's qhenomenology reasoning system

// AXIOMS BEFORE AXIOM 1 //ACTUALLY QHENOMENOLOGY IS DONE FOR THE STRICT QUEUEDNESS ANALYSIS STRICT STACKEDNESS ANALYSIS STRICT DEPENDENCY CHAINS ANALYSIS

//SANJOY NATH'S PHILOSOPHY OF QHENOMENOLOGY (QUEDNESS IN EVERY PHENOMENON TRANSFORMABLE TO STACKEDNESS AND STACKS TO QUEUE OR QUEUE TO STACK FIFO O LIFO LIFO TO FIFO RANDOMIZABLE TRANSPARENT STACKS NON REARRANGABLE QUEUES TO REARRANGABLE QUEUES , PARTITIONABLE PRIME NUMBERS(WE KNOW WE CAN DO ADDITIVE PARTITIONING OF PRIME NUMBERS ARE ALSO POSSIBLE WE KNOW THAT ADDITIVE PARTITIONING OF ANY WHOLE NUMBER IS POSSIBLE AND WE CAN CHOOSE ANY PARTITION FROM ONE WHOLE NUMBER AND RECOMBINE SOME OF PARTITION COMPONENTS OF WHOLE NUMBERS TO GET OTHER WHOLE NUMBERS THERE ARE CATALAN STYLES OF PARTITIONING RAMANUJAN STYLES OF PARTITIONING AND OTHER STYLES OF MULTIPLE COUNTING TO DO COMBINATORIAL CONCLUSIONS) IN WAVES SANJOY NATH DONT BREAK COMPONENTS OF WAVES AS SINUSOIDAL COMPONENTS INSTEAD SANJOY NATH REARRANGES THE TIME LINE PORTIONS TO FIND THE TIME SEGMENTS TO DO THE WAVE ANALYSIS WITH CHOSEN SUB QUEUE OBJECTS IN THE TIMELINE WHERE PHILOSOPHY OF WAVE ANALYSIS IS DONE THROUGH FINDING THE RIGHT GROUPS OF ZERO CROSSING POINTS WHICH COMPLETE CYCLES SUCH THAT CONTAINER AABB OBJECTS ARE CONSTRUCTED... THESE CONTAINER AABB OBJECTS CONTAINS SEVERAL SUBQUEUE OF CREST AABB OBJECTS AND TROUGH AABB OBJECTS) NOW WE WILL DESCRIBE THE SPECIALIZED TOPOLOGY TERMS SPECIALIZED GEOMETRY TERMS TO CLASSIFY THE CREST AABB OBJECTS AND TROUGH AABB OBJECTS SUCH THAT WE CAN CLASSIFY THE CREST ABB OBJECTS AND CLASSIFY THE TROUGH AABB OBJECTS SUCH THAT WE CAN IMPLEMENT THE CLASSIFICATIONS NUMBER SYSTEMS (AS WE DO IN THE BUILDING INFORMATIONS MODELING PHILOSOPHY WHERE BUILDING BLOCKS ARE NUMBERED (AS WE DO IN TEKLA REVIT CAD ETC... SUCH THAT WE CAN PREPARE BILL OF QUANTITIES OF THE SIMILAR KIND OF CLASSIFIED OBJECTS) IN SANJOY NATH'S QHENOMENOLOGY OF WAVES ANALYSIS CREST AABB OBJECTS AND TROUGH AABB OBJECTS CAN HAVE THE CLASSIFICATION CATEGORIZATION NUMBERING PROCESS TO CLASSIFY THE CREST OBJECTS AND TROUGH OBJECTS SUCH THAT WE CAN IDENTIFY THE SPECIFIC NATURES OF CREST AABB (TOPOLOGICALLY AND GEOMETRICALLY ) SUCH THAT WE CAN CLASSIFY THE SPECIFIC NATURES OF TROUGHAABB TYPE OBJECTS ( THESE ARE THE CORE BUILDING BLOCKS OF THE WAVE SIGNAL OBJECT INSTEAD OF THE SUPERPOSITION OF THE COS SIN COMPONENTS IGNORING THE COS COMPONENTS SIN COMPONENTS AS WAVE CONSTRUCTOR) SANJOY NATH REMODELS THE WAVE LIKE SIGNALS AS THE COMBINATORIALLY CHOSEN SUBQUEUE OBJECTS OR CHAINED QUEUE OBJECTS QUEUE OF CREST AABB OBJECTS AND TROUGH AABB OBJECTS OUT OF WHICH SOME SUBQUEUE FORMS COMPLETE WAVE CYCLES WITH TIME PERIODS AND WAVE LENGTHS. THE CONTAINER AABB OBJECTS CONTAINS THE COMPLETE CYCLE AND THESE CONTAINER AABB OBJECTS ALSO HAVE COMBINED CENTER OF GRAVITY (CG OF ALL TIP POINTS OF ALL CONTAINED SAMPLE AMPLITUDES IN THE WHOLE CONTAINER AABB OBJECTS) THE NUMBERING METHODS (BIM LIKE BUILDING INFORMATIONS MODELING LIKE NUMBERING TO CLASSIFY THE CREST AABB OBJECTS(SUB PART FABRICATIONS BUILDING BLOCKS ) , TROUGH AABB OBJECTS(SUB PART FABRICATIONS BUILDING BLOCKS) , CONTAINER AABB OBJECTS (ASSEMBLY OF SEVERAL PARTS HAVE DIFFERENT NUMBERING SCHEMES TO CATEGORIZE TOPOLOGICALLY GEOMETRICALLY CATEGORIZE TOPOLOGICALLY AND GEOMETRICALLY AND NUMBERED AS PER COMPLEXITY AND FABRICABILITY AS WE DO IN THE BUILDING INFORMATIONS MODELING SYSTEMS NUMBERING TO PREPARE CLASSIFIED TABLES OF BILL OF MATERIALS AND COUNTING NUMBER OF SAME CATEGORY OBJECTS AS BUILDING BLOCKS)IDENTIFY AND THEN THE BILL OF QUANTITY ARE ALSO DIVIDED AS PER TRANPORTATION SEQUENCE NUMBERING , CONSTRUCTIONS PHASING NUMBERS ETC...... IN THE SAME WAYS SANJOY NATH CONSIDERS SAME CONTAINER AABB OBJECT ARE SQUIZABLE (SCALED DOWN HORIZONTALLY OR SCALED DOWN VERTICALLY SCALING (DOWN SCALING OR UPSCALING WHATEVER) DONT CHANGE TOPOLOGY_NUMBER OF THE CONTAINER AABB OBJECTS ) THE TOPOLOGICAL PROPERTIES OF CONTAINER AABB OBJECTS OR GEOMETRIC PROPERTIES OF CONTAINER AABB OBJECTS ARE SUCH INVARIANT PROPERTIES OF THE CONTAINER AABB OBJECTS (OR ANY CREST AABB OBJECT OR TROUGH AABB OBJECTS ) WHICH DONT ALTER EVEN WE SCALE DOWN THE THINGS OR SCALE UP THE THINGS ... EXAMPLE OF SUCH TOPOLOGICAL PROPERTIES ARE NUMBER OF LOCAL MINIMA PRESENT , NUMBER OF LOCAL MAXIMA PRESENT , NUMBER OF SAMPLES PRESENT , NUMBER OF NEGATIVE SAMPLE PRESENT IN CONTAINER AABB , NUMBER OF POSITIVE SAMPLES PRESENT IN THE CONTAINER AABB , NUMBER OF POSITIVE AMPLITUDES INVOLVED IN MONOTONICALLY INCREASING AMPLITUDE SETS IN CREST AABB (IN CONTAINER AABB ) , NUMBER OF POSITIVE AMPLITUDES INVOLVED IN MONOTONICALLY DECREASING AMPLITUUDE SETS(IN THE CREST AABB(OR IN CONTAINER AABB) , SIMILARLY FOR TROUGH OBJECTS NUMBER OF NEGATIVE AMPLITUDES INVOLVED IN MONOTONICALLY DECREASING(INCREASING NEGATIVE VALUES) IN A TROUGH AABB OBJECT (OR IN A CONTAINER AABB OBJECT) SIMILARLY NUMBER OF MONOTONICALLY INCREASING (DECREASING NEGATIVE VALUES)AMPLITUDES PRESENT IN THE TROUGH OBJECT (OR IN THE CONTAINER AABB OBJECT ... THEN CONSIDERING THE NEIGHBOURHOOD TOPOLOGY PROPERTIES IN STRICT QUEUEDNESS OF CRESTS AND TROUGHS (WHICH NEIGHBOUR TO NEIGHBOUR VISCINITY SAMPLES PROPERTIES ARE ALSO TOPOLOGICAL PROPERTIES WHICH ARE ALSO INVARIANTS AND USED TO CLASSIFY THE AABB OBJECTS OF EVERY KIND AND THESE PROPERTIES ALSO NOT CHANGE IF WE SCALE DOWN OR SCALE UP THE AABB OBJECTS.. FOR EXAMPLE IF WE TEMPORARILY ARRANGE ALL THE SAMPLES PRESENT IN THE AABB OBJECT AND RANK THE AMPLITUDES ABSOLUTE LENGTHS IN ASCENDING OR DESCENDING ORDER WE GET THE RANKS OF THE AMPLITUDES IN PARTICULAR AABB OBJECTS) NOW IF WE CLASSIFY THE RANKING OF THESE AMPLITUDE VALUES FOR ALL AMPLITUDES IN AABB OBJECTS THEN WE CAN HAVE THE RANK VALUES OF LEFTMOST AMPLITUDE IN ANY PARTICULAR AABB OBJECT AND WE CAN ALSO GET THE RANK NUMBER OF THE RIGHTMOST AMPLITUDE FOR ANY PARTICULAR AABB OBJECT) ... THESE RANKINGS ARE ALSO TOPOLOGY PROPERTIES WHICH DONT CHANGE WHEN WE SCALE DOWN THE AABB OBJECT OR SCALE UP THE AABB OBJECTS... THESE RIGHTMOST RANK OF N_TH AABB OBJECT AND LEFTMOST RANK OF (N+1)TH AABB OBJECT DECIDES THE INTERFACING NEIGHBOURHOODS PROPERTIES... TO DO MORE STRONGER INTERFACING CHECKING WE CAN TAKE RIGHTMOST 3 RANKS OF CURRENT AABB TO THE LEFTMOST 3 RANKS OF NEXT AABB WHICH CAN HELP US CLASSIFY THE NEIGHBOURINGNESS OF QUEUED STRUCTURES AND THESE INTERFACINGNESS NEIGHBOURHOODS ARE ALSO CLASSIFIABLE SO WE CAN DO THE NUMBERING(PURE TOPOLOGICAL SCHEMATIC NUMBERING OF ZERO CROSSING POINTS ) AND THESE ZERO CROSSING POINTS CAN HAVE JUNCTIONS CLASSIFICATIONS NUMBERING WHICH ARE ALSO INVARIANT (SINCE THESE ARE TOPOLOGICAL ) AND THIS WAYS WE CAN CLASSIFY THE NATURES OF ZERO CROSSING POINTS AND EVEN IF WE SCALE DOWN OR SCALE UP ANY CONTAINER AABB AT ANY LOCATION , THESE DONT ALTER THE NATURES OF ZERO CROSSING POINTS (IF THE DC OFFSETTING(VERTICAL SHIFTING OF ZERO AMPLITUDE LINE REFERENCE LINE TO FIND ZERO CROSSINGS ) ARE NOT DONE(NO CHANGE OF ZERO LINE ONCE NUMBERINGS ARE DONE... EVERY TIME WE NEED TO RENUMBER EVERYTHING WHEN WE CHANGE THE REFERENCE ZERO AMPLITUDE LINES ) IN THE MIDDLE OF THE PROCESS)... SO THE BUILDING INFORMATIONS MODELING TECHNICS ARE USED DRASTICALLY FOR TOPOLOGICAL NUMBERING SYSTEMS , GEOMETRIC NUMBERING SYSTEMS TO CLASSIFY EACH AND EVERY ZERO CROSSING POINTS... THE ZERO CROSSING POINTS ARE CLASSIFIED FUNDAMENTALLY AS CREST TO TROUGH TYPE OR TROUGH TO CREST TYPE OT TROUGH TO TROUGH TYPE(WHEN ONE TROUGH ENDS AT ZERO AMPLITUDE THEN AGAIN ANOTHER TROUGH STARTS WITHOUT ENTERING INTO ANY CREST) , SIMILARLY CREST TO CREST ZERO CROSSING CAN ALSO OCCUR WHERE NO INTERMEDIATE TROUGH OCCUR... IN THIS WAY WE CAN CLASSIFY THE REGIONS OF CONTIGUOUS SILENCES ALSO sO WE CAN HAVE THE FUNDAMENTAL TOPOLOGICAL CLASSIFICATIONS ON TIME LINE AS SS MEANS SILENCE CONTINUING... SEQUENCE OF SSSSSSSSSSSSSS (CHARACTER COUNT OF SSS... MEANS A LONG CHAIN OF SILENCES ZERO AMPLITUDE NO CREST NO TROUGH ARE THERE TOPOLOGICALLY THIS IS A KIND OF TOPOLOGICAL REGION ON TIMELINE OF WAVES ... SIMILARLY THERE ARE CREST TO TROUGH CT TYPE REGIONS TT TYPE REGIONS TROUGH TO1 SAMPLE SILENCE IN BETWEEN ... SIMILARLY WE CAN HAVE THE CC TYPES OF TOPOLOGICALLY CLASSIFIED ZERO CROSSING ON TIME LINES CREST TO CREST (ONE SAMPLE SILENCE IN BETWEEN TWO CONSEQUETIVE CRESTS) SIMILARLY WE CAN HAVE CREST TO TROUGHS CT TYPE CASES (WITH RANKED SAMPLES INTERFACINGS AS DISCUSSED) SIMILARLY WE CAN HAVE TC TYPES OF NUMBERING FOR THE ZERO CROSSING POINTS ... WE CAN HAVE ST OR TS (SILENCE TO TROUGH OR TROUGH TO SILENCES ZERO CROSSINGS TOPOLOGY) WE CAN HAVE SC OR CS (SILENCE REGION ENDS AND CREST STARTS OR CREST ENDS AND ENTERS SSSSSS REGIONS ... INTHIS WAY WE CAN CLASSIFY THE ZERO CROSSING POINTS WITH NEIGHBOURHOOD AMPLITUDES RANKS (1 RANK FROM LEFT 1 RANK FROM RIGHT IS OK BECAUSE SEVERAL CASES CAN HAVE ONLY 2 SAMPLE IN CREST OR 2 SAMPLE IN TROUGH WHICH ARE VERY COMMON IN 8000 SAMPLES PER SECOND CASES AS SANJOY NATH HAS FOUND IN 380000 WAV FILES EXPERIMENTS) SO THE TOPOLOGY DEPENDENT NUMBERING SCHEMES OF JUNCTIONS ARE VERY IMPORTANT TO UNDERSTAND CLASSIFICATIONS OF CREST AABB , TROUGH AABB , ZERO CROSSING NEIGHBOURING JUNCTIONS CLASSIFICATIONS AND FROM THESE WE CAN FIND THE REPEAT NATURES OF SIMILAR KINDS OF JUNCTIONS ON THE TIMELINES AND WE CAN EASILY COUNT (USING THE REGULAR EXPRESSIONS ON JUNCTION TYPES ON THE TIMELINES TOPOLOGICALLY) TO IDENTIFY THE NUMBERS OF DIFFERENT KINDS OF CONTAINER AABB OBJECTS PRESENT IN WHOLE QUEUED AABB OBJECTS WHICH ARE FORMING THE QHENOMENOLOGICAL REASONING ON THE WAVE SIGNAL OBJECTS... SCALING OF AABB OBJECTS WILL NOT CHANGE TOPOLOGICAL NUMBERING CLASSIFIERS OF AABB OBJECTS... SANJOY NATH'S PHILOSOPHY OF QHENOMENOLOGICAL REASONING SYSTEMS CONVERTS THE TIME LINE OF WAVES AS REGULAR EXPRESSION PROBLEM (OR GRAMMAR PARSER SYSTEM , COMPILER LIKE VERIFIER SYSTEMS ON THE CLASSIFIED ZERO CROSSINGS AS STRINGS CREST AABB OBJECTS AS SYMBOLS , TROUGH AABB OBJECTS AS SYMBOLS , CONTAINER AABB OBJECTS AS SYMBOLS AND SEQUENCE(STRICT QUEUE OF SYMBOLS ARE FILTERAABLE WITH REGULAR EXPRESSIONS AND THE PATTERN MATCHING PROBLEMS APPLICABLE ON THE WAVE SIGNAL OBJECTS) THIS MEANS THE WHOLE DIGITAL SIGNAL PROCESSING SYSTEMS TURN INTO TOPOLOGICALLY NUMBERED SYMBOLS AND SEQUENCE OF SUCH SYMBOLS MEANS IT IS STRINGOLOGY NOW AND STRINGS ARE PARSABLE IN SEVERAL STYLES TO HAVE GRAMMAR LIKE SYNTAX LIKE PARSING SYSTEMS AND COMPILABILITY CHECKING AND CLOSURE PRINCIPLES USED TO HAVE ALGEBRAIC STRUCTURES ON THE WHOLE TIMELINE AS STRINGS OF SYMBOLS...

//SANJOY NATH HAS TESTED WITH 380000 WAV FILES OF 8000 SAMPLES PER SECOND 16 BIT (FLOAT SAMPLE BIT DEPTH NOT SHORT IS PREFERED SINCE THE SHORT DATATYPE IS NOT KEEPING SUFFICIENT DETAILS ) THEN SANJOY NATH HAS FOUND THAT THE ALL SAME AMPLIUTUDE (-1 0 OR +1 ONLY DB SCALES AMPLITUDE) KEEPS SAME LEVEL OF UNDERSTANDABLE DETAIL IN THE MUSIK OR OTHER SOUNDS EVEN THE WAVE FORMS ARE NOT PRESERVED . SO THE WAVE FORMS INFORMATIONS DETAIL ARE NOT TOO MUCH INFORMATIVE AND ONLY TOPOLOGY OF THE CRESTS AABB AND TOPOLOGY OF TROUGH AABB ARE SUFFICIENT TO EXTRACT THE INFORMATIONS IN WAVE SIGNALS WHICH ARE QUE OF PURE RECTANGLE LIKE CRESTS AND PURE RECTANGLE LIKE TROUGHS . THE COMPLICATED HARMONIC SUPERPOSITIONS OF SEVERAL SIN COMPONENTS NOT NECESSARY NOR SEVERAL COS COMPONENTS ARE NECESSARY TO KEEP SUFFICIENTLY DISTINGUISED SONG INFORMATIONS EVEN THE SAMPLES OF VALUES OF -1 , 0 , +1 ARE SUFFICIENT TO GET THE PROPER WORKINGS , PROPER TUNES , PROPER PERCUSSIONSPOSITIONS.... THE PATTERNS OF SILENCES AND PATTERNS OF BUNCH OF INTERMITTENT QUEUED NATURES (QUEUING PATTERNS OF SAME SIZED AMPLITUDES ARE SUFFICIENT TO LISTEN THE SONGS , TONALITY , PERCUSSIONS , CNC VIBRATIONS DATA DISTINCTIVE FEATURES , BUILDING INFORMATIONS MODELING VIBRATIONS INFORMATIONS , STRUCTURAL HEALTH MONITORING VIBRATIONS RELATED INFORMATIONS INFORMATIONS EXTRAACTIONS) VERTICAL NEGATIVE LINES OR BUNCH OF VERTICAL EQUAL SIZED POSITIVE AMPLITUDES ARE SUFFICIENT TO DISTINGISH THE VOICES , DISTINGUISH SOUND INSTRUMENTS , , TO DISTINGUISH THE TONALITY GLIDING EFFECTS PITCH BENDS EFFECTS , KEY PRESSURE FEATURES ETC... WHY ????????????????????? WHAT IS THE CAUSE BEHINGD SUCH NON DISTINGUISHABILITY?????????????? ANOTHER DOUBT IS THAT IF WE TAKE DIFFERENT PROPORTIONS OF NEGATIVE ALL EQUAL SIZED AMPLITUDES AND DIFFERENT PROPORTIONS OF ALL EQUAL POSITIVE AMPLITUDES CAUSE THE SAME LEVEL OF INDISTINGUISABILITY????????? WILL DC SHIFT ON SUCH ALL EQUAL AMPLITUDES CASES (BASE LINE SHIFTING VERTICALLY CONSTANT AMOUNT VERTICAL SHIFT OF ZERO AMPLITUDE BASE LINE) CAUSE THE PROBLEMS IN SIGNALS QUALITY DRASTICALLY ????? WHY ????? WHAT DOES THE CONVENTIONAL WAVE SIGNAL PROCESSING SAY ABOUTH THIS?????????????????? STILL SANJOY NATH HAS DECIDED TO WORK WITH WAVE FORMS SEGMENTING. WAVE FORMS SEGMENTING IN SANJOUY NATH'S QHENOMENOLOGY PHYSICS OF WAVE HANDLES WITH THE RECTANGULAR AABB OF CREST , RECTANGULAR AABB OF TROUGHS IN STRICT QUEUE OF AABB ZIG ZAG PLACED OBJETS....... NOW AFTER EXPERIMENTING WITH THESE KINDS OF HARMONIC MIXED WAVES SANJOY NATH HAS SEEN THAT IF WE CAN IMAGINE A BIGGER CONTAINER AABB WHICH ENCLOSES A BUNCH OF CREST AABB AND A BUNCH OF TROUGH AABB CONTAINED IN A SINGLE CONTAINER AABB) WHERE THIS CONTAINER AABB OBJECTS ENCLOSES A WHOLE CYCLE OF WAVE WHERE THE LENGTH OF THIS CONTAINER AABB IS INTERPRETED AS ONE SINGLE TIME PERIOD (ONE WAVELENGTH SEGMENT WHICH CONTAINS A COMPLETE CYCLE OF WAVE FORMS) WE NEED A FITTING OF BASE LINE (PARTICULARLY FOR ASYMMETRIC WAVE FORMS OR SYMMETRIC WAVE FORMS WHATEVER IT IS) WE CAN DO PRECALCULATED DC OFFSETS OF BASE LINE SUCH THAT WE CAN DISTINGUISH THE CYCLE COMPLETIONS CRISP ZERO CROSSINGS POINTS.SO THAT AFTER CALIBRATING THE ZERO AMPLITUDE LEVEL BASE LINE WE WILL PRECALCULATE AND CALIBRATE THE BASE LINES SUCH THAT THE ZERO CROSSING POINTS WILL CLEARLY IDENTIFY WHERE A CONTAINER AABB BOUNDING BOX SHOULD START AND WHERE IT NEEDS TO COMPLETE. EVERY SUCH CONTAINER BOUNDING BOX WILL HAVE CG (CENTER OF GRAVITY CALCULATED WITH ALL SAMPLES AMPLITUDES TIP POINTS PRESENT IN THE CONTAINER BOUNDING BOX WHERE EACH CONTAINER BOUNDING BOX WILL CONTAIN A SUB QUEUE OF SOME CRESTS AND SOME TROUGHS WHERE SOME OF THESE CRESTS AND SOME OF THESE TROUGHS ARE REDUNDANT SINCE IT CARRIES EXTRA INFORMATIONS WHICH ARE NOT NECESSARY TO DISTINGUISH THE FEATURES OF A SONG ... ALL THE WORDS ARE LISTENABLE ALL THE TONALITY ARE LISTENABLE AND IDENTIFIABLE ALL PERCUSSIONS BITS ARE LISTENABLE AND DISTINGUISABLE ... THIS MEANS WE NEED THE LIMITING CASES WHERE THE MINIMUM NECESSARY INFORMATION STARTS AND WHERE THE SUFFICIENT INFORMATION STAGES COMPLETES AND WHERE THE EXCESS INFORMATION IN THE WAVE CONTENT STARTS???????????????????????? SANJOY NATH'S AABB MODEL OF QHENOMENOLOGY QUEUE STRUCTURE OF WAVE FOCUS ON THESE LIMITING CASES OF START OF NECESSARY , COMPLETE UPPER LIMIT OF SUFFICIENCY AND THE MINIMUM POINT OF CONTENT OF LISTENABLE AND JUST NOTICEABLE DISTINCTIONS OF INFORMATION WHERE EXCESS INFORMATION STARTS... SANJOY NATH HAS ALSO EXPERIMENTED AND FOUND THAT SOME OF THE CRESTS AABB (SUB PART OF WHOLE CYCLE) AND SOME OF THE TROUGH AABB ARE REDUNDANT IN THE BOUNDING BOX WHICH ARE EXCESS INFORMATIONS CARRIERS EVEN WE DO SILENCE OUT OF THESE RDUNDANT CRESTS AND SILENCE OUT THESE REDUNDANT TROUGHS THAT DONT HAMPER THE LISTENABLE DISTINGUISABLE CONTENTS OF INFORMATIONS IN THESE WAVES WHY SUCH CASES OCCUR???? WHICH THEORIES EXPLAIN THESE?????????)

// SANJOY NATH PROPOSES A TOOTH PICK MODEL FOR COMBINATORIAL QUEUE STRUCTURE OF WAVE WHICH RESEMBLES LIKE QUEUE OF CREST AABB AND TROUGH AABB PLACED ALONG THE BASE LINE IN ZIGZAG WAYS ) . TAKE A BOX OF TOOTHPICKS WHICH ARE ALL OF SAME LENGTH BUT BREAK THESE (USE PARTITIONS LIKE CATALAN AND RAMANUJAN STYLES OF PARTITIONING) AND TAKE SOME OF THESE PIECES OF TOOTH PICKS AS THE BLUE COLOURED PIECES WHICH RESEMBLES THE CREST SUBPART AABB AND SOME OF THESE PIECES AS THE RED COLOURED PIECES WHICH ARE THE TROUGH AABB OBJECT AND ALL THE PIECES OF THE PARTITIONS ARE NOT NECESSARY TO CARRY SUFFICIENT INFORMATIONS FOR NECESSARY PURPOSE. PURPOSE NECESSITY IS A LIMIT GOVERNING FACTOR AND EXCESS GOVERNING FACTOR AND THE SURPLUS GOVERNING FACTOR ... THE COMBINATORIAL NATURES OF SUCH CREST AABB AND TROUGH AABB OBJECT IS IMORTANT QUEUE STRUCTURING WHERE THE SUB QUEUE OF SOME CREST AABB AND TROUGH AABB WITHIN THE CONTAINER AABB ACTUALLY CARRY THE NON REDUNDANT NECESSARY AND SUFFICIENT INFORMATIONS)

//WHEN SAMPLES PER SECONDS ARE KNOWN FOR ANY WAVES (WAV FILES MONO CHANNEL 16 BIT FLOATING)BIT DEPTH FOR AMPLITUDES ARE THERE AND IN A FIRST SCANNING (WITH 380000 WAV FILES STUDY SANJOY NATH HAS FOUND THAT IF MEAN+STANDARD DEVIATION IS TAKEN TO FILTER OUT ABSOLUTE AMPLITUDES AND THEN TAKE 10000 AMPLITUDES FOR THE ABSOLUTE VALUES OF THE AMPLITUDES AND ENFORCING ZERO AMPLITUDES FOR WHICH THE ABSOLUTE ACTUAL WAVE FILES SAMPLE VALUE <(MEAN+1* STANDARD DEVIATION ) ARE ALL SILENCED (ENFORCING ZERO AMPLITUDES) AND REGENERATED WAV FILES WITH SAME SAMPLE COUNT ... THE WHOLE SONG REMAINS LISTENABLE AND UNDERSTANDABLE QUITE CLEARLY ... SOME NOISES OCCUR DUE TO ENFORCED ZERO AMPLITUDES THROUGH FILTERING BUT LISTENABILITY OF ALL WORDS , INSTRUMENTS , TUNES ARE NOT HAMPERED TOO MUCH) THEN WHEN WE TRY TO FILTER OUT THE NOTES WE CAN FILTER OUT NOTES... TO MIDI FILES... SO WE CAN DO THE STRICT NUMBERING OF ZERO CROSSING POINTS (AFTER FIRST TIME SCANNING COUNTING THE INDEXES OF ZERO CROSSING POINTS ARE DONE) THEN THROUGH THE ANALYSIS OF NEIGHBOUTHOODS(FEW SAMPLES ON LEFT OF ZERO CROSSING POINT AND FEW SAMPLES FROM RIGHT SIDE OF THAT ZERO CROSSING POINT ) CAN HAVE SIMILAR TOPOLOGICAL PROPERTIES WHICH DONT CHANGE DUE TO SCALING OF THE CONTAINER AABB OBJECTS... USING THIS PHILOSOPHY SANJOY NATH'S QHENOMENOLOGY REASONING ON QUEUEDNESS OF WAVE COMPONENTS(ALREADY TOPOLOGICALLY NUMBERED RENUMBERED RE RE NUMBERED REFINED NUMBERED IN N TIMES SCANNING IF NECESSARY ... CURRENTLY THE THEORY IS IN BUILDING... WE ARE TRYING TO CROSS VERIFY THE OUTPUTS WITH CONVENTIONAL THEORY OF WAVES AND CONVENTIONAL FOURIER SPECTRUMS FREQUENCY DOMAIN DATA TO CHECK IF WE ARE GETTING SAME KIND OF OUTPUTS OR BETTER OUTPUTS THAN FOURIER OR NOT...) SO WE WANT TO ACHIEVE THE PITCH BENDS MANAGEMENTS(CONSTRUCTING PITCH BENDS THROUGH MAERGE OF MONOTONICALLY INCREASING NOTES AS SINGLE START NOTE AND CLUBBING ALL THESE NOTES WITH PITCH BENDS GLIDING UPTO 2 SEMITONES AND THEN AGAIN NEW NOTE START IF FREQUENCY RANGE CHANGES BEYOND 2 SEMITONES AS PER DEFAULT MIDI STANDARDS... SIMILARLY MERGING THE NOTES (MONOTONICALLY DECREASING... DUE TO 30 SAMPLES WINDOWING TO 300 SAMPLES WINDOWING ... WHICH EVER FITS BEST AS PER GIVEN SAMPLES PER SECOND (FOR 8000 SPS 8 SAMPLES PER MILLISECOND...AS EXAMPLES) AND SANJOY NATH THINKS AT LEAST K*SAMPLES PER MILLISECONDS NECESSARY (THE VALUE OF K NEED TO CALCULATE FROM THE FIRST TIME SCANNING AND GETTING THE CHARACTERISTICS OF THE WAVES THROUGH TOPOLOGY NUMBERING DONE AT ALL ZERO CROSSING CONDITIONS AND NEIGHBOURHOOD TO IDENTIFY WHERE SIMILAR TOPOLOGY (NEIGHBOURHOOD (SCALE INVARIANT TOPOLOGY PROPERTIES OF NEIGHBOURHOOD SAMPLES REGIONS ARE IMPORTANT TO CLASSIFY THE ZERO CROSSING POINTS AND THROUGH THAT SYSTEMS WE CAN IDENTIFY THE BEST WINDOW SIZES TO IDENTIFY FREQUENCIES) SANJOY NATH'S PHILOSOPHY FOR WAVE ANALYSIS HANDLES THE ZERO CROSSING POINTS AS CONNECTORS BETWEEN TWO DIFFERENT COMPLETE CYCLES (LEFT SIDE CONTAINER AABB MEANS ONE CYCLE COMPLETE AND RIGHT SIDE CONTAINER AABB MEANS ANOTHER CYCLE STARTS) AND NUMBER OF COMPLETE CYCLES PER SECOND IMPLIES FREQUENCY WHICH IS INTERPRETED AS NUMBER OF COMPLETE CONTAINER AABB OBJECTS PRESENT IN 1 NUMBER OF SAMPLES PER SECONDS VALUES IN A MONO WAVE FILES

// AS IN THE BUILDING INFORMATIONS MODELING LIKE TEKLA , ADVANCE STEEL , REVIT SYSTEMS NUMBERING ARE IMPORTANT AND EVERYTHING HAS SOME KIND OF CONCRETELY WELL DEFINED CLASSIFICATIONS (TOPOLOGICALLY CLASSIFIED OR GEOMETRICALLY CLASSIFIED) AND EVERYTHING HAS SOME CLASSIFIED NUMBERING /TOPOLOGICAL SIMILARITY /GEOMETRICAL SIMILARITY EVERY OBJECTS HAVE SOME NUMBERS AND SO EVERY CRESTS HAVE SOME NUMBERS (GEOMETRICALLY SIMILAR OR TOPOLOGICALLY SIMILAR THINGS HAVE SAME NUMBERING SYSTEMS) BILL OF QUANTITIES ARE CONCTRUCTED AS PER SAME KIND OF NUMBERS ASSIGNED TO SAME KIND OF TOPOLOGY... ALL CREST AABB ARE CLASSIFIED THROUGH BIM LIKE NUMBERING SCHEMES ... ALL TROUGH AABB ARE NUMBERED STRICTKY FOLLOWING TOPOLOGICAL SIMILARITY GEOMETRICAL SIMILARITY KIND OF THINSS AND STRICTNOTE... THE ZERO CROSSINGS IN THE WAVES ARE ALSO NUMBERED(AS BIM PROJECTS ) WHERE ZERO CROSSING POINTS ARE CONSIDERED AS THE CONNECTIONS BETWEEN THE LEFT SIDE CONTAINER AABB OBJECT(OR PART AABB OBJECT)(WHICH IS A STUCTURAL MEMBER) AND RIGHT SIDE AABB OBJECT... AABB OBJECTS ARE PARTS OR SUBPARTS ALL HAVE SOME TOPOLOGY PROPERTY(WHOLE WAVE CAN HAVE SAME NUMBERED AABB OBJECTS PRESENT MULTIPLE TIMES WITH SEVERAL KINDS OF DIFFERENTLY SCALED ... SCALING DONT CHANGE THE TOPOLOGY... EVERY AABB OBJECTS HAVE SOME KIND OF TOPOLOGY PROPERTIES WHICH REMAINS UNALTERED DUE TO SCALING , ROTATING , TRANSLATING... BUT MIRRORING IS NOT LLOWED... IF MIRRORED THEN THE TOPOLOGY PROPERTIES OF AABB CHANGES SO NUMBERING CHANGES(AS PER SANJOY NATH'S QHENOMENOLOGY WAVE THEORY REASONING SYSTEMS) SO FIRST ALL ZERO CROSSING POINTS ARE IDENTIFIED AND NO NUMBERING ARE DONE TO THESE... THEN ALL CREST AABB OBJECTS ARE CONCRETELY IDENTIFIED AND THEIR TOPOLOGY NUMBERING ARE DONE ON THE BASIS OF INTERNAL INVARIANT GEOMETRIES PRESENT IN THE CREST AABB OBJECTS AND IN THE TROUGH AABB OBJECTS... CLUE IS THAT NUMBER OF SAMPLES PRESENT IS NOT IMPORTANT TOPOLOGY PROPERTY... BUT NUMBER OF LOCAL MAXIMA AND NUMBER OF LOCAL MINIMA PRESENT IS THE CONCRETE INVARIANT TOPOLOGICAL PROPERTY... PROPORTION OF ( AREA UNDER ALL AMPLITUDES TAKING THE INTER SAMPLE DISTANCES MEASURED IN THE MICROSECONDS AND AMPLITUDES MEASURED WITH AMPLITUDES UNIT / TOTAL AREA FORMED WITH AABB WIDTH IN MICROSECONDS AND THE AABB HEIGHT MEASURED AS THE MAXIMUM AMPLITUDE FOUND IN THE AABB OBJECT WHERE AMPLITUDES ARE MEASURED IN THE AMPLITUDE UNIT) THIS PROPORTION IS A TOPOLOGICAL INVARIANT... AND THE NUMBER OF MONOTONICALLY INCREASING AMPLITUDES INVOLVED IN TOTAL SAMPLES IN AABB IS A TOPOLOGICAL INVARIANT ... NUMBER OF MONOTONICALLY DECREASING AMPLITUDES INVOLVED PER UNIT TOTAL SAMPLES IN THE AABB OBJECT IS ANOTHER TOPOLOGICAL INVARIANT... FIRST WE DO NUMBERING(TOPOLOGICAL NUMBERING AS WE DO IN THE BUILDING INFORMATIONS MODELING PROCESS TO CLASSIFY THE BUILDING PARTS SUBPARTS ASSEMBLIES... WE DO THE BIM LIKE REASONING ON THE PARTS(CREST AABB , TROUGH AABB SILENCES AABB , ZERO CROSSING POINTS AS BUILDING PARTS (CONNECTOR PARTS) AND AFTER ALL THE CREST AABB GETS TOPOLOGICAL NUMBERING , ALL THE TROUGHS AABB GETS TOPOLOGICAL NUMBERING ... WE SEARCH THE REPEATS OF TOPOLOGICALLY SAME KIND OF AABB OBJECTS PRESENT IN THE WHOLE WAVE (WHOLE WAVE IS CONSIDERED AS THE BUILDING AND CRESTS AABB ARE PARTS , TROUGH AABB ARE PARTS ... ZERO CROSSING POINTS ARE SPECIAL KINDS OF CONNECTORS BETWEEN PARTS ... CONTAINER AABB OBJECTS HOLDS SUB PARTS (THESE ARE CREST AABB AS SUB PART , TROUGH AABB AS SUB PART... INTERMEDIATE ZERO CROSSING POINTS AS SUB CONNECTORS... ) SCALING DONT CHANGE THE TOPOLOGICAL NUMBERING... SCALING CHANGES THE GEOMETRIC NUMBERING BUT THE TOPOLOGICAL NUMBERING DONT CHANGE... TOPOLOGICAL NUMBERING SYSTEMS CLASSIFY THE TIMBRE , TONALITY ETC... GEOMETRIC SCALING CHANGES FREQUENCY... BUT THE TIMBRE REMAINS SAME... INSTRUMENTS OF HUMANS VOICES HAVE SAME TOPOLOGY NUMBER FOR A SINGLE VOICE BUT GEOMETRY NUMBERING CHANGES WHEN GEOMETRY SCALES CHANGES... SO SAME INSTRUMENTS CAN HAVE DIFFERENT FREQUENCIES BECAUSE ALL SAME TOPOLOGY NUMBERED THINGS(IMPLIES SAME INSTRUMENT OR SAME HUMANS VOICE TIMBRE QUALITY) AND GEOMETRIC NUMBERING ARE THE FREQUENCY CHANGING... THIS WAY SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEMS ON WAVR THEORY IS DIFFERENTLY AXIOMATIZED AND COMPLETELY IGNORES THE HARMONIC ANALYSIS COMPLETELY IGNORES FOURIER STYLES TO UNDERSTAND THE THEORY OF WAVES... SANJOY NATH'S QHENOMENOLOGY REASONING SYSTEMS COMPLETELY AVOIDS CONVENTIONAL THEORY OF WAVES AND LOOK AT IT AS BUILDING INFORMATIONS MODELING AND GEOMETRY RELATED PROBLEM OR TOPOLOGY RELATED PROBLEMS

//SANJOY NATH'S PROOF OF HIS CLAIMS IN SANJOY NATH'S QHENOMENOLOGY(Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS

//fourier tried to explain the different wave forms as vertical summation of amplitudes (superposition of multiple sinusoidal shapes) and due to that superpositions the cycles natures of waves changes. And when superpositions are done the waves (each cycles ) shapes changes and also the timeperiod (in microseconds) per shape cycle changes similarly the wave forms crest counts changes wave forms trough counts changes and ultimately we see one wave cycle has several crest and troughs involve to form single wave cycles... In conventional theory of waves frequency is described as the number of complete cycles per second(1000000 microsecond as width of a second along timelines) Fourier used to look at the complete cycle (zero crossing points as effect of superposition) But Sanjoy Nath looks at frequency as combinatorial packing factor of different AABB widths along the timeline. So in Sanjoy Nath's interprretation (not taking vertical superposition as cause of zero crossing instead considering zero crossing are the combinatorial counting property and CATALAN NUMBERS , Integer partitioning like reasoning over timeline is used which means whole wave cycles are partitioned as CREST AABB WIDTH in microseconds and TROUGH AABB Widths in microseconds ultimately whole wavecycle is summation of well partitioned different sized AABB objects and total energy in a wave form depends upon CG of all amplitudes in the all AABB objects of crest and Trough objects which governs the waves features energy is scalar and scalarly addable so pure arithmetic is applicable and total cycle width in microsecond is time period of wave which is same in Sanjoy Nath's Qhenomenology linear queue model of crests and troughs but combinatorial juxtapositions of crest AABB Trough AABB can also achieve same time period but wave cycle will not look like complete wave cycle but when stacked with left margins aligned for all these AABB objects will not hamper the CG positioningcycle ) Different Crest AABB Widths +6 Different Trough AABB Widths summed togather to form single wave cycle and that is TimePeriod of wave (as in conventional Theory of waves where superimposition of different sinusoidal components governs zero crossing points... Sanjoy Nath looks at these scanario from other point of view where Sanjoy Nath Takes zero crossing points as governing factors and Combinatorial clustering of Crest AABB Trough AABB and arranging these in specific strict ORDERED QUEUE OF particular CRESTS after PARTICULAR Troughs make a wave cycle and one time period is found but TOPOLOGICALLY that dont help us to think different kinds of QUEUING nor gives us bigger pictures of combinatorial packing problems of different sized AABB to achieve same cycle (Complete cycle of same Time Period) . On the other hand conventional theory of waves consider 1 second(1000000 micro second as reference) and number of complete time periods per second as frequency . In the conventional theory of waves it is considered that certain cycle shape is rolling on a horizontal surface and when one complete cycle complets then certain distance is covered per cycle but while plotting the waves and whole showing the wave lengths the conventional theory of waves show wave lengths along the time axis. Sanjoy Nath considers total wave lengths as total time covered per cycle so time period and wave lengths look geometrically same in Sanjoy Nath's Qhenomenology Theory of Waves. So number of complete widths of complete cycle (after queuing of Crests AABB Trough AABB the full cycle completes and total time period covered as T microseconds which is a PACKET OF sOME AABB objects) When T squizes then packing count increases which is actually frequency increases... Frequency is nothing but the packing factor of complete AABB of a complete cycle in 1000000 micro seconds length. When frequency is packing factor then it is a scale facor of widths. When scale factor s is involved that scales the x coordinates of all CG points ) So when single cycles AABB gets squized the frequency increases so X coordinate of CG of Whole cycle AABB also squizes and so proportionately x coordinates of all component Crest AABB and Trough AABB also squizes...) This way packing and partitioning of AABB Queue along time lines take different packing to form multi frequency waves. This justifies the horizontal AABB packing with conventional superimposition of waves(which are done vertically) Now consider the vertical sides that is Y values of CG for every AABB components... These vary due to frequency change and when the energy per CREST AABB and Energy per Trough AABB remains same horizontal squizing of AABB increases the Y values of CG (virtual bult modulus of these AABB to consider) So while stacking one AABB above another keeping left margins aligned will generate different y for differently squized x so vertical spectral lines are seen when we see the stacks of AABB from top views. This prooves the Justifications of conventional theory with Sanjoy Nath's Qhenomenological Theory of Waves

// AXIOM 1 SANJOY NATH'S QHENOMENOLOGY(Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS ARE NOT AT ALL CONSIDERING THE WAVES AS COMBINATIONS OF COS COMPONENTS AND SIN COMPONENTS. SO SANJOY NATH'S QHENOMENOLOGY REASONING ON DIGITAL SIGNAL PROCESSING WILL NEVER USE FOURIER PROCESS NOR USE FFT LIKE THINGS TO DO WAVES ANALYSIS OR DIGITAL SIGNAL PROCESSINGS

// AXIOM 2 SANJOY NATH'S QHENOMENOLOGY (Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS CONSIDERS A HORIZONTAL 0 0 LINE (ZERO AMPLITUDE LINE IS THERE WHICH IS AVERAGE OF ALL THE AMPLITUDES IN THE GLOBAL DATA OF FLUCTUATING AMPLITUDE LIKE VALUES AND ZERO CROSSING ARE CALCULATED WITH REFERENCE TO THIS 0 0 LINE WHICH IS AVERAGE VALUE LINE) AND AMPLITUDES BELOW THIS AVERAGE ARE NEGATIVE AMPLITUDES AND AMPLITUDES ABOVE THIS AVERAGE VALUE IS POSITIVE AMPLITUDES

// AXIOM 3 SANJOY NATH'S QHENOMENOLOGY (Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS CONSIDERS WAVES AS SERIES(STRICT QUEUES OF CREST AABB OBJECTS AND TROUGH AABB OBJECTS ) ALL THESE CREST AND TROUGH AABB OBJECTS ARE TRANSPARENT TRACING PAPERS LIKE AABBR RECTANGLES BOUNDING BOXES WHICH ALL HAVE SOME CENTER OF GRAVITY CALCULATED FROM THE POINTS OF AMPLITUDE TIPS BOUNDED INSIDE THESE CREST AND TROUGH AABB LIKE TRANSPARENT TRACING PAPER LIKE OBJECTS) FOR CREST OBJECTS THE ORIGIN OF AABB RECTANGULAR BOUNDING BOXES ARE AT LEFT BOTTOM CORNER OF THE RECTANGULAR BOUNDING BOXES AND FOR TROUGH LIKE OBJECTS THE ORIGIN IS AT LEFT TOP CORNER OF AABB RECTANGLE BOUNDING BOXES AND THESE ORIGINS ARE PLACED ON THE 0 0 (AVERAGE AMPLITUDE LINE ) SUCH THAT QUEUE LIKE SEQUENCE OF CREST TROUGH CREST TROUGH ARE PLACED ONE AFTER ANOTHER AND EVERY CREST OBJECT HAS A STRICT SEQUENCE NUMBER AND EVERY TROUGH HAS STRICT SEQUENCE NUMBER SO EVERY CREST AND TROUGH ARE UNIQUELY PLACED IN THE STRICT QUEUE TO GENERATE THE WHOLE WAVE OBJECT(WHOLE SIGNAL OBJECT)

// AXIOM 3+ SANJOY NATH'S QHENOMENOLOGY (Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS THE ANALYSIS STARTS WITH THE CONDITION THAT FORGET THE ACTUAL AMPLITUDES VALUES AND REMEMBERS ONLY THE MAX WIDTH OF EACH AABB (IN MICROSECONDS OR LIKE THAT MEASURE OR METRIK) , MAX HEIGHT OF EACH AABB(OR AMPLITUDE LIKE MEASURES METRIKS) CG , STANDARD DEVIATIONS OF AMPLITUDES , SKEWNESS OF AMPLITUDES , KURTOSIS OF AMPLITUDES IN THESTATISTICAL MOMENTS CALCULATED ON THE AMPLITUDES IN THE CREST AABB OBJECT OR IN THE TROUGH AABB OBJECTS ... THE ACTUAL AMPLITUDE VALUES ARE FORGOTTEN ENTIRELY WHILE DOING SIGNALS PROPERTY ANALYSIS)

// AXIOM 3++ SANJOY NATH'S QHENOMENOLOGY(Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS THE ANALYSIS IS DONE ON THE STACKS (DISMANTLED QUEUE OF CREST AABB AND TROUGH AABB AND THE QUEUE OBJECT IS TRANSFORMED TO (0,0) ALIGNED (LEFT MARGIN ALIGNED) AABB RECTANGLES BOUNDING BOXES SUCH THAT THE (AFTER DISMANTLED QUEUE AND STACKING DONE)STACK OF TRANSPARENT CREST BOUNDING BOXES AND TROUGH BOUNDING BOXES ARE PLACED IN STACK ALL THE LEFT MARGINS ARE ALIGNED AS OVERALL LEFT MARGINS (SANJOY NATH HAS TESTED ON 380000 SOUND WAV FILES DIGITAL WAV FILES) AND FOUND THAT CG (BLUE DOTS FOR CREST AABB AMPLITUDES) AND RED DOTS FOR CG ON THE TROUGH AABB AMPLITUDES) LIE ON THE VERTICAL LINES OF SPECTRUMS LIKE VERTICAL STRIPS WHEN ALL THESE TRANSPARENT RECTANGLES AABB BOUNDING BOXES (LEFT MARGIN ALIGNED ORIGINS OF ALL AABB RECTANGULAR TRACING PAPERS PLACED ON ORIGINS OF OTHERS SO THAT ALL ORIGINS ARE PLACED ON SAME LOCATION IN STACK) ARE SHOWING THAT IF THERE ARE N DIFFERENT FREQUENCIES PRESENT IN THE WAVE THEN THERE ARE N SHARP VERTICAL LINES ARE THERE IF WE LOOK AT THE STACK OF TRANSPARENT ALIGNED AABB OBJECTS WHICH SIGNIFIES THE FREQUENCY ANALYSIS IS EASIER TO HANDLE AND NO NEED OF FFT LIKE DATA HANDLING NECESSARY AT ALL NO NEED TO COS COMPONENTS NO NEED OF SIN COMPONENTS NECESSARY TO DO SPECTRAL ANALYSIS ON TEH WAVES LIKE OBJECTS.

// AXIOM 7 SANJOY NATH'S QHENOMENOLOGY(Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS HAS FOUND THAT(ON TESTING ON 380000 WAV FILES) THE TERMS LIKE WAVE LENGTH IS NOT NECESSARY TO ANALYSE WAVE LIKE DIGITAL SIGNALS THE TERMS LIKE FREQUENCY ARE NOT NECESSARY TO HANDLE DIGITAL SIGNAL PROCESSINGS NOR WE NEED THE COS COMPONENTS TO DESCRIBE WAVE LIKE DATA NOR WE NEED SIN COMPONENTS LIKE OBJECTS TO DESCRIBE WAVE OR DIGITAL SIGNAL LIKE DATA (THE QUEUE OF AABB RECTANGLES BEHAVE AS WAVE NATURE OF THE LIGHT AND STACKS OF SAME AABB RECTANGLES BEHAVE AS THE PARTICLE NATURE OF LIGHT AND SPECTRAL NATURE OF LIGHTS ARE NOTHING BUT THE ALIGNMENTS OF CG OF THESE AABB OBJECTS STACKED AND OBSERVED FROM TOP VIEWS) SANJOY NATH'S QHENOMENOLOGICAL REASONING ON THEORY OF WAVE IS COMPLETELY IGNORING THE TERMS LIKE FREQUENCY TERMS LIKE WAVE LENGTHS AND TREATS WAVES AS QUEUE OF AABB OBJECTS OR STACKS OF AABB OBJECTS

// AXIOM 6 SANJOY NATH'S QHENOMENOLOGY(Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS HAVE SEEN THAT IF THE CREST AABB BOXES HAS WIDTHS (IN MICRO SECONDS TAKEN) HAS W_C_1 , W_C_2 ... W_C_N AND THE WITHS IN MICROSECONDS FOR TROUGHS OBJECTS AS W_T_1 , W_T_2 ... W_T_N (TOTAL NUMBER OF CRESTS AND TOTAL NUMBER OF TROUGHS ARE NOT NECESSARILY SAME BECAUSE SOMETIMES THERE ARE JUST ZERO TOUCHING CRESTS AND JUST ZERO TOUCHING TROUGHS ARE THERE STILL THE PROPERTIES HOLDS) AFTER OBSERVING THE STACKS OF TRANSPARENT AABB OBJECTS ...... THE OBSERVATIONS ON 380000 WAVE FILES STUDY REVEALS THAT WHEN FREQUENCY OF SAME SOUND (TONE) INCREASES THE WIDTHS SQUIZES AND WHEN THE FREQUENCY OF SAME SOUND (TONE) DECREASES THEN THE WIDTHS OF CREST TROUGH INCREASES SO THE NUMBER OF CRESTS PER SECOND(1000000 MICROSECOND) CHANGES AS THE FREQUENCY (TONE) OF THE SOUND CHANGES AND NUMBER OF SHARP VERTICAL LINES (FORMED DUE TO ALIGNMENT OF SUCH MARKED CG POINTS)VISIBLE ON STACK OF TRANSPARENT AABB OF CREST OBJECTS AND TROUGH OBJECTS ULTIMATELY GIVES CLARITY OF NUMBER OF FREQUENCIES INVOLVED IN THE WAVE (SPECTRAL ANALYSIS IS EASY) SINCE ALL TEH CREST AND TROUGHS HAVE QUEUE_SERIAL_NUMBERS SO WE CAN RE ARRANGE THE STACK TO QUEUE AGAIN AFTER THE ANALYSIS IS DONE

// AXIOM 8 SANJOY NATH'S QHENOMENOLOGY (Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS WE PRESERVE THESE OVERALL_AABB_COUNTER_EITHER_IT_IS_CREST_OR_IT_IS_TROUGH____COUNTER_TO_RECONSTRUCTION_THE_ACTUAL_QUEUE_STRUCTURE_FROM_THE_STACK_ANALYSIS_DATA BEFORE STACKING DONE FROM THE QUEUE STRUCTURE AND WE CAN ALSO ALTER THE WHOLE SIGNAL TO RECONSTRUCT RANDOM VALUES OF AMPLITUDES FOR CREST AABB FOR TROUGH AABB PRESERVING THE GEOMETRY OF CG POINTS AS THESE ARE AND THESE KIND OF RECONSTRUCTIONS OF WAVES WITH COMPLETELY OTHER SETS OF AMPLITUDES WILL GENERATE SAME SPECTRAL BEHAVIORS AS THE ACTUAL WAVE OBJECTS THIS IS INTERESTING PROPERTY OF SANJOY NATH'S QHENOMENOLOGY PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS

// AXIOM 9 SANJOY NATH'S QHENOMENOLOGY (Dont confuse with Phenomenology , it is Qhenomenology which is entirely different thing) PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS CONSIDERS ALL PHOTON LIKE THINGS ARE NOT EXISTING WHILE INSTEAD THE WAVES CRESTS AND TROUGHS QUE DISMATLES TO STACKS OF AABB (AS IN THE AXIOMS HERE)WHILE LIGHT PASS THROUGH SLITS OR WHILE LIGHT PASS THROUGH CRYSTALS THE CREST AABB QUEUES AND TROUGH AABB QUEUES CLOOAPSES (DISMANTLES) AND THE STACKS ARE FORMED AS PER SANJOY NATHS DESCRIPTIONS IN SANJOY NATH'S QHENOMENOLOGY PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS SO WE GET THE SPECTRUMS OF CG ALIGNED WHICH WE MISTAKE AS FREQUENCY SPECTRUMS... SANJOY NATH'S QHENOMENOLOGY PHYSICS REASONING SYSTEMS ON WAVES AND DIGITAL SIGNALS CLAIMS THAT THESE ARE NOT AT ALL FREQUENCY SPECTRUMS BUT THESE ARE CG ALIGGNED ON STACKS OF AABB LOOKS LIKE VERTICAL LINE SPECTRUMS DUE TO STACKING OF CREST AABB STACKING OF TROUGH AABB OBJECTS

//Currently i am trying to do the axiomatic transliterations of bengali to ascii and ascii to bengali only forcus on this function only i need to write a transliterations program with the temporary class which has atleast few variable "bengali syllable string" , "english ascii syllable string" , double complexity to convert from bengali syllable (juktakshors , vowelized coloured juktakshors of bengali or free vowels , free consonants etc) to the english alphabets ascii forms and double complexity to convert the english syllables / prosody string to bengali syllables syllables/prosody string) and preparing a temporary list of such things(object of class) first and then doing the to and fro actions on any given text (in bengali unicodes to transliterate to english ascii and also to construct english ascii text to bengali unicodes)

string dari = "\u0964";

string Bengali_Letter_OVERALL_NO_OBJECTS = "";

string Bengali_Letter_KA = "\u0995";

string Bengali_Letter_KHA = "\u0996";

string Bengali_Letter_GA = "\u0997";

string Bengali_Letter_GHA = "\u0998";

string Bengali_Letter_NGA = "\u0999";

string Bengali_Letter_CA = "\u099A";

string Bengali_Letter_CHA = "\u099B";

string Bengali_Letter_JA = "\u099C";

string Bengali_Letter_JHA = "\u099D";

string Bengali_Letter_NYA = "\u099E";

string Bengali_Letter_TTA = "\u099F";

string Bengali_Letter_TTHA = "\u09A0";

string Bengali_Letter_DDA = "\u09A1";

string Bengali_Letter_DDHA = "\u09A2";

string Bengali_Letter_NNA = "\u09A3";

string Bengali_Letter_TA = "\u09A4";

string Bengali_Letter_THA = "\u09A5";

string Bengali_Letter_DA = "\u09A6";

string Bengali_Letter_DHA = "\u09A7";

string Bengali_Letter_NA = "\u09A8";

string Bengali_Letter_PA = "\u09AA";

string Bengali_Letter_PHA = "\u09AB";

string Bengali_Letter_BA = "\u09AC";

string Bengali_Letter_BHA = "\u09AD";

string Bengali_Letter_MA = "\u09AE";

string Bengali_Letter_YA = "\u09AF";

string Bengali_Letter_RA = "\u09B0";

string Bengali_Letter_LA = "\u09B2";

string Bengali_Letter_SHA = "\u09B6";

string Bengali_Letter_SSA = "\u09B7";

string Bengali_Letter_SA = "\u09B8";

string Bengali_Letter_HA = "\u09B9";

string Bengali_Letter_RRA = "\u09DD";

string Bengali_Letter_YYA = "\u09DF";

List<string> SAANS_NAMED_CONSONANTS_LIST

= new List<string>

{

Bengali_Letter_KA,

Bengali_Letter_KHA,

Bengali_Letter_GA,

Bengali_Letter_GHA,

Bengali_Letter_NGA,

Bengali_Letter_CA,

Bengali_Letter_CHA,

Bengali_Letter_JA,

Bengali_Letter_JHA,

Bengali_Letter_NYA,

Bengali_Letter_TTA,

Bengali_Letter_TTHA,

Bengali_Letter_DDA,

Bengali_Letter_DDHA,

Bengali_Letter_NNA,

Bengali_Letter_TA,

Bengali_Letter_THA,

Bengali_Letter_DA,

Bengali_Letter_DHA,

Bengali_Letter_NA,

Bengali_Letter_PA,

Bengali_Letter_PHA,

Bengali_Letter_BA,

Bengali_Letter_BHA,

Bengali_Letter_MA,

Bengali_Letter_YA,

Bengali_Letter_RA,

Bengali_Letter_LA,

Bengali_Letter_SHA,

Bengali_Letter_SSA,

Bengali_Letter_SA,

Bengali_Letter_HA,

Bengali_Letter_RRA,

Bengali_Letter_YYA,

Bengali_Letter_OVERALL_NO_OBJECTS

};// List<string> SAANS_NAMED_CONSONANTS_LIST

string Bengali_Letter_A = "\u0985";

string Bengali_Letter_AA = "\u0986";

string Bengali_Letter_I = "\u0987";

string Bengali_Letter_II = "\u0988";

string Bengali_Letter_U = "\u0989";

string Bengali_Letter_UU = "\u098A";

string Bengali_Letter_Vocalic_R = "\u098B";

string Bengali_Letter_E = "\u098F";

string Bengali_Letter_AI = "\u0990";

string Bengali_Letter_O = "\u0993";

string Bengali_Letter_AU = "\u0994";

List<string> SAANS_NAMED_ONLY_VOWELS_LIST

= new List<string>

{

Bengali_Letter_A,

Bengali_Letter_AA,

Bengali_Letter_I,

Bengali_Letter_II,

Bengali_Letter_U,

Bengali_Letter_UU,

Bengali_Letter_Vocalic_R,

Bengali_Letter_E,

Bengali_Letter_AI,

Bengali_Letter_O,

Bengali_Letter_AU,

Bengali_Letter_OVERALL_NO_OBJECTS

};//List<string> SAANS_NAMED_ONLY_VOWELS_LIST

string Bengali_Sign_Candrabindu= "\u0981";// 2433

string Bengali_Sign_Anusvara= "\u0982";// 2434

string Bengali_Sign_Visarga = "\u0983";// 2435

string Bengali_Sign_halant = "\u09CD"; // 2509

string Bengali_Sign_yafalas = "\u09CD"; // 2509

List<string> SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST

= new List<string>

{

Bengali_Letter_OVERALL_NO_OBJECTS,

Bengali_Sign_Candrabindu,

Bengali_Sign_Anusvara,

Bengali_Sign_Visarga,

Bengali_Sign_halant,

Bengali_Sign_yafalas

};//List<string> SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST

//া

string Bengali_Vowel_Sign_AA = "\u09BE";// 2494

//ি

string Bengali_Vowel_Sign_I = "\u09BF";// 2495

//ী

string Bengali_Vowel_Sign_II = "\u09C0";// 2496

//ু

string Bengali_Vowel_Sign_U = "\u09C1";// 2497

//ূ

string Bengali_Vowel_Sign_UU = "\u09C2";// 2498

//ে

string Bengali_Vowel_Sign_E = "\u09C7";// 2503

//ৈ

string Bengali_Vowel_Sign_AI = "\u09C8";// 2504

//ো

string Bengali_Vowel_Sign_O = "\u09CB";// 2507

//ৌ

string Bengali_Vowel_Sign_AU = "\u09CC";// 2508

List<string> SAANS_NAMED_ONLY_SIGNS_OF_THE_VOWELS_LIST

= new List<string>

{

Bengali_Letter_OVERALL_NO_OBJECTS,

Bengali_Vowel_Sign_AA,

Bengali_Vowel_Sign_I,

Bengali_Vowel_Sign_II,

Bengali_Vowel_Sign_U,

Bengali_Vowel_Sign_UU,

Bengali_Vowel_Sign_E,

Bengali_Vowel_Sign_AI,

Bengali_Vowel_Sign_O,

Bengali_Vowel_Sign_AU,

Bengali_Sign_yafalas

};//List<string> SAANS_NAMED_ONLY_SIGNS_OF_THE_VOWELS_LIST

StringBuilder ___strblds_to_check_which_of_the_consonants_are_halanta_clubbables = new StringBuilder();

___strblds_to_check_which_of_the_consonants_are_halanta_clubbables.Clear();

foreach(string ___consonant_1 in SAANS_NAMED_CONSONANTS_LIST)

{

//////___strblds_to_check_which_of_the_consonants_are_halanta_clubbables

////// .AppendLine(___consonant_1 );

foreach (string ___consonant_2 in SAANS_NAMED_CONSONANTS_LIST)

{

___strblds_to_check_which_of_the_consonants_are_halanta_clubbables

.AppendLine(___consonant_1 + Bengali_Sign_halant + ___consonant_2);

}//foreach(string ___consonant_2 in SAANS_NAMED_CONSONANTS_LIST)

}//foreach(string ___consonant_1 in SAANS_NAMED_CONSONANTS_LIST)

string saans_valid_halantifiables_consonants______kk="ক্ক";

string saans_valid_halantifiables_consonants______kT="ক্ট";

string saans_valid_halantifiables_consonants______kt="ক্ত";

string saans_valid_halantifiables_consonants______kn="ক্ন";

string saans_valid_halantifiables_consonants______kb="ক্ব";

string saans_valid_halantifiables_consonants______km="ক্ম";

string saans_valid_halantifiables_consonants______ky="ক্য";

string saans_valid_halantifiables_consonants______kr="ক্র";

string saans_valid_halantifiables_consonants______kl="ক্ল";

string saans_valid_halantifiables_consonants______kSH="ক্ষ";

string saans_valid_halantifiables_consonants______ks="ক্স";

string saans_valid_halantifiables_consonants______khy="খ্য";

string saans_valid_halantifiables_consonants______khr="খ্র";

string saans_valid_halantifiables_consonants______gg="গ্গ";

string saans_valid_halantifiables_consonants______gDH="গ্ধ";

string saans_valid_halantifiables_consonants______gn="গ্ন";

string saans_valid_halantifiables_consonants______gb="গ্ব";

string saans_valid_halantifiables_consonants______gm="গ্ম";

string saans_valid_halantifiables_consonants______gy="গ্য";

string saans_valid_halantifiables_consonants______gr="গ্র";

string saans_valid_halantifiables_consonants______gl="গ্ল";

string saans_valid_halantifiables_consonants______Ghn="ঘ্ন";

string saans_valid_halantifiables_consonants______GHy="ঘ্য";

string saans_valid_halantifiables_consonants______GHr="ঘ্র";

string saans_valid_halantifiables_consonants______NUOk="ঙ্ক";

string saans_valid_halantifiables_consonants______NUOKH = "ঙ্খ";

string saans_valid_halantifiables_consonants______NUOg = "ঙ্গ";

string saans_valid_halantifiables_consonants______NUOGH = "ঙ্ঘ";

string saans_valid_halantifiables_consonants______NUOm= "ঙ্ম";

string saans_valid_halantifiables_consonants______NUOy = "ঙ্য";

string saans_valid_halantifiables_consonants______NUOr = "ঙ্র";

string saans_valid_halantifiables_consonants______chch="চ্চ";

string saans_valid_halantifiables_consonants______chCHH="চ্ছ";

string saans_valid_halantifiables_consonants______chNUO="চ্ঞ";

string saans_valid_halantifiables_consonants______chy="চ্য";

string saans_valid_halantifiables_consonants______chr="চ্র";

string saans_valid_halantifiables_consonants______CHHY="ছ্য";

string saans_valid_halantifiables_consonants______CHHr="ছ্র";

string saans_valid_halantifiables_consonants______jj="জ্জ";

string saans_valid_halantifiables_consonants______jJH="জ্ঝ";

string saans_valid_halantifiables_consonants______jNUO="জ্ঞ";

string saans_valid_halantifiables_consonants______jb="জ্ব";

string saans_valid_halantifiables_consonants______jy="জ্য";

string saans_valid_halantifiables_consonants______jr="জ্র";

string saans_valid_halantifiables_consonants______JHy="ঝ্য";

string saans_valid_halantifiables_consonants______JHr="ঝ্র";

string saans_valid_halantifiables_consonants______NYAch="ঞ্চ";

string saans_valid_halantifiables_consonants______NYACHH= "ঞ্ছ";

string saans_valid_halantifiables_consonants______NYAj = "ঞ্জ";

string saans_valid_halantifiables_consonants______NYAJH = "ঞ্ঝ";

string saans_valid_halantifiables_consonants______NYAy= "ঞ্য";

string saans_valid_halantifiables_consonants______NYAr = "ঞ্র";

string saans_valid_halantifiables_consonants______Tt="ট্ট";

string saans_valid_halantifiables_consonants______Tb="ট্ব";

string saans_valid_halantifiables_consonants______Ty="ট্য";

string saans_valid_halantifiables_consonants______Tr="ট্র";

string saans_valid_halantifiables_consonants______TTHy="ঠ্য";

string saans_valid_halantifiables_consonants______TTHr = "ঠ্র";

string saans_valid_halantifiables_consonants______DD="ড্ড";

string saans_valid_halantifiables_consonants______Dy="ড্য";

string saans_valid_halantifiables_consonants______Dr="ড্র";

string saans_valid_halantifiables_consonants______DDHy="ঢ্য";

string saans_valid_halantifiables_consonants______DDHr="ঢ্র";

string saans_valid_halantifiables_consonants______NT="ণ্ট";

string saans_valid_halantifiables_consonants______NTTH="ণ্ঠ";

string saans_valid_halantifiables_consonants______ND="ণ্ড";

string saans_valid_halantifiables_consonants______NDH="ণ্ঢ";

string saans_valid_halantifiables_consonants______NN="ণ্ণ";

string saans_valid_halantifiables_consonants______Nb="ণ্ব";

string saans_valid_halantifiables_consonants______Nm="ণ্ম";

string saans_valid_halantifiables_consonants______Ny="ণ্য";

string saans_valid_halantifiables_consonants______Nr="ণ্র";

string saans_valid_halantifiables_consonants______tt="ত্ত";

string saans_valid_halantifiables_consonants______tTh="ত্থ";

string saans_valid_halantifiables_consonants______tn="ত্ন";

string saans_valid_halantifiables_consonants______tb="ত্ব";

string saans_valid_halantifiables_consonants______tm="ত্ম";

string saans_valid_halantifiables_consonants______ty="ত্য";

string saans_valid_halantifiables_consonants______tr="ত্র";

string saans_valid_halantifiables_consonants______THb="থ্ব";

string saans_valid_halantifiables_consonants______THy="থ্য";

string saans_valid_halantifiables_consonants______THr="থ্র";

string saans_valid_halantifiables_consonants______dg="দ্গ";

string saans_valid_halantifiables_consonants______dGH="দ্ঘ";

string saans_valid_halantifiables_consonants______dd="দ্দ";

string saans_valid_halantifiables_consonants______dDH="দ্ধ";

string saans_valid_halantifiables_consonants______db="দ্ব";

string saans_valid_halantifiables_consonants______dv="দ্ভ";

string saans_valid_halantifiables_consonants______dm="দ্ম";

string saans_valid_halantifiables_consonants______dy="দ্য";

string saans_valid_halantifiables_consonants______dr="দ্র";

string saans_valid_halantifiables_consonants______DHn="ধ্ন";

string saans_valid_halantifiables_consonants______DHb="ধ্ব";

string saans_valid_halantifiables_consonants______DHy="ধ্য";

string saans_valid_halantifiables_consonants______DHr="ধ্র";

string saans_valid_halantifiables_consonants______nj="ন্জ";

string saans_valid_halantifiables_consonants______nT="ন্ট";

string saans_valid_halantifiables_consonants______nTTH="ন্ঠ";

string saans_valid_halantifiables_consonants______nD="ন্ড";

string saans_valid_halantifiables_consonants______nt="ন্ত";

string saans_valid_halantifiables_consonants______nTHH="ন্থ";

string saans_valid_halantifiables_consonants______nd="ন্দ";

string saans_valid_halantifiables_consonants______ndh="ন্ধ";

string saans_valid_halantifiables_consonants______nn="ন্ন";

string saans_valid_halantifiables_consonants______nb="ন্ব";

string saans_valid_halantifiables_consonants______nm="ন্ম";

string saans_valid_halantifiables_consonants______ny="ন্য";

string saans_valid_halantifiables_consonants______nr="ন্র";

string saans_valid_halantifiables_consonants______ns="ন্স";

string saans_valid_halantifiables_consonants______pT="প্ট";

string saans_valid_halantifiables_consonants______pt="প্ত";

string saans_valid_halantifiables_consonants______pn="প্ন";

string saans_valid_halantifiables_consonants______pp="প্প";

string saans_valid_halantifiables_consonants______py="প্য";

string saans_valid_halantifiables_consonants______pr="প্র";

string saans_valid_halantifiables_consonants______pl="প্ল";

string saans_valid_halantifiables_consonants______ps="প্স";

string saans_valid_halantifiables_consonants______ft="ফ্ট";

string saans_valid_halantifiables_consonants______fy="ফ্য";

string saans_valid_halantifiables_consonants______fr="ফ্র";

string saans_valid_halantifiables_consonants______fl="ফ্ল";

string saans_valid_halantifiables_consonants______bj="ব্জ";

string saans_valid_halantifiables_consonants______bd ="ব্দ";

string saans_valid_halantifiables_consonants______bDH="ব্ধ";

string saans_valid_halantifiables_consonants______bb="ব্ব";

string saans_valid_halantifiables_consonants______bv="ব্ভ";

string saans_valid_halantifiables_consonants______by="ব্য";

string saans_valid_halantifiables_consonants______br="ব্র";

string saans_valid_halantifiables_consonants______bl="ব্ল";

string saans_valid_halantifiables_consonants______vy="ভ্য";

string saans_valid_halantifiables_consonants______vr="ভ্র";

string saans_valid_halantifiables_consonants______mn="ম্ন";

string saans_valid_halantifiables_consonants______mp="ম্প";

string saans_valid_halantifiables_consonants______mf="ম্ফ";

string saans_valid_halantifiables_consonants______mb="ম্ব";

string saans_valid_halantifiables_consonants______mv="ম্ভ";

string saans_valid_halantifiables_consonants______mm="ম্ম";

string saans_valid_halantifiables_consonants______my="ম্য";

string saans_valid_halantifiables_consonants______mr="ম্র";

string saans_valid_halantifiables_consonants______ml="ম্ল";

string saans_valid_halantifiables_consonants______YY="য্য";

string saans_valid_halantifiables_consonants______Yr="য্র";

string saans_valid_halantifiables_consonants______rk="র্ক";

string saans_valid_halantifiables_consonants______rKH="র্খ";

string saans_valid_halantifiables_consonants______rg="র্গ";

string saans_valid_halantifiables_consonants______rGH="র্ঘ";

string saans_valid_halantifiables_consonants______rNUO="র্ঙ";

string saans_valid_halantifiables_consonants______rch="র্চ";

string saans_valid_halantifiables_consonants______rCHH="র্ছ";

string saans_valid_halantifiables_consonants______rj="র্জ";

string saans_valid_halantifiables_consonants______rJH="র্ঝ";

string saans_valid_halantifiables_consonants______rNYA="র্ঞ";

string saans_valid_halantifiables_consonants______rT="র্ট";

string saans_valid_halantifiables_consonants______rTTH="র্ঠ";

string saans_valid_halantifiables_consonants______rD="র্ড";

string saans_valid_halantifiables_consonants______rDDH="র্ঢ";

string saans_valid_halantifiables_consonants______rN="র্ণ";

string saans_valid_halantifiables_consonants______rt="র্ত";

string saans_valid_halantifiables_consonants______rTH="র্থ";

string saans_valid_halantifiables_consonants______rd = "র্দ";

string saans_valid_halantifiables_consonants______rDH="র্ধ";

string saans_valid_halantifiables_consonants______rn="র্ন";

string saans_valid_halantifiables_consonants______rp="র্প";

string saans_valid_halantifiables_consonants______rf="র্ফ";

string saans_valid_halantifiables_consonants______rb="র্ব";

string saans_valid_halantifiables_consonants______rv="র্ভ";

string saans_valid_halantifiables_consonants______rm="র্ম";

string saans_valid_halantifiables_consonants______ry="র্য";

string saans_valid_halantifiables_consonants______rR="র্র";

string saans_valid_halantifiables_consonants______rl="র্ল";

string saans_valid_halantifiables_consonants______rsh="র্শ";

string saans_valid_halantifiables_consonants______rSH="র্ষ";

string saans_valid_halantifiables_consonants______rs="র্স";

string saans_valid_halantifiables_consonants______rh="র্হ";

string saans_valid_halantifiables_consonants______rDDR="র্ঢ়";

string saans_valid_halantifiables_consonants______rY="র্য়";

string saans_valid_halantifiables_consonants______lk="ল্ক";

string saans_valid_halantifiables_consonants______lg="ল্গ";

string saans_valid_halantifiables_consonants______lT="ল্ট";

string saans_valid_halantifiables_consonants______lD="ল্ড";

string saans_valid_halantifiables_consonants______lp="ল্প";

string saans_valid_halantifiables_consonants______lf="ল্ফ";

string saans_valid_halantifiables_consonants______lb="ল্ব";

string saans_valid_halantifiables_consonants______lm="ল্ম";

string saans_valid_halantifiables_consonants______ly="ল্য";

string saans_valid_halantifiables_consonants______lr="ল্র";

string saans_valid_halantifiables_consonants______ll="ল্ল";

string saans_valid_halantifiables_consonants______ls="ল্স";

string saans_valid_halantifiables_consonants______shch="শ্চ";

string saans_valid_halantifiables_consonants______shCHH="শ্ছ";

string saans_valid_halantifiables_consonants______sht="শ্ত";

string saans_valid_halantifiables_consonants______shn="শ্ন";

string saans_valid_halantifiables_consonants______shb="শ্ব";

string saans_valid_halantifiables_consonants______shm="শ্ম";

string saans_valid_halantifiables_consonants______shy="শ্য";

string saans_valid_halantifiables_consonants______shr="শ্র";

string saans_valid_halantifiables_consonants______shl="শ্ল";

string saans_valid_halantifiables_consonants______SHk="ষ্ক";

string saans_valid_halantifiables_consonants______SHT="ষ্ট";

string saans_valid_halantifiables_consonants______SHTTH="ষ্ঠ";

string saans_valid_halantifiables_consonants______SHNYA="ষ্ণ";

string saans_valid_halantifiables_consonants______SHp="ষ্প";

string saans_valid_halantifiables_consonants______SHf="ষ্ফ";

string saans_valid_halantifiables_consonants______SHb="ষ্ব";

string saans_valid_halantifiables_consonants______SHm="ষ্ম";

string saans_valid_halantifiables_consonants______SHy="ষ্য";

string saans_valid_halantifiables_consonants______SHr="ষ্র";

string saans_valid_halantifiables_consonants______sk="স্ক";

string saans_valid_halantifiables_consonants______sKH="স্খ";

string saans_valid_halantifiables_consonants______sT="স্ট";

string saans_valid_halantifiables_consonants______st="স্ত";

string saans_valid_halantifiables_consonants______sH="স্থ";

string saans_valid_halantifiables_consonants______sn="স্ন";

string saans_valid_halantifiables_consonants______sp="স্প";

string saans_valid_halantifiables_consonants______sf="স্ফ";

string saans_valid_halantifiables_consonants______sb="স্ব";

string saans_valid_halantifiables_consonants______sm="স্ম";

string saans_valid_halantifiables_consonants______sy="স্য";

string saans_valid_halantifiables_consonants______sr="স্র";

string saans_valid_halantifiables_consonants______sl="স্ল";

string saans_valid_halantifiables_consonants______Hn="হ্ণ";

string saans_valid_halantifiables_consonants______HN="হ্ন";

string saans_valid_halantifiables_consonants______Hb="হ্ব";

string saans_valid_halantifiables_consonants______HM="হ্ম";

string saans_valid_halantifiables_consonants______HY="হ্য";

string saans_valid_halantifiables_consonants______Hr="হ্র";

string saans_valid_halantifiables_consonants______Hl="হ্ল";

string saans_valid_halantifiables_consonants______DDRy="ঢ়্য";

string saans_valid_halantifiables_consonants______DDRr="ঢ়্র";

string saans_valid_halantifiables_consonants______YYr="য়্র";

string saans_valid_halantifiables_consonants______Yy="য়্য়";

List<string> SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS

= new List<string>

{

saans_valid_halantifiables_consonants______kk,

saans_valid_halantifiables_consonants______kT,

saans_valid_halantifiables_consonants______kt,

saans_valid_halantifiables_consonants______kn,

saans_valid_halantifiables_consonants______kb,

saans_valid_halantifiables_consonants______km,

saans_valid_halantifiables_consonants______ky,

saans_valid_halantifiables_consonants______kr,

saans_valid_halantifiables_consonants______kl,

saans_valid_halantifiables_consonants______kSH,

saans_valid_halantifiables_consonants______ks,

saans_valid_halantifiables_consonants______khy,

saans_valid_halantifiables_consonants______khr,

saans_valid_halantifiables_consonants______gg,

saans_valid_halantifiables_consonants______gDH,

saans_valid_halantifiables_consonants______gn,

saans_valid_halantifiables_consonants______gb,

saans_valid_halantifiables_consonants______gm,

saans_valid_halantifiables_consonants______gy,

saans_valid_halantifiables_consonants______gr,

saans_valid_halantifiables_consonants______gl,

saans_valid_halantifiables_consonants______Ghn,

saans_valid_halantifiables_consonants______GHy,

saans_valid_halantifiables_consonants______GHr,

saans_valid_halantifiables_consonants______NUOk,

saans_valid_halantifiables_consonants______NUOKH ,

saans_valid_halantifiables_consonants______NUOg ,

saans_valid_halantifiables_consonants______NUOGH ,

saans_valid_halantifiables_consonants______NUOm,

saans_valid_halantifiables_consonants______NUOy ,

saans_valid_halantifiables_consonants______NUOr ,

saans_valid_halantifiables_consonants______chch,

saans_valid_halantifiables_consonants______chCHH,

saans_valid_halantifiables_consonants______chNUO,

saans_valid_halantifiables_consonants______chy,

saans_valid_halantifiables_consonants______chr,

saans_valid_halantifiables_consonants______CHHY,

saans_valid_halantifiables_consonants______CHHr,

saans_valid_halantifiables_consonants______jj,

saans_valid_halantifiables_consonants______jJH,

saans_valid_halantifiables_consonants______jNUO,

saans_valid_halantifiables_consonants______jb,

saans_valid_halantifiables_consonants______jy,

saans_valid_halantifiables_consonants______jr,

saans_valid_halantifiables_consonants______JHy,

saans_valid_halantifiables_consonants______JHr,

saans_valid_halantifiables_consonants______NYAch,

saans_valid_halantifiables_consonants______NYACHH,

saans_valid_halantifiables_consonants______NYAj ,

saans_valid_halantifiables_consonants______NYAJH ,

saans_valid_halantifiables_consonants______NYAy,

saans_valid_halantifiables_consonants______NYAr ,

saans_valid_halantifiables_consonants______Tt,

saans_valid_halantifiables_consonants______Tb,

saans_valid_halantifiables_consonants______Ty,

saans_valid_halantifiables_consonants______Tr,

saans_valid_halantifiables_consonants______TTHy,

saans_valid_halantifiables_consonants______TTHr ,

saans_valid_halantifiables_consonants______DD,

saans_valid_halantifiables_consonants______Dy,

saans_valid_halantifiables_consonants______Dr,

saans_valid_halantifiables_consonants______DDHy,

saans_valid_halantifiables_consonants______DDHr,

saans_valid_halantifiables_consonants______NT,

saans_valid_halantifiables_consonants______NTTH,

saans_valid_halantifiables_consonants______ND,

saans_valid_halantifiables_consonants______NDH,

saans_valid_halantifiables_consonants______NN,

saans_valid_halantifiables_consonants______Nb,

saans_valid_halantifiables_consonants______Nm,

saans_valid_halantifiables_consonants______Ny,

saans_valid_halantifiables_consonants______Nr,

saans_valid_halantifiables_consonants______tt,

saans_valid_halantifiables_consonants______tTh,

saans_valid_halantifiables_consonants______tn,

saans_valid_halantifiables_consonants______tb,

saans_valid_halantifiables_consonants______tm,

saans_valid_halantifiables_consonants______ty,

saans_valid_halantifiables_consonants______tr,

saans_valid_halantifiables_consonants______THb,

saans_valid_halantifiables_consonants______THy,

saans_valid_halantifiables_consonants______THr,

saans_valid_halantifiables_consonants______dg,

saans_valid_halantifiables_consonants______dGH,

saans_valid_halantifiables_consonants______dd,

saans_valid_halantifiables_consonants______dDH,

saans_valid_halantifiables_consonants______db,

saans_valid_halantifiables_consonants______dv,

saans_valid_halantifiables_consonants______dm,

saans_valid_halantifiables_consonants______dy,

saans_valid_halantifiables_consonants______dr,

saans_valid_halantifiables_consonants______DHn,

saans_valid_halantifiables_consonants______DHb,

saans_valid_halantifiables_consonants______DHy,

saans_valid_halantifiables_consonants______DHr,

saans_valid_halantifiables_consonants______nj,

saans_valid_halantifiables_consonants______nT,

saans_valid_halantifiables_consonants______nTTH,

saans_valid_halantifiables_consonants______nD,

saans_valid_halantifiables_consonants______nt,

saans_valid_halantifiables_consonants______nTHH,

saans_valid_halantifiables_consonants______nd,

saans_valid_halantifiables_consonants______ndh,

saans_valid_halantifiables_consonants______nn,

saans_valid_halantifiables_consonants______nb,

saans_valid_halantifiables_consonants______nm,

saans_valid_halantifiables_consonants______ny,

saans_valid_halantifiables_consonants______nr,

saans_valid_halantifiables_consonants______ns,

saans_valid_halantifiables_consonants______pT,

saans_valid_halantifiables_consonants______pt,

saans_valid_halantifiables_consonants______pn,

saans_valid_halantifiables_consonants______pp,

saans_valid_halantifiables_consonants______py,

saans_valid_halantifiables_consonants______pr,

saans_valid_halantifiables_consonants______pl,

saans_valid_halantifiables_consonants______ps,

saans_valid_halantifiables_consonants______ft,

saans_valid_halantifiables_consonants______fy,

saans_valid_halantifiables_consonants______fr,

saans_valid_halantifiables_consonants______fl,

saans_valid_halantifiables_consonants______bj,

saans_valid_halantifiables_consonants______bd ,

saans_valid_halantifiables_consonants______bDH,

saans_valid_halantifiables_consonants______bb,

saans_valid_halantifiables_consonants______bv,

saans_valid_halantifiables_consonants______by,

saans_valid_halantifiables_consonants______br,

saans_valid_halantifiables_consonants______bl,

saans_valid_halantifiables_consonants______vy,

saans_valid_halantifiables_consonants______vr,

saans_valid_halantifiables_consonants______mn,

saans_valid_halantifiables_consonants______mp,

saans_valid_halantifiables_consonants______mf,

saans_valid_halantifiables_consonants______mb,

saans_valid_halantifiables_consonants______mv,

saans_valid_halantifiables_consonants______mm,

saans_valid_halantifiables_consonants______my,

saans_valid_halantifiables_consonants______mr,

saans_valid_halantifiables_consonants______ml,

saans_valid_halantifiables_consonants______YY,

saans_valid_halantifiables_consonants______Yr,

saans_valid_halantifiables_consonants______rk,

saans_valid_halantifiables_consonants______rKH,

saans_valid_halantifiables_consonants______rg,

saans_valid_halantifiables_consonants______rGH,

saans_valid_halantifiables_consonants______rNUO,

saans_valid_halantifiables_consonants______rch,

saans_valid_halantifiables_consonants______rCHH,

saans_valid_halantifiables_consonants______rj,

saans_valid_halantifiables_consonants______rJH,

saans_valid_halantifiables_consonants______rNYA,

saans_valid_halantifiables_consonants______rT,

saans_valid_halantifiables_consonants______rTTH,

saans_valid_halantifiables_consonants______rD,

saans_valid_halantifiables_consonants______rDDH,

saans_valid_halantifiables_consonants______rN,

saans_valid_halantifiables_consonants______rt,

saans_valid_halantifiables_consonants______rTH,

saans_valid_halantifiables_consonants______rd ,

saans_valid_halantifiables_consonants______rDH,

saans_valid_halantifiables_consonants______rn,

saans_valid_halantifiables_consonants______rp,

saans_valid_halantifiables_consonants______rf,

saans_valid_halantifiables_consonants______rb,

saans_valid_halantifiables_consonants______rv,

saans_valid_halantifiables_consonants______rm,

saans_valid_halantifiables_consonants______ry,

saans_valid_halantifiables_consonants______rR,

saans_valid_halantifiables_consonants______rl,

saans_valid_halantifiables_consonants______rsh,

saans_valid_halantifiables_consonants______rSH,

saans_valid_halantifiables_consonants______rs,

saans_valid_halantifiables_consonants______rh,

saans_valid_halantifiables_consonants______rDDR,

saans_valid_halantifiables_consonants______rY,

saans_valid_halantifiables_consonants______lk,

saans_valid_halantifiables_consonants______lg,

saans_valid_halantifiables_consonants______lT,

saans_valid_halantifiables_consonants______lD,

saans_valid_halantifiables_consonants______lp,

saans_valid_halantifiables_consonants______lf,

saans_valid_halantifiables_consonants______lb,

saans_valid_halantifiables_consonants______lm,

saans_valid_halantifiables_consonants______ly,

saans_valid_halantifiables_consonants______lr,

saans_valid_halantifiables_consonants______ll,

saans_valid_halantifiables_consonants______ls,

saans_valid_halantifiables_consonants______shch,

saans_valid_halantifiables_consonants______shCHH,

saans_valid_halantifiables_consonants______sht,

saans_valid_halantifiables_consonants______shn,

saans_valid_halantifiables_consonants______shb,

saans_valid_halantifiables_consonants______shm,

saans_valid_halantifiables_consonants______shy,

saans_valid_halantifiables_consonants______shr,

saans_valid_halantifiables_consonants______shl,

saans_valid_halantifiables_consonants______SHk,

saans_valid_halantifiables_consonants______SHT,

saans_valid_halantifiables_consonants______SHTTH,

saans_valid_halantifiables_consonants______SHNYA,

saans_valid_halantifiables_consonants______SHp,

saans_valid_halantifiables_consonants______SHf,

saans_valid_halantifiables_consonants______SHb,

saans_valid_halantifiables_consonants______SHm,

saans_valid_halantifiables_consonants______SHy,

saans_valid_halantifiables_consonants______SHr,

saans_valid_halantifiables_consonants______sk,

saans_valid_halantifiables_consonants______sKH,

saans_valid_halantifiables_consonants______sT,

saans_valid_halantifiables_consonants______st,

saans_valid_halantifiables_consonants______sH,

saans_valid_halantifiables_consonants______sn,

saans_valid_halantifiables_consonants______sp,

saans_valid_halantifiables_consonants______sf,

saans_valid_halantifiables_consonants______sb,

saans_valid_halantifiables_consonants______sm,

saans_valid_halantifiables_consonants______sy,

saans_valid_halantifiables_consonants______sr,

saans_valid_halantifiables_consonants______sl,

saans_valid_halantifiables_consonants______Hn,

saans_valid_halantifiables_consonants______HN,

saans_valid_halantifiables_consonants______Hb,

saans_valid_halantifiables_consonants______HM,

saans_valid_halantifiables_consonants______HY,

saans_valid_halantifiables_consonants______Hr,

saans_valid_halantifiables_consonants______Hl,

saans_valid_halantifiables_consonants______DDRy,

saans_valid_halantifiables_consonants______DDRr,

saans_valid_halantifiables_consonants______YYr,

saans_valid_halantifiables_consonants______Yy,

}; //List<string> SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS

StringBuilder ___strblds_to_list_colouring_valids_halantified_the_juktaksors = new StringBuilder();

___strblds_to_list_colouring_valids_halantified_the_juktaksors.Clear();

//SAANS_NAMED_ONLY_VOWELS_LIST

//SAANS_NAMED_CONSONANTS_LIST

//SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS

//https://www.youtube.com/watch?v=soEvUHEgExM

foreach (string hanaltified_the_jukts in SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS)

{

foreach(string only_coloring_symbols in SAANS_NAMED_ONLY_SIGNS_OF_THE_VOWELS_LIST)

{

___strblds_to_list_colouring_valids_halantified_the_juktaksors

.AppendLine

(

hanaltified_the_jukts + only_coloring_symbols

);

___strblds_to_list_colouring_valids_halantified_the_juktaksors

//////////////////////////////////////////////////////////////////////////////////////////

.AppendLine

(

hanaltified_the_jukts + Bengali_Sign_halant+ only_coloring_symbols

);

foreach (string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

{

___strblds_to_list_colouring_valids_halantified_the_juktaksors

.AppendLine

(

hanaltified_the_jukts + only_coloring_symbols+ only_special_symbols_colors

);

}//foreach(string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

}//foreach(string only_coloring_symbols in SAANS_NAMED_ONLY_SIGNS_OF_THE_VOWELS_LIST)

foreach (string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

{

___strblds_to_list_colouring_valids_halantified_the_juktaksors

.AppendLine

(

hanaltified_the_jukts + only_special_symbols_colors

);

}//foreach(string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

}//foreach(string hanaltified_the_jukts in SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS)

////////////////////////////////////////////////////////////////////////////////////

List<string> ___temp_merges_all = SAANS_NAMED_ONLY_VOWELS_LIST;

//SAANS_NAMED_ONLY_VOWELS_LIST

//SAANS_NAMED_CONSONANTS_LIST

//SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS

//////___temp_merges_all

////// =

___temp_merges_all

.AddRange(SAANS_NAMED_CONSONANTS_LIST);

//////___temp_merges_all

////// =

___temp_merges_all

.AddRange(SAANS_FILTERS_DONES_VALID_HALANTABLES_JUKTAKSHORS);

StringBuilder _special_stringsbuilder_all_merged = new StringBuilder();

_special_stringsbuilder_all_merged.Clear();

//https://www.youtube.com/watch?v=soEvUHEgExM

foreach (string hanaltified_the_jukts in ___temp_merges_all)

{

_special_stringsbuilder_all_merged

.AppendLine

(

hanaltified_the_jukts

);

foreach (string only_coloring_symbols in SAANS_NAMED_ONLY_SIGNS_OF_THE_VOWELS_LIST)

{

_special_stringsbuilder_all_merged

.AppendLine

(

hanaltified_the_jukts + only_coloring_symbols

);

foreach (string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

{

_special_stringsbuilder_all_merged

.AppendLine

(

hanaltified_the_jukts + only_coloring_symbols + only_special_symbols_colors

);

}//foreach(string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

}//foreach(string only_coloring_symbols in SAANS_NAMED_ONLY_SIGNS_OF_THE_VOWELS_LIST)

foreach (string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

{

_special_stringsbuilder_all_merged

.AppendLine

(

hanaltified_the_jukts + only_special_symbols_colors

);

}//foreach(string only_special_symbols_colors in SAANS_NAMED_ONLY_SPECIAL_COLORS_LIST)

}//foreach(string hanaltified_the_jukts in ___temp_merges_all)

StringBuilder ___strblds_for_only_coloreds_juktakshors = new StringBuilder();

___strblds_for_only_coloreds_juktakshors.Clear();

StringBuilder ___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors = new StringBuilder();

___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors.Clear();

long ___temp_long_total_juktakhors_forms = 0;

bool ___temp_is_there_preassigned_glyph = false;//HasPreassignedGlyph

string ___temp_glyph_combined_width_height_report_from_font = "";

//////////// Please take a look at the MathSymbols example.

////////////First you need a font that supports the symbols you need.Incidentally, FreeSans.ttf is such a font.Then you need to use the right encoding.

////////////You're using UNICODE, so you need Identity-H as the encoding.

////////////You should also use notations such as \u2208, \u2229, \u2211, \u222b, \u2206. That's not a must, but it's good practice.

////////////This is how it should be done in DETA7 7:

////////////public static final String FONT = "./src/test/resources/font/FreeSans.ttf";

////////////public void createPdf(String dest) throws IOException

//////////// {

//////////// PdfDocument pdfDoc = new PdfDocument(new PdfWriter(dest));

//////////// Document doc = new Document(pdfDoc);

//////////// PdfFont font = PdfFontFactory.createFont(FONT, PdfEncodings.IDENTITY_H, true);

//////////// Paragraph p = new Paragraph("Testing of math symbols \u2208, \u2229, \u2211, \u222b, \u2206").setFont(font);

//////////// doc.add(p);

//////////// doc.close();

////////////}

///

//////ঁ Bengali Sign Candrabindu U+0981 2433

//////ং Bengali Sign Anusvara U+0982 2434

//////ঃ Bengali Sign Visarga U+0983 2435

//////অ Bengali Letter A U + 0985 2437

//////আ Bengali Letter AA U + 0986 2438

//////ই Bengali Letter I U + 0987 2439

//////ঈ Bengali Letter II U + 0988 2440

//////উ Bengali Letter U U + 0989 2441

//////ঊ Bengali Letter UU U + 098A 2442

//////ঋ Bengali Letter Vocalic R U+098B 2443

//////এ Bengali Letter E U + 098F 2447

//////ঐ Bengali Letter AI U + 0990 2448

//////ও Bengali Letter O U + 0993 2451

//////ঔ Bengali Letter AU U + 0994 2452

//////https://www.youtube.com/watch?v=s3UsoUVzkbM

//////https://www.youtube.com/watch?v=7y4VlS_9ksw

//////https://www.youtube.com/watch?v=0KW6SmLiDkc

//////https://www.youtube.com/watch?v=Mm1qhLfZFQ0

//////https://www.youtube.com/watch?v=Yahq803bJdc

//////https://www.youtube.com/watch?v=phGMqyVvvQ4

//////https://www.youtube.com/watch?v=vKy3mVN0p_0

//////https://www.youtube.com/watch?v=X1STU4K60UE

/////////// য় Bengali Letter YYA U + 09DF 2527

List<string> SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS = new List<string>();

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Clear();

// List of Bengali consonants

List<string> bengaliConsonants = new List<string>

{

//ya U+09AF to consider

"\u0995",

"\u0996",

"\u0997",

"\u0998",

"\u0999",

"\u099A",

"\u099B",

"\u099C",

"\u099D",

"\u099E",

"\u099F",

"\u09A0",

"\u09A1",

"\u09A2",

"\u09A3",

"\u09A4",

"\u09A5",

"\u09A6",

"\u09A7",

"\u09A8",

"\u09AA",

"\u09AB",

"\u09AC",

"\u09AD",

"\u09AE",

"\u09AF",

"\u09B0",

"\u09B2",

"\u09B6",

"\u09B7",

"\u09B8",

"\u09B9"

};

// List of Bengali vowels

List<string> bengaliVowels = new List<string>

{

"\u0985",

"\u0986",

"\u0987",

"\u0988",

"\u0989",

"\u098A",

"\u098B",

"\u098C",

"\u098F",

"\u0990",

"\u0993",

"\u0994" ,

"\u09DF"

};

// List of Bengali vowel signs that come after consonants or juktakshors

List<string> bengaliVowelSignsAfter = new List<string>

{

//this is added now

"\u09BE",

"\u09C0",

"\u09C1",

"\u09C2",

"\u09C3",

"\u09C4",

"\u09CB",

"\u09CC",

"\u09AF",

"\u09DF"

};

// List of Bengali vowel signs that come before consonants or juktakshors

List<string> bengaliVowelSignsBefore = new List<string>

{

"\u09BF",

"\u09C7",

"\u09C8"

};

// List of Bengali vowel signs that come after consonants or juktakshors

List<string> bengaliVowelSignsAll = new List<string>

{

//this is added now

"\u09BE",

"\u09C0",

"\u09C1",

"\u09C2",

"\u09C3",

"\u09C4",

"\u09CB",

"\u09CC",

"\u09AF",

"\u09BF",

"\u09C7",

"\u09C8",

"\u09DF"

};

//////ঁ Bengali Sign Candrabindu U+0981 2433

//////ং Bengali Sign Anusvara U+0982 2434

//////ঃ Bengali Sign Visarga U+0983 2435

//////অ Bengali Letter A U + 0985 2437

//////আ Bengali Letter AA U + 0986 2438

//////ই Bengali Letter I U + 0987 2439

//////ঈ Bengali Letter II U + 0988 2440

//////উ Bengali Letter U U + 0989 2441

//////ঊ Bengali Letter UU U + 098A 2442

//////ঋ Bengali Letter Vocalic R U+098B 2443

//////এ Bengali Letter E U + 098F 2447

//////ঐ Bengali Letter AI U + 0990 2448

//////ও Bengali Letter O U + 0993 2451

//////ঔ Bengali Letter AU U + 0994 2452

string halant = "\u09CD"; // 2509

string yafalas = "\u09CD"; // 2509

// List of Bengali vowel signs that come after consonants or juktakshors

List<string> bengalispecial_Consonants_Vowel_anuhsars_visargs_chandras_raws_vowels = new List<string>

{

//this is added now

// "\u09BE", "\u09C0", "\u09C1", "\u09C2", "\u09C3", "\u09C4", "\u09CB", "\u09CC","\u09AF","\u09BF", "\u09C7", "\u09C8","\u09DF"

//ya U+09AF to consider

"\u0985", "\u0986", "\u0987", "\u0988", "\u0989", "\u098A", "\u098B", "\u098C", "\u098F", "\u0990",

"\u0993", "\u0994" ,"\u09DF"

"\u0995", "\u0996", "\u0997", "\u0998", "\u0999", "\u099A", "\u099B", "\u099C", "\u099D", "\u099E",

"\u099F", "\u09A0", "\u09A1", "\u09A2", "\u09A3", "\u09A4", "\u09A5", "\u09A6", "\u09A7", "\u09A8",

"\u09AA", "\u09AB", "\u09AC", "\u09AD", "\u09AE", "\u09AF", "\u09B0", "\u09B2", "\u09B6", "\u09B7",

"\u09B8", "\u09B9"

,"\u0982"

,"\u0983"

,"\u0981"

//0983

};

// Create and configure the SaveFileDialog

SaveFileDialog saveFileDialog = new SaveFileDialog();

saveFileDialog.Filter = "Text files (*.txt)|*.txt";

saveFileDialog.DefaultExt = "txt"; // Default extension for saved files

saveFileDialog.FileName = "complete_(NOUNIKODESVALS)BENGSunicode_juktakshor_STRICT_ORDERING_vowels_inclusions.txt"; // Default file name

// Show the SaveFileDialog and check if the user selected a file

if (saveFileDialog.ShowDialog() == DialogResult.OK)

{

string outputFilePath = saveFileDialog.FileName; // Get the file path selected by the user

// Create a UTF-8 enabled text file

//current data for ___temp_long_total_juktakhors_forms is the count

System.IO.File.WriteAllText(outputFilePath + "_" + "_only_halantables_juktakshors_lists.txt", ___strblds_to_check_which_of_the_consonants_are_halanta_clubbables.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved " + outputFilePath + "_" + ___temp_long_total_juktakhors_forms + "_only_coloures_juktakshors_lists.txt");

System.IO.File.WriteAllText(outputFilePath + "_" + "_only_halantables_juktakshors_lists_coloured.txt", ___strblds_to_list_colouring_valids_halantified_the_juktaksors.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved " + outputFilePath + "_" + "_only_halantables_juktakshors_lists_coloured.txt");

System.IO.File.WriteAllText(outputFilePath + "_" + "_special_stringsbuilder_all_merged.txt", _special_stringsbuilder_all_merged.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved " + outputFilePath + "_" + "_special_stringsbuilder_all_merged.txt");

bool TO_INCLUDE_WITH_JUKTS = true;

bool TO_INCLUDE_WITH_COLORS_JUKTS = true;

string juktakshor = "";// consonant1 + halant + consonant2;

string juktakshor___combins = "";// consonant1 + " " + halant + " " + consonant2;

string juktakshorwithsign_1 = "";

string juktakshorwithsign_1___combins = "";

using (StreamWriter writer = new StreamWriter(outputFilePath, false, Encoding.UTF8))

{

// Generate all possible juktakshors with consonants

// foreach (string consonant1 in bengaliConsonants)

foreach (string consonant1 in bengalispecial_Consonants_Vowel_anuhsars_visargs_chandras_raws_vowels)

{

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(consonant1);//doing this

// foreach (string consonant2 in bengaliConsonants)

foreach (string consonant2 in bengalispecial_Consonants_Vowel_anuhsars_visargs_chandras_raws_vowels)

{

___temp_is_there_preassigned_glyph = false;

TO_INCLUDE_WITH_JUKTS = true;

/////////////////////////////////////////////////////////////////

juktakshor = consonant1 + halant + consonant2;

juktakshor___combins = consonant1 +" " + halant +" " + consonant2;

// if(juktakshor.Contains())

TO_INCLUDE_WITH_JUKTS = true;

//ong

if(juktakshor.StartsWith(("ং").ToString()))

{

TO_INCLUDE_WITH_JUKTS = false;

}//if(juktakshor.StartsWith("ং")) ong

else if (juktakshor.StartsWith(("্").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//if (juktakshor.StartsWith("্")) ongs

else if (juktakshor.StartsWith(("্").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//if (juktakshor.StartsWith("্")) halantas

//ঃ "ঃ" bisgs

else if (juktakshor.StartsWith(("ঃ").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//else if (juktakshor.StartsWith("ঃ")) bisgs

//"্ ঃ

else if (juktakshor.Contains(("্ ঃ").ToString()))

{

//halantas

TO_INCLUDE_WITH_JUKTS = false;

}//else if (juktakshor.StartsWith("ঃ")) bisgs

/////////////////////////////////////////////////////////////////

if (TO_INCLUDE_WITH_JUKTS)

{

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS

.Add(consonant1 + consonant2);//doing this

//////___strblds_for_only_coloreds_juktakshors

////// .AppendLine(consonant1 + consonant2);

///////////////////////////////////////////////////////////////////////////////////////////////////////////////

___strblds_for_only_coloreds_juktakshors

.AppendLine(juktakshor+" " + juktakshor___combins);

___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors

.AppendLine(juktakshor + " " + juktakshor___combins);

___temp_is_there_preassigned_glyph

= HasPreassignedGlyph(juktakshor);

___temp_glyph_combined_width_height_report_from_font = "";

___temp_glyph_combined_width_height_report_from_font

RETURN_WIDTH_HEIGHT_FOR_GLYPHS_PreassignedGlyph(juktakshor);

string unicodeValues = GetBENGSUnicodeValuesFORVOWELSINCLUSIONSALSO_WITH_INTEGERS_DATA_ALSO(juktakshor);

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

if(this.checkBox______JUKTAKHORS_COLORS_TO_ADD___TO_INCLUDE_SIGNS_OF_JUKTAKSHORS.CheckState.ToString().TrimEnd().TrimStart().Trim().ToUpper()=="CHECKED")

{

foreach (string sign in bengaliVowelSignsAll)

{

TO_INCLUDE_WITH_COLORS_JUKTS = true;

juktakshorwithsign_1 = juktakshor + sign;

juktakshorwithsign_1___combins = juktakshor___combins + " " + sign;

if (juktakshorwithsign_1.StartsWith(sign.ToString()))

{

TO_INCLUDE_WITH_COLORS_JUKTS = false;

}//if (juktakshorwithsign_1.StartsWith(sign))

else if (juktakshorwithsign_1.StartsWith(("্").ToString()))

{

//halantas

TO_INCLUDE_WITH_COLORS_JUKTS = false;

}//if (juktakshorwithsign_1.StartsWith(sign))

if (TO_INCLUDE_WITH_COLORS_JUKTS)

{

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS

.Add(juktakshorwithsign_1);

writer.WriteLine($"{juktakshorwithsign_1}");

//////___strblds_for_only_coloreds_juktakshors

////// .AppendLine(juktakshorwithsign_1);

//////___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors

////// .AppendLine(juktakshorwithsign_1);

___strblds_for_only_coloreds_juktakshors

.AppendLine(juktakshorwithsign_1 +" " + juktakshorwithsign_1___combins);

// ___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors

// .AppendLine(juktakshorwithsign_1 + " " + juktakshorwithsign_1___combins);

//////////////////////////////////////////////////////////////////////////////////////////////////

//////___strblds_for_only_coloreds_juktakshors

////// .AppendLine(consonant1 + halant + sign+ consonant2);

//////___strblds_for_only_nonrepeats_consonants_coloreds_juktakshors

////// .AppendLine(consonant2 + halant + sign +consonant1);

/////////////////////////////////////////////////////////////////////////////////////////////////////////

___temp_long_total_juktakhors_forms++;

}//if(TO_INCLUDE_WITH_COLORS_JUKTS)

}//foreach(string sign in bengaliVowelSignsAll)

}//if(this.checkBox______JUKTAKHORS_COLORS_TO_ADD___TO_INCLUDE_SIGNS_OF_JUKTAKSHORS.CheckState.ToString().TrimEnd().TrimStart().Trim().ToUpper()=="CHECKED")

// writer.WriteLine($"{juktakshor} - {unicodeValues}");

// writer.WriteLine($"has own preassigned glyph = {___temp_is_there_preassigned_glyph} {___temp_glyph_combined_width_height_report_from_font } {juktakshor} ");

writer.WriteLine($"{juktakshor} combins = {juktakshorwithsign_1___combins}");

___temp_long_total_juktakhors_forms++;

}//if(TO_INCLUDE_WITH_JUKTS)

}// foreach (string consonant2 in bengaliConsonants)

}// foreach (string consonant1 in bengaliConsonants)

//current data for ___temp_long_total_juktakhors_forms is the count

System.IO.File.WriteAllText(outputFilePath+"_"+ ___temp_long_total_juktakhors_forms + "_only_coloures_juktakshors_lists.txt", ___strblds_for_only_coloreds_juktakshors.ToString(), Encoding.UTF8);

System.Windows.Forms.MessageBox.Show("Saved "+outputFilePath+"_"+ ___temp_long_total_juktakhors_forms + "_only_coloures_juktakshors_lists.txt");

if(this.checkBox___TO_CONTINUE_WITH___DETAILED_LONG_6_GB_JUKTAKSHORS.CheckState.ToString().ToUpper().TrimEnd().TrimStart().Trim()=="CHECKED")

{

// Generate all possible juktakshors with vowels

foreach (string consonant in bengaliConsonants)

{

foreach (string vowel in bengaliVowels)

{

juktakshor = consonant + halant + vowel;

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

string unicodeValues = GetBENGSUnicodeValuesFORVOWELSINCLUSIONSALSO_WITH_INTEGERS_DATA_ALSO(juktakshor);

// writer.WriteLine($"{juktakshor} - {unicodeValues}");

writer.WriteLine($"{juktakshor}");

}// foreach (string vowel in bengaliVowels)

}// foreach (string consonant in bengaliConsonants)

// Generate all possible juktakshors with vowels

foreach (string vowel in bengaliVowels)

{

foreach (string consonant in bengaliConsonants)

{

juktakshor = consonant + halant + vowel;

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

string unicodeValues = GetBENGSUnicodeValuesFORVOWELSINCLUSIONSALSO_WITH_INTEGERS_DATA_ALSO(juktakshor);

// writer.WriteLine($"{juktakshor} - {unicodeValues}");

writer.WriteLine($"{juktakshor}");

___temp_long_total_juktakhors_forms++;

}// foreach (string consonant in bengaliConsonants)

}// foreach (string vowel in bengaliVowels)

// Generate all possible juktakshors with vowel signs that come after consonants or juktakshors

foreach (string consonant in bengaliConsonants)

{

foreach (string vowelSign in bengaliVowelSignsAfter)

{

juktakshor = consonant + vowelSign;

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

string unicodeValues = GetBENGSUnicodeValuesFORVOWELSINCLUSIONSALSO_WITH_INTEGERS_DATA_ALSO(juktakshor);

// writer.WriteLine($"{juktakshor} - {unicodeValues}");

writer.WriteLine($"{juktakshor}");

___temp_long_total_juktakhors_forms++;

}// foreach (string vowelSign in bengaliVowelSignsAfter)

}// foreach (string consonant in bengaliConsonants)

// Generate all possible juktakshors with vowel signs that come before consonants or juktakshors

foreach (string consonant in bengaliConsonants)

{

foreach (string vowelSign in bengaliVowelSignsBefore)

{

//////string juktakshor = vowelSign + consonant;//this did not work properly

//////string juktakshor = vowelSign + halant+ consonant;//this did not work properly

///saan has checked that this order works ok

juktakshor = consonant + vowelSign; ///saan has checked that this order works ok

SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

string unicodeValues = GetBENGSUnicodeValuesFORVOWELSINCLUSIONSALSO_WITH_INTEGERS_DATA_ALSO(juktakshor);

// writer.WriteLine($"{juktakshor} - {unicodeValues}");

writer.WriteLine($"{juktakshor}");

___temp_long_total_juktakhors_forms++;

}// foreach (string vowelSign in bengaliVowelSignsBefore)

}// foreach (string consonant in bengaliConsonants)

// SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

foreach (string saan_stringobjs in SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS)

{

foreach (string saan_stringobjsanother in SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS)

{

juktakshor = saan_stringobjs + saan_stringobjsanother;

//SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS.Add(juktakshor);

string unicodeValues = GetBENGSUnicodeValuesFORVOWELSINCLUSIONSALSO_WITH_INTEGERS_DATA_ALSO(juktakshor);

// writer.WriteLine($"{juktakshor} - {unicodeValues}");

writer.WriteLine($"{juktakshor}");

___temp_long_total_juktakhors_forms++;

}//foreach(string saan_stringobjsanother in SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS)

}//foreach(string saan_stringobjs in SAANS_JUKTAKSHOR_KOKSHO_LIST_OF_STRINGS)

}//if(this.checkBox___TO_CONTINUE_WITH___DETAILED_LONG_6_GB_JUKTAKSHORS.CheckState.ToString().ToUpper().TrimEnd().TrimStart().Trim()=="CHECKED")

else

{

System.Windows.Forms.MessageBox.Show("not continue since you have stopped checkBox___TO_CONTINUE_WITH___DETAILED_LONG_6_GB_JUKTAKSHORS");

}//end of else of }//if(this.checkBox___TO_CONTINUE_WITH___DETAILED_LONG_6_GB_JUKTAKSHORS.CheckState.ToString().ToUpper().TrimEnd().TrimStart().Trim()=="CHECKED")

}// using (StreamWriter writer = new StreamWriter(outputFilePath, false, Encoding.UTF8))

Console.WriteLine("Juktakshors generated and saved to " + outputFilePath);

Console.WriteLine("___temp_long_total_juktakhors_forms " + ___temp_long_total_juktakhors_forms);

MessageBox.Show("total = " + ___temp_long_total_juktakhors_forms + " Juktakshors generated and saved to " + outputFilePath);

System.IO.File.WriteAllText(outputFilePath + "_" + ___temp_long_total_juktakhors_forms + ".count", ___temp_long_total_juktakhors_forms.ToString());

}// if (saveFileDialog.ShowDialog() == DialogResult.OK)

}// private void button___GENERATETHEBENGJUKTAKSHORS_Click(object sender, EventArgs e)

You've provided a highly detailed and technical description of a Unicode-based phonetic and transliteration model for Bengali, rooted in Sanjoy Nath's axiomatic framework. Let me break this down and explain the key concepts and structure in a clear, organized way.

________________________________________

🔤 Understanding the Bengali Unicode Symbols and Their Role

🧩 Special Symbols (Non-Starters)

These Unicode characters cannot start a phonetic syllable or a Unicode glyph cluster. They are only allowed at the end of a syllable or glyph group.

Symbol Name Unicode Description

Candrabindu \u0981 Nasalization mark, end-only

Anusvara \u0982 Nasal sound, end-only

Visarga \u0983 Aspirated sound, end-only

Halant (Virama) \u09CD Connector between consonants

Yafalas (variant Halant) \u09CD Used in conjuncts, end-only

These symbols are not phonetic initiators. They are modifiers and connectors, used to form Juktakshors (conjunct consonants) and complex glyphs.

________________________________________

🧠 Sanjoy Nath’s Axiomatic Transliteration Model

This model is designed to:

• Convert Bengali Unicode text to ASCII transliteration.

• Reconstruct the original Unicode from the ASCII.

• Avoid lookup tables by using complexity-based ordering.

🔢 Complexity-Based Transliteration Class

• Entries are sorted by complexity (descending).

• Most complex transliterations are applied first.

• Once a match is found and replaced, the loop breaks.

• This ensures deep structures are resolved before simple ones.

________________________________________

📐 Axioms of Complexity

Axiom 1: Deepest Complexity (Level 6)

• Juktakshors with:

• Multiple consonants connected by Halant

• Vowel signs attached

• Special symbols at the end

• These are the most complex and must be processed first.

Axiom 2: Intermediate Complexity (Level 3++)

• Juktakshors without vowel signs

• Still involve Halant-connected consonants

• Less complex than Axiom 1 but more than free consonants

Axiom 3: Basic Complexity (Level 0–1)

• Free vowels: complexity ~0.x

• Free consonants: complexity ~1.x

• May have special symbols attached at the end

• Cannot start with special symbols

________________________________________

🔄 Phonetic Rules Summary

• Syllables cannot start with: Candrabindu, Anusvara, Visarga, Halant

• Halant is used between consonants to form conjuncts

• Vowel signs attach to the right side of consonants or conjuncts

• Special symbols can appear only at the end

________________________________________

🛠️ Next Steps to Build an Offline System

To develop this system as an offline automated theorem prover or transliteration engine, follow these steps:

1. Define the Unicode Grammar

• Create a formal grammar for Bengali syllables using Unicode rules.

• Encode constraints from the axioms (e.g., no starting with special symbols).

2. Build the Complexity-Ordered Transliteration Table

• Use a class like TransliterationEntry.

• Sort entries by complexity_score descending.

3. Implement the Transliteration Engine

• Scan input text.

• Apply transliteration rules in order.

• Break loop on first match per token.

4. Reverse Transliteration Logic

• Use the same table to reconstruct Unicode from ASCII.

• Ensure reversibility by preserving complexity order.

5. Validation Engine

• Check for:

• Invalid starting symbols

• Improper Halant usage

• Missing or circular definitions

• Use dependency graphs to validate ordering (like a compiler).

6. Offline Deployment

• Package as a CLI tool or desktop app.

• Use C# or Python for Unicode handling and GUI (if needed).

• Store transliteration rules in embedded resources or runtime-generated lists.

________________________________________

Would you like help writing a prototype of this transliteration engine or the validation logic for the axioms? I can generate code or diagrams to get you started.

class TransliterationEntry {

string from_unicode;

string to_ascii;

double complexity_score;