Changes

Please note that scoring propagation was removed with {{Mark|Version 9.5}}. The following expressions will now yield {{Code|0}}: <syntaxhighlight lang="xquery">let $string := 'a b'return ft:score($string contains text 'a' and $string contains text 'b'), for $n score $s in db:open('factbook')//religions[text() contains text 'orthodox']order by $s descendingreturn $s || ': ' || $n</syntaxhighlight> Scoring is still supported within full-text expressions, by {{Function|Full-Text|ft:search}}, and by simple predicate tests that can be rewritten to {{Function|Full-Text|ft:search}}:

BaseX supports One or more thesaurus files can be specified in a full-text queries using thesauri, but it does not provide a default thesaurusexpression. This is why queries such asThe following query returns {{Code|false}}:

'computershardware' contains text 'hardwarecomputers'

will return <code>false</code>. However, if If a thesaurus is specified, then the result will be <code>true</code>: <syntaxhighlight lang="xquery">'computers' contains text 'hardware' using thesaurus at 'thesaurus.xml'</syntaxhighlight> ; Thesaurus documentemployed…

The format of the …the result will be {{Code|true}}: <syntaxhighlight lang="xquery">'hardware' contains text 'computers' using thesaurus at 'thesaurus .xml'</syntaxhighlight> Thesaurus files must be the same as the format of the thesauri provided by comply with the [https://dev.w3.org/2007/xpath-full-text-10-test-suite XQuery and XPath Full Text 1/TestSuiteStagingArea/TestSources/thesaurus.0 xsd XSD Schema] of the XQFT Test Suite(but the namespace can be omitted). Apart from the relationship defined in [https://www.iso.org/standard/7776.html ISO 2788](NT: narrower team, RT: related term, etc. It is an XML with structure defined by an ), custom relationships can be used. The type of relationship and the level depth can be specified as well: <syntaxhighlight lang="xquery">(: BT: find broader terms; NT means narrower term :)'computers' contains text 'hardware' using thesaurus at 'x.xml' relationship 'BT' from 1 to 10 levels</syntaxhighlight> More details can be found in the [https://devwww.w3.org/2007TR/xpath-full-text-10-test-suite/TestSuiteStagingArea/TestSources/thesaurus.xsd XSD Schema#ftthesaurusoption specification].

Fuzzy search is based on the Levenshtein distance. The maximum number of allowed errors is calculated by dividing the token length of a specified query term by 4, preserving a minimum of 1 errors. The query above yields two results as there is no error between the query term “house” and the text node “house”, and one error between “house” and “hous”.