C# Class natix.SimilaritySearch.QStringSpace

String space
Inheritance: MetricDB
Afficher le fichier Open project: sadit/natix

Méthodes publiques

Свойство Type Description
CopyQGramsOnAccess bool
ParseIntegers bool
Q int
TEXT IList

Protected Properties

Свойство Type Description
numdist long

Méthodes publiques

Méthode 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

Méthode Description
minimum3 ( int a, int b, int c ) : int

Method Details

Add() public méthode

public Add ( object a ) : int
a object
Résultat int

AsString() public méthode

public AsString ( IList L ) : string
L IList
Résultat string

AsString() public méthode

public AsString ( int docid ) : string
docid int
Résultat string

Build() public méthode

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
Résultat void

Dice() public static méthode

Hamming distance
public static Dice ( IList a, IList b ) : double
a IList
b IList
Résultat double

Dist() public méthode

Wrapper to the real string distance
public Dist ( object a, object b ) : double
a object
b object
Résultat double

GetQGram() public méthode

public GetQGram ( int docid, int qlen ) : IList
docid int
qlen int
Résultat IList

Hamming() public static méthode

Hamming distance for Generic Datatype
public static Hamming ( IList a, IList b ) : double
a IList
b IList
Résultat double

Intersection() public static méthode

Knr Intersection distance
public static Intersection ( IList a, IList b ) : double
a IList
b IList
Résultat double

Jaccard() public static méthode

Jaccard's distance
public static Jaccard ( IList a, IList b ) : double
a IList
b IList
Résultat double

LCS() public static méthode

LCS over Levenshtein
public static LCS ( IList a, IList b ) : double
a IList
b IList
Résultat double

Levenshtein() public static méthode

Edit distance
public static Levenshtein ( IList a, IList b ) : double
a IList
b IList
Résultat double

Levenshtein() public static méthode

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
Résultat int

LexicographicCompare() public static méthode

lexicographic comparison, starting always at position 0 of every sequence
public static LexicographicCompare ( IList a, IList b ) : int
a IList
b IList
Résultat int

LexicographicCompare() public static méthode

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
Résultat int

Load() public méthode

public Load ( BinaryReader Input ) : void
Input System.IO.BinaryReader
Résultat void

Parse() public méthode

Parse an string into the object representation
public Parse ( string s ) : object
s string
Résultat object

PrefixLength() public static méthode

Knr prefix length distance
public static PrefixLength ( IList a, IList b ) : double
a IList
b IList
Résultat double

QStringSpace() public méthode

Constructor
public QStringSpace ( ) : System
Résultat System

Save() public méthode

public Save ( BinaryWriter Output ) : void
Output System.IO.BinaryWriter
Résultat void

this() public méthode

Retrieves the object associated to object id docid
public this ( int docid ) : object
docid int
Résultat object

Property Details

CopyQGramsOnAccess public_oe property

public bool CopyQGramsOnAccess
Résultat bool

ParseIntegers public_oe property

public bool ParseIntegers
Résultat bool

Q public_oe property

The length of each element
public int Q
Résultat int

TEXT public_oe property

public IList TEXT
Résultat IList

numdist protected_oe property

protected long numdist
Résultat long