Finds the compound words in text and puts them in subwords, set subwords to null/nothing to just find if text has compound word formation.
Declaration Syntax
C# | C# | Visual Basic | Visual Basic | Visual C++ | Visual C++ | F# | F# |
public virtual bool FindCompoundWords( string text, IList subwords, bool lengthLimit )
public virtual bool FindCompoundWords( string text, IList subwords, bool lengthLimit )
Public Overridable Function FindCompoundWords ( text As String, subwords As IList, lengthLimit As Boolean ) As Boolean
Public Overridable Function FindCompoundWords ( text As String, subwords As IList, lengthLimit As Boolean ) As Boolean
public: virtual bool FindCompoundWords( String^ text, IList^ subwords, bool lengthLimit )
public: virtual bool FindCompoundWords( String^ text, IList^ subwords, bool lengthLimit )
abstract FindCompoundWords : text : string * subwords : IList * lengthLimit : bool -> bool override FindCompoundWords : text : string * subwords : IList * lengthLimit : bool -> bool
abstract FindCompoundWords : text : string * subwords : IList * lengthLimit : bool -> bool override FindCompoundWords : text : string * subwords : IList * lengthLimit : bool -> bool
Return Value
Remarks
Only adds words to list if all are valid. In other words, this will not find all words that
are part of text, but only the words that all make up text.
Eg. "catchmentarea" has words "catchment" and "area" but not "cat", "me" etc.
The order of the words in the list is the reverse of their order in text. Exceptions
Exception | Condition |
---|---|
ArgumentNullException | if text is null |
Assembly: Keyoti.RapidSpell.NET4 (Module: Keyoti.RapidSpell.NET4.dll) Version: 6.2.21.412