On 03/04/13 08:23, Kjell Rilbe wrote: > Den 2013-04-03 09:09 skrev Alex Peshkoff såhär: >> On 04/03/13 01:44, Thomas Beckmann wrote: >>> Second: I'd like to have this like a plugin architecture, >> The most simple requirement - just write UDF (or in FB3 external >> function). No other plugins are needed. > > I think that Thomas meant was a phonetic matching function that can be > configured in a way similar to collations, i.e. for this language, use > these phonetic rules. No programming, just config. But can phonetic > rules be logically described in a simple way like that or are the > languages so complex that programming is easier than defining "rules"? > Just to throw a little something into the mix.
The average person typically uses a vocabulary of 20,000 words. I was shocked. Apparently, with a rules-list of only *30* rules, a "text to speech" engine has an accurate vocabulary of the 50,000 most common truly English words! So the approach you might like to take is for each language to have a rule-set for its native vocabulary, and an exceptions list for foreign words. So, for example, the English rule set would list "Einstein" as an exception, with a pointer to the German rules. Cheers, Wol ------------------------------------------------------------------------------ Minimize network downtime and maximize team effectiveness. Reduce network management and security costs.Learn how to hire the most talented Cisco Certified professionals. Visit the Employer Resources Portal http://www.cisco.com/web/learning/employer_resources/index.html Firebird-Devel mailing list, web interface at https://lists.sourceforge.net/lists/listinfo/firebird-devel
