Skip to main content

First Project (First Iteration)

NOTE: Major error in the dictionary -- plural forms identified as singular.  (12/30/17, 8:10 PM)

This is the first version of my first project.  The overall goal would be to create a fully functional application that can parse any Latin verb the user enters.  This represents my first baby steps towards that goal.  Here is the code:
stems = {
"o" : "first person singular",
"as" : "second person singular",
"at" : "third person singular",
"amus" : "first person singular",
"atis" : "second person singular",
"ant" : "third person singular",
} 
def parse(verb):
    stem = verb[len("am"):]
    try:
        return(stems[stem])
    except:
        print("Verb form not found.") 
while True:
    entry = input("Enter a Latin verb: ")
    if parse(entry) != None:
        print(parse(entry))
Right now, the parser has pretty severe limitations.  It will only parse singular present active indicative forms of the verb "amo".  I've set up a dictionary to recognize all of those forms.

The main idea for the app is to take the user entry, split it into root and stem, then search for the entry corresponding to that stem in the dictionary.  One question for the final form would be whether I would want to make the dictionary sensitive to different roots or just focus on stems.  Probably if the app can just find the stem, it doesn't have to know anything about the root.  If it finds no stem, it will return an error.

Since there are several forms of conjugation in Latin (e.g. first conjugation, second conjugation), I might want to consider whether to have separate dictionary for each conjugation, where the app is able to determine which conjugation to look in.

Sometimes the conjugation is ambiguous -- in that case, I would want to be able to program the app to print all relevant entries.

How does the app work right now?  First, the user enters something, hopefully a form of the verb "amo."  The app calls a function, parse(), using the entry as its argument.  It pretty much assumes that it is looking for the stem of the verb "amo" -- I did this by having it define stem as everything from the end of that root (from string position 3, in other words).  It then uses stem as a key to look up the verb form in the dictionary.  If it finds the verb form, it returns the entry -- otherwise, it alerts the user that nothing was found.

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

Quick Find / Quick Union (Connected Nodes)

Setup This week I learned about the "Quick Find" or "Quick Union" algorithm. Imagine an NxN grid of nodes, some of which are connected by lines. A connection can be interpreted as accessibility: if two nodes are connected, you can get from one to the other. Every node is accessible to itself: to get where you already are, stay there. Also, If you can get from A to B, you can go back from B to A. And if you can get from A to B and from B to C, then you can get from A to C. As a consequence, the connection between nodes divides the grid into regions of mutually accessible nodes. You can travel from any node in a given region to any other node in that region -- but not to any nodes outside that region (exercise to reader -- proof by contradiction). The problem has two parts. First, find a way to represent this grid structure and the accessibility relation; second, use your schema to efficiently calculate whether two given nodes are accessible to each other. ...
Post a Comment
Read more