Public

Creates a new Dictionary containing the information read from the provided
InputStreams to hunspell 

<init>

affixFST

applyMappings

folds single character (according to LANG if present)

caseFold

cleanInput

decodeFlags

encodeFlags

escapeDash

getAliasValue

Parses the encoding specified in the affix file readable through the provided
InputStream

getDictionaryEncoding

Determines the appropriate FlagParsingStrategy based on the FLAG definition line
taken from the affi

getFlagParsingStrategy

Retrieves the CharsetDecoder for the given encoding. Note, This isn't perfect as
I think ISCII-DEVAN

getJavaEncoding

getStemException

hasFlag

indexOfSpaceOrTab

lookup

Looks up Hunspell word forms from the dictionary

lookupWord

morphBoundary

Parses a specific affix rule putting the result into the provided affix map

parseAffix

parseAlias

Dictionary

Making http requests using okhttp

A Uniform Resource Identifier that identifies an abstract or physical resource,
as specified by RFC 

java.net.URI

An exception that indicates a failed JDBC operation. It provides the following
information about pro

java.sql.SQLException

TreeSet is an implementation of SortedSet. All optional operations (adding and
removing) are support

java.util.TreeSet

UUID is an immutable representation of a 128-bit universally unique identifier
(UUID). There are mul

java.util.UUID

javax.swing.JFrame

org.hibernate.mapping.Table

requestLocationUpdates

setContentView

getExternalFilesDir

// we are looking for a case variant, but this word does not allow it

// we can't add this form, it's a pseudostem requiring an affix

// we can't add this form, it only belongs inside a compound word

/**
   * Applies the affix rule to the given word, producing a list of stems if any are found
   *
   * @param strippedWord Word the affix has been removed and the strip added
   * @param length valid length of stripped word
   * @param affix HunspellAffix representing the affix rule itself
   * @param prefixFlag when we already stripped a prefix, we cant simply recurse and check the suffix, unless both are compatible
   *                   so we must check dictionary form against both to add it as a stem!
   * @param recursionDepth current recursion depth
   * @param prefix true if we are removing a prefix (false if it's a suffix)
   * @return List of stems for the word, or an empty list if none are found
   */

// TODO: just pass this in from before, no need to decode it twice

// confusing: in this one exception, we already chained the first prefix against the second,

// so it doesnt need to be checked against the word

// see if we can chain prefix thru the suffix continuation class (only if it has any!)

// if circumfix was previously set by a prefix, we must check this suffix,

// if a circumfix flag is defined in the dictionary, and we are a prefix, we need to check if we have that flag

// COMPLEXPREFIXES = true:  combine with a second prefix and another suffix 

// COMPLEXPREFIXES = false: combine with a suffix

// COMPLEXPREFIXES = true: we don't recurse! only one suffix allowed

// COMPLEXPREFIXES = false: combine with another suffix

// we took away the second prefix: go look for another suffix

How to use lookupWordmethodin org.apache.lucene.analysis.hunspell.Dictionary

Best Java code snippets using org.apache.lucene.analysis.hunspell.Dictionary.lookupWord (Showing top 4 results out of 315)

How to use
lookupWord
method
in
org.apache.lucene.analysis.hunspell.Dictionary