Important information about NACLO 2018 at William and Mary:
Date: January 25, 2018
This coming January 2018, the College of William and Mary will once again be hosting the North American Computational Linguistics Olympiad (NACLO). This is a unique opportunity for middle and high school students between grades 6 and 12 to participate in solving linguistic puzzles and challenging themselves to refine their logic skills.
The Olympiad consists of two rounds: the Open Round is accessible to all willing participants, while the Invitational Round is open to those participants that excel in the Open Round. The format of the competition is in the form of a written test with linguistic puzzle problems. The types of problems one can expect vary greatly, and can include such items as translation problems, number problems, writing systems, calendar systems, formal problems, phonological problems, computational problems, kinship systems, and transcriptions of speech.
No experience or prior knowledge of linguistics or second languages is required. This is a unique opportunity for young people to experience a taste of natural-language processing in the 21st century, and will help build logic skills and creativity!
The Olympiad will be hosted at the College of William and Mary on January 25, 2018. Practice test problems, readings, registration information, and the Handbook can be found here.
Registration: You can register using the following webform.
Time: Event starts at 10:00 AM sharp. Participants are asked to arrive 15 minutes before the start of the event.
Location: The event will be held in the Sadler Center on the campus of William & Mary (room: Chesapeake C). Please click the following link for directions: Sadler Center. Please note that parking is enforced on campus and vehicles that do not have a William & Mary parking pass will be ticketed. You can, however, pay to park in designated areas or obtain a parking pass. Information about parking can be found here: W&M parking restrictions.
For more information, please contact Professor Dan Parker (firstname.lastname@example.org).