A Method to Determine the Sentence Structure of Animals and Insects ()
1. Data & Methods
Although the variation and sophistication of language from species to species differ, the segue linking each species together is the distinction between Pitch from one or more vocal contributions; this suggests Animals and Insects are utilizing a hidden sentence structure. By analyzing the language of any species, a structure is achieved when a Conjunction Pitch differs from a Neighboring Pitch. If the species being analyzed makes no distinction between Conjunction Pitch and Neighboring Pitch, then the spacing between Pitches must be considered as its structure. The foundation of this research originates from the distinction between Pitch, Tone, Frequency and Spacing of vocal contributions from Animals and Insects. Assuming there is a sophistication to the native language of Animals and Insects, with the evidence of an inherent capacity to coordinate, an underlying code is discoverable. As such, applying basic mathematics to the critical thought process regarding this concept achieves Four Laws.
1) The First Law: A Conjunction Pitch [i(x)] is either a Dictionary.com (2015). Noun [i(1)], Pronoun [i(2)], Adjective [i(3)], Verb [i(4)], Adverb [i(5)], Preposition [i(6)], Conjunction [i(7)], or Article [i(8)].
a) Example: Hello [i(a)] There [i(x)] World [i(b)].
2) The Second Law: A Neighboring Pitch [i(a)], [i(b)] cannot be a Conjunction Pitch [i(x)] unless it is a List.
a) Example: Lazy [i(a)] Samantha [i(x)], Sam [i(b)].
3) The Third Law: A List can begin or end with a Noun.
a) Example: Samantha [i(a)], Sam [i(x)], Lazy [i(b)].
4) The Fourth Law: Pitch is equal to the following Eight Combinations of Language;
If [i(a)] = a
If [i(x)] = x
If [i(b)] = b
Then…
1) a > x < b
Or
2) a > x > b
Or
3) a < x < b
Or
4) a < x > b
Or
5) a = x < b
Or
6) a = x > b
Or
7) a < x = b
Or
8) a > x = b
The Method to determine the sentence structure and sophistication of any Animal or Insect language is achieved by comparing samples of vocal contributions, identifying one or more reoccurrences of a Neighboring Pitch to a Conjunction Pitch, and cataloging the results. For example; 1) Sam-Samantha-Lazy, 2) Bad-Samantha-Was, 3) Sam-Samantha-Funny. In this example, the Conjunction Pitch matches the Neighboring Pitch in both (1) and (3), which results in a positive catalog result.
1) Isolate any Three “Words” from any Species.
2) Isolate the First Word.
3) Isolate the Second Word.
4) Isolate the Third Word.
5) Define the Pitch of the Second Word in the String as a Conjunction Pitch [i(x)].
6) Define the Pitch of the First Word in the String as a Neighboring Pitch [i(a)].
7) Define the Pitch of the Third Word in the String as a Neighboring Pitch [i(b)].
8) Compare the Conjunction Pitch [i(x)] in the Three-Word-String against a library of audio recordings from the same Species to identify a Neighboring Pitch.
9) Catalog each Neighboring Pitch as a Context to the Conjunction Pitch if the Neighboring Pitch occurs Twice.
a) Example: A and X in String A matches A and X in String C.
i) Catalog = No: [i(a123)] [i(x1)] [i(b456)] = String A.
ii) Catalog = No: [i(a456)] [i(x1)] [i(b789)] = String B.
iii) Catalog = Yes: [i(a123)] [i(x1)] [i(b1011)] = String C.
2. Conclusion
The above Data & Method enables the user to quickly decipher any language, without the definition of a Conjunction Pitch or Neighboring Pitch.
Glossary
[a] Conjunction Pitch [i(x)]: The Pitch of a Word or Sound that is nestled between Two Words or Sounds in a string of Three Words or Sounds emitted from any life form.
[b] Neighboring Pitch [i(a)] [i(b)]: The Pitch of a Word or Sound that exists on either the beginning, the end, or both sides of a Conjunction Pitch emitted from any life form.