Class WordAlgorithms
Class containing various word algorithms
[Version(1, 0, 0)]
public static class WordAlgorithms
- Inheritance
-
WordAlgorithms
- Inherited Members
Methods
- HammingDistance(Word, Word)
Calculates the hamming distance between two pre-split words using a given alphabet.
- HammingDistanceImpl(Word, Word)
Calculates the hamming distance between two strings using a given alphabet.
- LargestCommonSubstring(Word, Word)
Returns the longests substrings of two strings as a list of letters.
- LargestOverlap(Word, Word)
Find the largest overlap shared between two words. An overlap is a sufffix of the left word that is equal to a prefix of the right word. This operation is not symmetric.
LargestOverlap([smokey], [keys]) is [key], but LargestOverlap([keys], [smokey]) is [s]
- LevenshteinDistance(Word, Word)
Calculates the edit distance between two strings using the given alphabet
- MutateWord(Word, IWordDictionary, IRandom)
Mutates a word to ensure a that no substrings are valid words
- MutateWord(Word, int, IWordAlphabet, IRandom)
Mutates a word to ensure a specific edit distance. Can add, remove, and mutate letters
- MutateWord(Word, int, IWordDictionary, IRandom)
Mutates a word to ensure a that no substrings are valid words
- MutateWord(Word, int, int, IWordAlphabet, IRandom)
Mutates a word to ensure a specific edit distance. Can add, remove, and mutate letters
- ShuffleWord(Word, int, IRandom)
Shuffle the letters of a word and ensure a minimum hamming distance