Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/dictionary_8cpp_source.html below:

NCBI C++ ToolKit: src/util/dictionary.cpp Source File

: m_MetaphoneKeySize(meta_key_size)

: m_MetaphoneKeySize(meta_key_size)

: m_MetaphoneKeySize(meta_key_size)

string::size_type pos = line.find_first_of(

);

(pos == string::npos) {

metaphone = line.substr(0, pos);

word = line.substr(pos + 1, line.length() - pos - 1);

word_set.

(word_set.

(), word);

ostr << iter->first <<

<< *word_iter << endl;

max_alts)

list<TReverseDict::const_iterator> keys;

(list<TReverseDict::const_iterator>, key_iter, keys) {

*set_iter, (*key_iter)->first);

(alt.

<= 0) {

<< metaphone <<

<< (*key_iter)->first

<<

<< word <<

<< *set_iter

<<

<< alt.

<<

);

+= used ? 1 : 0;

<< keys.size() <<

<<

<<

);

( !words.empty() ) {

TAltSet::const_iterator iter = words.begin();

alts.push_back(*iter);

TAltSet::const_iterator

= iter;

iter != words.end() &&

(alts.size() < max_alts ||

->score == iter->score);

alts.push_back(*iter);

alternates.insert(alternates.end(), alts.begin(), alts.end());

list<TReverseDict::const_iterator>& keys)

( !metaphone.length() ) {

max_meta_edit_dist = 1;

string::const_iterator iter = metaphone.begin();

string::const_iterator end = iter + max_meta_edit_dist + 1;

(

<< metaphone);

( ; iter != end; ++iter) {

(1, *iter);

++lower, ++

) {

(dist > max_meta_edit_dist) {

keys.push_back(lower);

(

<<

<<

<< keys.size());

( iter->dict->CheckWord(word) ) {

max_alts)

iter->dict->SuggestAlternates(word, alts, max_alts);

(alts.size() > max_alts) {

TAlternates::iterator

= alts.begin() + max_alts;

TAlternates::iterator iter =

;

( ; iter != alts.end() && iter->score ==

->score; ++iter) {

alts.erase(iter, alts.end());

alternates.swap(alts);

max_alts)

alternates = iter->second;

bool CheckWord(const string &word) const

Virtual requirement: check a word for existence in the dictionary.

void SuggestAlternates(const string &word, TAlternates &alternates, size_t max_alternates=20) const

Scan for a list of words similar to the indicated word.

CCachedDictionary(IDictionary &dict)

CRef< IDictionary > m_Dict

static size_t GetEditDistance(const string &str1, const string &str2, EDistanceMethod method=eEditDistance_Exact)

static int Score(const string &word1, const string &word2, size_t max_metaphone=eMaxMetaphone)

Compute a nearness score for two different words or phrases.

EDistanceMethod

Return the Levenshtein edit distance between two words.

@ eEditDistance_Similar

This method performs a simpler search, looking for the distance between similar words.

static void GetMetaphone(const string &in, string *out, size_t max_chars=eMaxMetaphone)

Compute the Metaphone key for a given word Metaphone is a more advanced algorithm than Soundex; inste...

TDictionaries m_Dictionaries

void RegisterDictionary(IDictionary &dict, int priority=ePriority_Default)

void SuggestAlternates(const string &word, TAlternates &alternates, size_t max_alternates=20) const

Scan for a list of words similar to the indicated word.

bool CheckWord(const string &word) const

Virtual requirement: check a word for existence in the dictionary.

vector< SDictionary > TDictionaries

void x_GetMetaphoneKeys(const string &metaphone, list< TReverseDict::const_iterator > &keys) const

void SuggestAlternates(const string &word, TAlternates &alternates, size_t max_alternates=20) const

Scan for a list of words similar to the indicated word.

void Read(CNcbiIstream &istr)

bool CheckWord(const string &word) const

Virtual requirement: check a word for existence in the dictionary.

CSimpleDictionary(size_t metaphone_key_size=5)

void Write(CNcbiOstream &ostr) const

void AddWord(const string &str)

Add a word to the dictionary.

TReverseDict m_ReverseDict

TForwardDict m_ForwardDict

const size_t m_MetaphoneKeySize

the size of our metaphone keys

class IDictionary defines an abstract interface for dictionaries.

vector< SAlternate > TAlternates

virtual bool CheckWord(const string &word) const =0

Virtual requirement: check a word for existence in the dictionary.

virtual void SuggestAlternates(const string &word, TAlternates &alternates, size_t max_alternates=20) const =0

Scan for a list of words similar to the indicated word.

container_type::const_iterator const_iterator

container_type::iterator iterator

const_iterator end() const

const_iterator lower_bound(const key_type &key) const

iterator_bool insert(const value_type &val)

const_iterator find(const key_type &key) const

iterator_bool insert(const value_type &val)

const_iterator find(const key_type &key) const

const_iterator end() const

parent_type::const_iterator const_iterator

static DLIST_TYPE *DLIST_NAME() prev(DLIST_LIST_TYPE *list, DLIST_TYPE *item)

#define ITERATE(Type, Var, Cont)

ITERATE macro to sequence through container elements.

void Reset(void)

Reset reference object.

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

CNcbiIstream & NcbiGetlineEOL(CNcbiIstream &is, string &str, string::size_type *count=NULL)

Read from "is" to "str" the next line (taking into account platform specifics of End-of-Line)

IO_PREFIX::ostream CNcbiOstream

Portable alias for ostream.

IO_PREFIX::istream CNcbiIstream

Portable alias for istream.

IO_PREFIX::ifstream CNcbiIfstream

Portable alias for ifstream.

constexpr auto sort(_Init &&init)

SAlternate wraps a word and its score.

functor for sorting alternates list by score

bool operator()(const CMultiDictionary::SDictionary &d1, const CMultiDictionary::SDictionary &d2) const

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4