C# Класс LevenshteinAutomaton.SpellChecker

Spell Checker uses the Levenshtein automaton and FB-Trie algorithm to find possible corrections for the given garbled word

Открытые методы

Метод	Описание
AddWord ( string word ) : void	Append new word to the dictionary
GetCorrections1T ( string typo ) : IList	Gets the corrections for edit distance 1 with transpositions.
GetCorrections2T ( string typo ) : IList	Gets the corrections for edit distance 2 with transpositions.
SpellChecker ( ) : System	Initializes a new instance for empty lexicon
SpellChecker ( IEnumerable words ) : System	Initializes a new instance for the given lexicon

Метод	Описание
GetCorrectionNodes ( string typo, TrieNode start, int editDistance, bool includeOnlyWords = true ) : IList	Basic Schulz and Mihov algoritm
GetCorrectionStrings ( string typo, TrieNode start, int editDistance ) : IEnumerable	Find all words in dictionary such that Levenshtein distance to typo less or equal to editDistance
PrepareSubstrings ( string typo, string &left, string &right, string &rleft, string &rright ) : int	Splits the typo into two substrings of similar length

Append new word to the dictionary

public AddWord ( string word ) : void
word	string	Word.
Результат	void

Gets the corrections for edit distance 1 with transpositions.

public GetCorrections1T ( string typo ) : IList
typo	string	Garbled word.
Результат	IList

Gets the corrections for edit distance 2 with transpositions.

public GetCorrections2T ( string typo ) : IList
typo	string	Garbled word.
Результат	IList

Initializes a new instance for empty lexicon

public SpellChecker ( ) : System
Результат	System

Initializes a new instance for the given lexicon

public SpellChecker ( IEnumerable words ) : System
words	IEnumerable
Результат	System