In this language I'm making (it's a very logical language, actually a continuation/improvement of the Xalian language/s I created a while ago), it has a fairly constricted syllabic construct due to it's writing system and grammar. So I wanted to see how many one syllable words I could possibly have in this language.
So basically v is vowels, and c is consonants (within the constraints of the grammar; so there are two types of consonants) (there are actually more vowels and consonants, however they are simply different forms of the mentioned consonants and vowels and are used for inflection).
v = a o ɯ
c1 = p f t θ s ts ʃ tʃ ɫ k x
c2 = m n ɲ ŋ l ɾ ʁ j w ø
Therefore,
N(v) = 3
N(c1) = 11
N(c2) = 10
And the syllabic constructs are as follows,
s1 = c1+v+c1
s2 = c1+v+c2
s3 = c2+v+c1
So the total number of each of the syllabic constructs possible is
N(s1) = N(c1)*N(v)*N(c1) = 11*3*11 = 363
N(s2) = N(c1)*N(v)*N(c2) = 11*3*10 = 330
N(s3) = N(c2)*N(v)*N(c1) = 10*3*11 = 330
So then the total of all the syllables
N(s) = N(s1)+N(s2)+N(s3) = 363+330+330 = 1,023
....right? Now if only I had a quick way of producing a list of every possible syllable, and then it'd be a matter of applying meanings to each one and creating compound words with them for a complete lexical inventory. Any ideas? Maybe a program of some sort I can use?
Reply With Quote
Originally Posted by Dirac
Bookmarks