C# Class natix.SimilaritySearch.QStringSpace

String space

Inheritance: MetricDB

Public Properties

Property	Type	Description
CopyQGramsOnAccess	bool
ParseIntegers	bool
Q	int
TEXT	IList

Protected Properties

Property	Type	Description
numdist	long

Public Methods

Method	Description
Add ( object a ) : int
AsString ( IList L ) : string
AsString ( int docid ) : string
Build ( string outname, IList text, int sigma, int q, bool copy_on_access = true, bool parse_integers = false, ListIBuilder list_builder = null ) : void
Dice ( IList a, IList b ) : double	Hamming distance
Dist ( object a, object b ) : double	Wrapper to the real string distance
GetQGram ( int docid, int qlen ) : IList
Hamming ( IList a, IList b ) : double	Hamming distance for Generic Datatype
Intersection ( IList a, IList b ) : double	Knr Intersection distance
Jaccard ( IList a, IList b ) : double	Jaccard's distance
LCS ( IList a, IList b ) : double	LCS over Levenshtein
Levenshtein ( IList a, IList b ) : double	Edit distance
Levenshtein ( IList a, IList b, byte inscost, byte delcost, byte repcost ) : int	Levenshtein distance for generic datatype. It has customizable costs
LexicographicCompare ( IList a, IList b ) : int	lexicographic comparison, starting always at position 0 of every sequence
LexicographicCompare ( IList a, int aStart, int aEnd, IList b, int bStart, int bEnd ) : int	Compare to arrays lexicographically, returns an integer representing something like a - b
Load ( BinaryReader Input ) : void
Parse ( string s ) : object	Parse an string into the object representation
PrefixLength ( IList a, IList b ) : double	Knr prefix length distance
QStringSpace ( ) : System	Constructor
Save ( BinaryWriter Output ) : void
this ( int docid ) : object	Retrieves the object associated to object id docid

Private Methods

Method	Description
minimum3 ( int a, int b, int c ) : int

Method Details

Add() public method

public Add ( object a ) : int
a	object
return	int

AsString() public method

public AsString ( IList L ) : string
L	IList
return	string

AsString() public method

public AsString ( int docid ) : string
docid	int
return	string

Build() public method

public Build ( string outname, IList text, int sigma, int q, bool copy_on_access = true, bool parse_integers = false, ListIBuilder list_builder = null ) : void
outname	string
text	IList
sigma	int
q	int
copy_on_access	bool
parse_integers	bool
list_builder	ListIBuilder
return	void

Dice() public static method

Hamming distance

public static Dice ( IList a, IList b ) : double
a	IList
b	IList
return	double

Dist() public method

Wrapper to the real string distance

public Dist ( object a, object b ) : double
a	object
b	object
return	double

GetQGram() public method

public GetQGram ( int docid, int qlen ) : IList
docid	int
qlen	int
return	IList

Hamming() public static method

Hamming distance for Generic Datatype

public static Hamming ( IList a, IList b ) : double
a	IList
b	IList
return	double

Intersection() public static method

Knr Intersection distance

public static Intersection ( IList a, IList b ) : double
a	IList
b	IList
return	double

Jaccard() public static method

Jaccard's distance

public static Jaccard ( IList a, IList b ) : double
a	IList
b	IList
return	double

LCS() public static method

LCS over Levenshtein

public static LCS ( IList a, IList b ) : double
a	IList
b	IList
return	double

Levenshtein() public static method

Edit distance

public static Levenshtein ( IList a, IList b ) : double
a	IList
b	IList
return	double

Levenshtein() public static method

Levenshtein distance for generic datatype. It has customizable costs

public static Levenshtein ( IList a, IList b, byte inscost, byte delcost, byte repcost ) : int
a	IList
b	IList
inscost	byte
delcost	byte
repcost	byte
return	int

LexicographicCompare() public static method

lexicographic comparison, starting always at position 0 of every sequence

public static LexicographicCompare ( IList a, IList b ) : int
a	IList
b	IList
return	int

LexicographicCompare() public static method

Compare to arrays lexicographically, returns an integer representing something like a - b

public static LexicographicCompare ( IList a, int aStart, int aEnd, IList b, int bStart, int bEnd ) : int
a	IList
aStart	int
aEnd	int
b	IList
bStart	int
bEnd	int
return	int

Load() public method

public Load ( BinaryReader Input ) : void
Input	System.IO.BinaryReader
return	void

Parse() public method

Parse an string into the object representation

public Parse ( string s ) : object
s	string
return	object

PrefixLength() public static method

Knr prefix length distance

public static PrefixLength ( IList a, IList b ) : double
a	IList
b	IList
return	double

QStringSpace() public method

Constructor

public QStringSpace ( ) : System
return	System

Save() public method

public Save ( BinaryWriter Output ) : void
Output	System.IO.BinaryWriter
return	void

this() public method

Retrieves the object associated to object id docid

public this ( int docid ) : object
docid	int
return	object

Property Details

CopyQGramsOnAccess public_oe property

public bool CopyQGramsOnAccess
return	bool

ParseIntegers public_oe property

public bool ParseIntegers
return	bool

Q public_oe property

The length of each element

public int Q
return	int

TEXT public_oe property

public IList TEXT
return	IList

numdist protected_oe property

protected long numdist
return	long