What did you accomplish today?
Re: What did you accomplish today?
Finally finished part one of a story I was working on in Hóubenk Xúuuatxia. Whew! Part two could be up today or tomorrow (but no promises )
Last edited by Arayaz on 06 May 2024 03:25, edited 1 time in total.
Proud member of the myopic-trans-southerner-Viossa-girl-with-two-cats-who-joined-on-September-6th-2022 gang
2c2ef0 Areyaxi family Arskiilz Kahóra Xúuuatxia Alushi [Unnamed] Ẹlnk kakúsan
my garbage Ɛĭ3
she/her
2c2ef0 Areyaxi family Arskiilz Kahóra Xúuuatxia Alushi [Unnamed] Ẹlnk kakúsan
my garbage Ɛĭ3
she/her
Re: What did you accomplish today?
I posted the intro to Akatennaji, in Conworlds/Concultures.
Hopefully I can update it soon, because it's a very tiny thing.
Hopefully I can update it soon, because it's a very tiny thing.
he/him, they/them
Forgive me if I seem uneducated or disorganized, I am new to the community and vocab.
currently hyperfocused on: Daas
Forgive me if I seem uneducated or disorganized, I am new to the community and vocab.
currently hyperfocused on: Daas
-
- mongolian
- Posts: 3983
- Joined: 14 Aug 2010 09:36
- Location: California über alles
Re: What did you accomplish today?
I have just reached word #6,089 in the alphabetical list of words from the IGCE corpus, "bombproof". That means I am now exactly one-tenth of the way through my wordlist! I have 90,686 Kankonian words now.
♂♥♂♀
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Re: What did you accomplish today?
Is it a coincidence that the number of Kankonian words is composed of the same array of digits as the place in the list of words?Khemehekis wrote: ↑04 May 2024 04:36 I have just reached word #6,089 in the alphabetical list of words from the IGCE corpus, "bombproof". That means I am now exactly one-tenth of the way through my wordlist! I have 90,686 Kankonian words now.
Proud member of the myopic-trans-southerner-Viossa-girl-with-two-cats-who-joined-on-September-6th-2022 gang
2c2ef0 Areyaxi family Arskiilz Kahóra Xúuuatxia Alushi [Unnamed] Ẹlnk kakúsan
my garbage Ɛĭ3
she/her
2c2ef0 Areyaxi family Arskiilz Kahóra Xúuuatxia Alushi [Unnamed] Ẹlnk kakúsan
my garbage Ɛĭ3
she/her
-
- mongolian
- Posts: 3983
- Joined: 14 Aug 2010 09:36
- Location: California über alles
Re: What did you accomplish today?
Wow, I thought in the back of my mind that they looked similar, but I didn't look closely! Yes, it IS a coincidence! It's a cool coincidence, though.Arayaz wrote: ↑04 May 2024 04:40Is it a coincidence that the number of Kankonian words is composed of the same array of digits as the place in the list of words?Khemehekis wrote: ↑04 May 2024 04:36 I have just reached word #6,089 in the alphabetical list of words from the IGCE corpus, "bombproof". That means I am now exactly one-tenth of the way through my wordlist! I have 90,686 Kankonian words now.
♂♥♂♀
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
-
- mongolian
- Posts: 3983
- Joined: 14 Aug 2010 09:36
- Location: California über alles
Re: What did you accomplish today?
When I was 1% of the way through the wordlist, I did a calculation with how many new words I had added to Kankonian and predicted I would get about 22,000 new words out of that, ending up with 109K-110K Kankonian words.
Now that I'm 10% of the way through, I calculated again. Going from 87,780 to 90,686 Kankonian words meant Kankonian's vocabulary had increased by 2,906 words, so I should get about 29,000 new words out of the IGCE wordlist. That means finishing with about 116K-117K words in Kankonian's lexicon.
Now that I'm 10% of the way through, I calculated again. Going from 87,780 to 90,686 Kankonian words meant Kankonian's vocabulary had increased by 2,906 words, so I should get about 29,000 new words out of the IGCE wordlist. That means finishing with about 116K-117K words in Kankonian's lexicon.
♂♥♂♀
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Re: What did you accomplish today?
Finished part two of Toxèix Haio iu!!
Proud member of the myopic-trans-southerner-Viossa-girl-with-two-cats-who-joined-on-September-6th-2022 gang
2c2ef0 Areyaxi family Arskiilz Kahóra Xúuuatxia Alushi [Unnamed] Ẹlnk kakúsan
my garbage Ɛĭ3
she/her
2c2ef0 Areyaxi family Arskiilz Kahóra Xúuuatxia Alushi [Unnamed] Ẹlnk kakúsan
my garbage Ɛĭ3
she/her
-
- mongolian
- Posts: 3983
- Joined: 14 Aug 2010 09:36
- Location: California über alles
Re: What did you accomplish today?
Set my Kankonian work aside for the day after kametwa, meaning kametua (a Povoian chocolate ball filled with crème and cocoa powder and covered with chocolate sprinkles). The kametua is Kankonia's answer to the brigadeiro.
♂♥♂♀
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
-
- mongolian
- Posts: 3983
- Joined: 14 Aug 2010 09:36
- Location: California über alles
Re: What did you accomplish today?
Upon creating dukdzhiph, the Kankonian word for "bytecode" that was borrowed from the Achel dukdibb, I finished my trek through the B-words on the IGCE corpus list. I now have 91,369 words. The 91,592-word milestone, whereupon Kankonian will surpass Classical Yiklamu in lexicon size, is fast approaching.
I guess word #91,592 is going to be a C-word!
I guess word #91,592 is going to be a C-word!
♂♥♂♀
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Squirrels chase koi . . . chase squirrels
My Kankonian-English dictionary: 92,000 words and counting
31,416: The number of the conlanging beast!
Re: What did you accomplish today?
I've still more testing to do, but I've made a lot of progress on making my sound changer capable of handling unordered searches* in all sorts of configurations. I can't go into all the details due to there being so many, but the progress is very satisfying.
* unordered searches is what I call the notation used to say "find the following phonemes in any order and regardless of whether there are other things in between". An actual use case in applying sound changes would be when writing a rule such as "turn /s/ to /z/ if there was a voiced consonant at any point before it in the word", with the search for a voiced consonant being expressed as an unordered search, surrounded by the delimiter '|'. The full notation in my sound changer would be:
s → z / |C[+voice]|_
* unordered searches is what I call the notation used to say "find the following phonemes in any order and regardless of whether there are other things in between". An actual use case in applying sound changes would be when writing a rule such as "turn /s/ to /z/ if there was a voiced consonant at any point before it in the word", with the search for a voiced consonant being expressed as an unordered search, surrounded by the delimiter '|'. The full notation in my sound changer would be:
s → z / |C[+voice]|_
Re: What did you accomplish today?
After spending all my time on pure comparison mechanisms, I've now taken the time to reintroduce actual sound changing to my sound changer. There were a few hiccups and there still is stuff to figure out, but progress has been much swifter. In its current state, it can take a word list such as:
bat
buut
beit
sibeat
And correctly apply the following rules:
Rule 1 :
t → l / bV+_
Rule 2 :
l → le / _
To produce the result:
bale
buule
beile
sibeale
The next "to-do" is a pretty big one though - modifying the internal mechanics of my changer so that it can correctly apply a more "common sense" notation of rule 2:
∅ → e / l_
I'll have to modify my comparison handler and its results to account for a third kind of "valid": a scenario where only a location is transmitted for something to be inserted, rather than a segment that is due to be replaced (e.g. the previous notation for rule 2 essentially operates by replacing /l/ with /le/, rather than just inserting an /e/ after /l/).
bat
buut
beit
sibeat
And correctly apply the following rules:
Rule 1 :
t → l / bV+_
Rule 2 :
l → le / _
To produce the result:
bale
buule
beile
sibeale
The next "to-do" is a pretty big one though - modifying the internal mechanics of my changer so that it can correctly apply a more "common sense" notation of rule 2:
∅ → e / l_
I'll have to modify my comparison handler and its results to account for a third kind of "valid": a scenario where only a location is transmitted for something to be inserted, rather than a segment that is due to be replaced (e.g. the previous notation for rule 2 essentially operates by replacing /l/ with /le/, rather than just inserting an /e/ after /l/).
Re: What did you accomplish today?
I added /l/ as a marginal phoneme in Abaniscen — it only contrasts with /ɾ/ in word-final position while preceded by /ɛ/. An example is the pair tenner (to cover, shield, protect) and niestel (to be named).
Re: What did you accomplish today?
After a whole lot of rewriting, I've finally started on a smarter input-replacement mechanism for my sound changer. It's likely to get a bit more complicated very quick, but the basic form was at least decently easy, and I can now apply the following rule rather easily:
{a,e} → {e,i} / s_
Which, when applied to the word:
samilset
Converts it to:
semilsit
A human can do this with barely any effort, but a computer? It takes quite a bit of code. For a start, the "dumbest" possible approach of doing a simple "search and replace" would land you with "s{e,i}mils{e,i}t", and you don't want that. Heck, it requires the app to actually discern /a/ and /e/ in '{a,e}' when searching in the first place.
To solve this, I've implemented token "locations", which provide the exact position of a token within a hierarchy, represented as an array of indices up to the root token. E.g. the /e/ in /{a,e}/'s location is [0,2] because it is the third "child" token (yes, the ',' also counts as a child) of the case block (i.e. a structure of "{...}"), which is itself the first token of the input's root.
That same location is then searched for in the output, and if something is found, it is used as a replacement for the target token in the word.
However, this location-based approach becomes insufficient if the input and output do not have the same structure. Even unequal length would already cause trouble, e.g.:
{al,el} → {edj,idj} / s_
Pure location would end up replacing /al/ with /ed/ instead of the full /edj/. Worse yet, replacing /el/ purely by location would render /,i/ !
So, there's a lot of room for error here, and I'll have to smarten up my program to solve this. Probably the best and most economical way to do it would be to convert the found tokens and their location to cases and locations instead. We'll see.
{a,e} → {e,i} / s_
Which, when applied to the word:
samilset
Converts it to:
semilsit
A human can do this with barely any effort, but a computer? It takes quite a bit of code. For a start, the "dumbest" possible approach of doing a simple "search and replace" would land you with "s{e,i}mils{e,i}t", and you don't want that. Heck, it requires the app to actually discern /a/ and /e/ in '{a,e}' when searching in the first place.
To solve this, I've implemented token "locations", which provide the exact position of a token within a hierarchy, represented as an array of indices up to the root token. E.g. the /e/ in /{a,e}/'s location is [0,2] because it is the third "child" token (yes, the ',' also counts as a child) of the case block (i.e. a structure of "{...}"), which is itself the first token of the input's root.
That same location is then searched for in the output, and if something is found, it is used as a replacement for the target token in the word.
However, this location-based approach becomes insufficient if the input and output do not have the same structure. Even unequal length would already cause trouble, e.g.:
{al,el} → {edj,idj} / s_
Pure location would end up replacing /al/ with /ed/ instead of the full /edj/. Worse yet, replacing /el/ purely by location would render /,i/ !
So, there's a lot of room for error here, and I'll have to smarten up my program to solve this. Probably the best and most economical way to do it would be to convert the found tokens and their location to cases and locations instead. We'll see.