Skip to main content

Searching For the Conjugation

stems = {
"o" : "first person singular",
"as" : "second person singular",
"at" : "third person singular",
"amus" : "first person plural",
"atis" : "second person plural",
"ant" : "third person plural",
} 
conjugations = list()
for key in stems:
    conjugations.append(key)
def parse(verb):
    for conj in conjugations:
        if verb.count(conj) == 1:
            return(stems[conj])
        else:
            continue 
while True:
    entry = input("Enter a Latin verb: ")
    if parse(entry) != None:
        print(parse(entry))
    else:
        print("Verb form not found.")
One major problem with the last iteration of the conjugation finder: I entered the plural forms as singular in the dictionary!

I believe the search tool will be more effective if it isn't tied to any particular root.  Then I can have a dictionary filled with different stems.  Ideally, if the application finds any of these stems at the end of the word, it will then return the appropriate information to the user. 

So my new idea is to keep my dictionary of all the relevant stems, then loop through a list of the dictionary's keys to see whether any of them are present in the user entry.  If the app finds one of the keys in the user entry, it returns the dictionary entry for that key. 

I experimented around with using find(), rfind(), index(), etc., but I couldn't get it to work.  Originally, I wanted to recreate the stem using a key-search, but I couldn't pull out the right part of the string.  That's a problem in itself.  Say you have the string "amant" -- you use find() to get the position of "ant", then create a new string, "ant," by slicing the old string with the position.  So I thought I could do something like this:
stem = verb[verb.find("ant"):]
But it just didn't work.

Another thing to note: the parser isn't intelligent.  So I want to get to a version where it won't be fooled if someone enters a verb with repeated stems or multiple stems.  If the user enter "amoasat," which isn't a real verb, I don't expect the parser to tell the user it isn't a real verb (that would be far down the line) -- but I do expect it to tell the user that it's third-person singular and not second-person singular.  Not sure I have that functionality yet.

Comments

Post a Comment

Popular posts from this blog

Getting Geodata From Google's API

The apps I'm going to be analyzing are part of Dr. Charles Severance's MOOC on Python and Databases and work together according to the following structure (which applies both in this specific case and more generally to any application that creates and interprets a database using online data). The data source, in this case, is Google's Google Maps Geocoding API.  The "package" has two components: geoload.py  and geodump.py .  geoload.py  reads a list of locations from a file -- addresses for which we would like geographical information -- requests information about them from Google, and stores the information on a database ( geodata.db ).  geodump.py  reads and parses data from the database in JSON, then loads that into a javascript file.  The javascript is then used to create a web page on which the data is visualized as a series of points on the world-map.  Dr. Severance's course focuses on Python, so I'm only going to work my way through ...
Post a Comment
Read more

Compiling and Executing Java Files With -cp

I decided I was going to "man up" and figure out how to compile a java program with an external dependency from the command line instead of relying on an IDE-- the DOS command line, to be more specific. I ran into a few problems: 1.  The external dependency was given to me as a java file.  I experimented compiling it as a .jar, but I wasn't sure how to import a class from a .jar, so I ended up compiling it into a class. 2.  When I tried to run the file, I got an error saying that the class had been compiled with a different version of Java than my JRE.  The Internet told me to check my path variable for Java.  It sure looked like it was pointing to the latest JRE (and the same version of Java as my compiler).  I asked the Internet again and found the following command: for %I in (java.exe) do @echo %~$PATH:I I'm not exactly sure what the syntax of that magic command is (intuitively it's returning the path that executes when I run the "java" com...
Post a Comment
Read more

Throughput, Latency, and Pipelines: Diagnosis Of A Fallacy

Source here . Latency is the time it takes for a job to complete from start to finish -- for example, if we're downloading a file from a server, we might define the latency of the download as the amount of time it takes from the initial request for the file to the time the last byte is received. Throughput is a measure of how much can be completed in a given time.  Following the same example, how many files could we download in an hour? What is the relationship between latency and throughput?   It make take, again, 1 hour to download a file.  Notice already that we have a relationship between some amount of work that can be completed and time -- if the file is, say, 2 GB, it takes 1 hour to download 2 GB in our example.  What we really want to do here is generalize: how long does it take to download 10 GB?  How many GB can we download in ten hours or one minute?  Generalizing over time, we derive latency; generalizing over work completed, we derive the...
Post a Comment
Read more