Click here to Skip to main content
15,868,340 members
Articles / Containers / Virtual Machine

Statistical parsing of English sentences

Rate me:
Please Sign up or sign in to vote.
4.95/5 (88 votes)
13 Dec 200617 min read 980.4K   23.6K   239  
Shows how to generate parse trees for English language sentences, using a C# port of OpenNLP, a statistical natural language parsing library.
//Copyright (C) 2005 Richard J. Northedge
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.

//This file is based on the NameFinder.java source file found in the
//original java implementation of OpenNLP.  That source file contains the following header:

//Copyright (C) 2003 Thomas Morton
// 
//This library is free software; you can redistribute it and/or
//modify it under the terms of the GNU Lesser General Public
//License as published by the Free Software Foundation; either
//version 2.1 of the License, or (at your option) any later version.
// 
//This library is distributed in the hope that it will be useful,
//but WITHOUT ANY WARRANTY; without even the implied warranty of
//MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//GNU Lesser General Public License for more details.
// 
//You should have received a copy of the GNU Lesser General Public
//License along with this program; if not, write to the Free Software
//Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.

using System;
using System.Collections;

namespace OpenNLP.Tools.NameFind
{
	/// <summary>
	/// The interface for name finders which provide name tags for a sequence of tokens.
	/// </summary>
	public interface INameFinder
	{
		/// <summary>
		/// Generates name tags for the given sequence returning the result in a list.
		/// </summary>
		/// <param name="tokens">
		/// a list of the tokens or words of the sequence.
		/// </param>
		/// <param name="previousTags">
		/// a mapping between tokens and outcomes from previous sentences. 
		/// </param>
		/// <returns>
		/// a list of chunk tags for each token in the sequence.
		/// </returns>
		ArrayList Find(ArrayList tokens, IDictionary previousTags);
			
		/// <summary>
		/// Generates name tags for the given sequence returning the result in an array.
		/// </summary>
		/// <param name="tokens">
		/// an array of the tokens or words of the sequence.
		/// </param>
		/// <param name="previousTags">
		/// a mapping between tokens and outcomes from previous sentences. 
		/// </param>
		/// <returns>
		/// an array of chunk tags for each token in the sequence.
		/// </returns>
		string[] Find(object[] tokens, IDictionary previousTags);
	}
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


Written By
Web Developer
United Kingdom United Kingdom
Richard Northedge is a senior developer with a UK Microsoft Gold Partner company. He has a postgraduate degree in English Literature, has been programming professionally since 1998 and has been an MCSD since 2000.

Comments and Discussions