Computational Linguist

NetBase, a well-funded, fast growing company with an impressive roster of top-tier Fortune 500 companies, seeks to grow its team with a hands-on computational grammarian. This is an exciting opportunity to be part of a growing and dynamic team that is committed to delivering the very best to our customers. NetBase has great potential with an already sizable and enviable customer roster.

NetBase's ground-breaking solution combines search and text analytics technologies to help business users answer complex questions faster, more accurately, and with greater confidence by finding and extracting answers from the Internet and subscription content.

The Computational Linguist role involves natural language data analysis, developing and debugging computational grammars in our industry-leading Natural Language Platform; evaluating components in our natural language processing systems.

Specific required qualifications include:

• Two years of experiences as Software or Database Engineer using object-oriented programming languages (Java or C++)
• One year experience research and design computer algorithms and tools for natural language processing; performing linguistics analysis and implementation of computational patterns;
• A Master's in Computational Linguistics;

Desired qualifications:

• Experiences in applying Machine Learning approaches and algorithms to solve typical NLP problems, such as text classification/clustering, information extraction and co-reference resolution;
• Prior research experiences in a NLP research environment;
• Experiences in working with industrial-scale information retrieval/question answering systems

We look for people who are flexible (required in a startup), learn quickly, and love getting into the details.

Salary will be commensurate with education and experience.

Authorization to work in the US and relocation are required.

To apply: Please submit a resume and cover letter via email to team@netbase.com with the subject of "Computational Linguist".

Date Posted: 2008-10-01