Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Statistical parsing of English sentences

, 13 Dec 2006
Shows how to generate parse trees for English language sentences, using a C# port of OpenNLP, a statistical natural language parsing library.
englishparsing_bin.zip
Lithium.dll
ModelConverter.exe
OpenNLP Tools.chm
OpenNLP.dll
ParseTree.exe
SharpEntropy.dll
ToolsExample.exe
englishparsing_net2_0_bin.zip
ToolsExample.exe
Lithium.dll
ModelConverter.exe
OpenNLP Tools.chm
OpenNLP.dll
ParseTree.exe
SharpEntropy.dll
englishparsing_net2_0_src.zip
Lithium
Collections
Delegates
Enums
Interfaces
IO
Lithium.csproj.vspscc
LithiumControl.bmp
Shapes
UI
Visitors
ModelConverter
App.ico
ModelConverter.csproj.vspscc
ParseTree
App.ico
ParseTree.csproj.vspscc
ToolsExample
App.ico
ToolsExample.csproj.vspscc
OpenNLP
OpenNLP.csproj.vspscc
SharpEntropy.dll
Tools
Chunker
NameFind
Parser
PosTagger
SentenceDetect
Tokenize
Util
englishparsing_src.zip
Lithium.csproj.user
LithiumControl.bmp
App.ico
ModelConverter.csproj.user
OpenNLP.csproj.user
SharpEntropy.dll
vssver.scc
vssver.scc
vssver.scc
vssver.scc
vssver.scc
vssver.scc
vssver.scc
App.ico
ParseTree.csproj.user
App.ico
ToolsExample.csproj.user
//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.

using System;
using System.Collections;

namespace OpenNLP.Tools.Util
{
	/// <summary>
	/// This class contains methods to manage a sorted collection.
	/// RN note: this class (taken from the JLCA "support" code) doesn't actually
	/// sort anything.
	/// </summary>
	public class SortedSet : Set
	{
		/// <summary>
		/// Creates a new SortedSet.
		/// </summary>
		public SortedSet() : base()
		{
		}
				
		/// <summary>
		/// Create a new SortedSet with a specific collection.
		/// </summary>
		/// <param name="collection">
		/// The collection used to iniciatilize the SortedSetSupport
		/// </param>
		public SortedSet(ICollection collection): base(collection)
		{
		}
	 
		/// <summary>
		/// Returns the first element from the set.
		/// </summary>
		/// <returns>
		/// Returns the first element from the set.
		/// </returns>
		public virtual object First()
		{
			IEnumerator enumerator = this.GetEnumerator();
			enumerator.MoveNext();
			return enumerator.Current;
		}
	 
		/// <summary>
		/// Returns a view of elements until the specified element.
		/// </summary>
		/// <returns>
		/// Returns a sorted set of elements that are strictly less than the specified element.
		/// </returns>
		public virtual SortedSet HeadSet(object toElement)
		{
			SortedSet sortedSet = new SortedSet();
			IEnumerator enumerator = this.GetEnumerator();
			while((enumerator.MoveNext() && ((enumerator.Current.ToString().CompareTo(toElement.ToString())) < 0)))
			{
				sortedSet.Add(enumerator.Current);
			}
			return sortedSet;
		}
	 
		/// <summary>
		/// Returns the last element of the set.
		/// </summary>
		/// <returns>Returns the last element from the set.</returns>
		public virtual object Last()
		{
			IEnumerator enumerator = this.GetEnumerator();
			object element = null;
			while(enumerator.MoveNext())
			{
				if (enumerator.Current!= null)
				{
					element = enumerator.Current;
				}
			}
			return element;
		}
	 
		/// <summary>
		/// Returns a view of elements from the specified element.
		/// </summary>
		/// <returns>
		/// Returns a sorted set of elements that are greater or equal to the specified element.
		/// </returns>
		public virtual SortedSet TailSet(object fromElement)
		{
			SortedSet sortedSet = new SortedSet();
			IEnumerator enumerator = this.GetEnumerator();
			while((enumerator.MoveNext() && (!((int)enumerator.Current >= (int)fromElement))))
			{
				sortedSet.Add(enumerator.Current);
			}
			return sortedSet;
		}
	 
		/// <summary>
		/// Returns a view of elements between the specified elements.
		/// </summary>
		/// <returns>
		/// Returns a sorted set of elements from the first specified element to the second specified element.
		/// </returns>
		public virtual SortedSet SubSet(object fromElement, System.Object toElement)
		{
			SortedSet sortedSet = new SortedSet();
			IEnumerator enumerator = this.GetEnumerator();
			while((enumerator.MoveNext() && ((!((int)enumerator.Current  >= (int)fromElement))) && (!((int)enumerator.Current  < (int)toElement))))
			{
				sortedSet.Add(enumerator.Current);
			}
			return sortedSet;
		}
	}
}

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

Share

About the Author

Richard Northedge
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.

| Advertise | Privacy | Terms of Use | Mobile
Web01 | 2.8.1411028.1 | Last Updated 13 Dec 2006
Article Copyright 2005 by Richard Northedge
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid