This is an automated email from the ASF dual-hosted git repository.
bridgetb pushed a commit to branch asf-site
in repository https://gitbox.apache.org/repos/asf/drill-site.git
The following commit(s) were added to refs/heads/asf-site by this push:
new 4737419 doc edits
4737419 is described below
commit 47374191490df2736ad8cbb2d76776fbf24b28b4
Author: Bridget Bevens <[email protected]>
AuthorDate: Wed Jul 18 16:44:25 2018 -0700
doc edits
---
docs/phonetic-functions/index.html | 37 +++++++++++++------------
docs/string-distance-functions/index.html | 45 +++++++++++--------------------
feed.xml | 4 +--
3 files changed, 37 insertions(+), 49 deletions(-)
diff --git a/docs/phonetic-functions/index.html
b/docs/phonetic-functions/index.html
index bb2f662..b19ac81 100644
--- a/docs/phonetic-functions/index.html
+++ b/docs/phonetic-functions/index.html
@@ -1244,7 +1244,7 @@
</div>
- Jul 17, 2018
+ Jul 18, 2018
<link href="/css/docpage.css" rel="stylesheet" type="text/css">
@@ -1255,22 +1255,23 @@
<p>Drill supports the following phonetic matching functions that map text to a
number or string based on how a word sounds: </p>
<ul>
-<li><code>caverphone1(string)</code><br></li>
-<li><code>caverphone2(string)</code><br></li>
-<li><code>cologne_phonetic(string)</code><br></li>
-<li><code>dm_soundex(string)</code><br></li>
-<li><code>double_metaphone(string)</code><br></li>
-<li><code>match_rating_encoder(string)</code><br></li>
-<li><code>metaphone(string)</code><br></li>
-<li><code>nysiis(string)</code><br></li>
-<li><code>refined_soundex(string)</code><br></li>
-<li><code>soundex(string)</code><br></li>
+<li><a
href="/docs/phonetic-functions/#caverphone1(string)"><code>caverphone1(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#caverphone2(string)"><code>caverphone2(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#cologne_phonetic(string)"><code>cologne_phonetic(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#dm_soundex(string)"><code>dm_soundex(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#double_metaphone(string)"><code>double_metaphone(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#match_rating_encoder(string)"><code>match_rating_encoder(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#metaphone(string)"><code>metaphone(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#nysiis(string)"><code>nysiis(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#refined_soundex(string)"><code>refined_soundex(string)</code></a><br></li>
+<li><a
href="/docs/phonetic-functions/#soundex(string)"><code>soundex(string)</code></a><br></li>
</ul>
<h2 id="syntax">Syntax</h2>
-<div class="highlight"><pre><code class="language-text"
data-lang="text">SELECT <phonetic-function>(string) FROM…
-
-//Usage example: SELECT match_rating_encoder('Boston') AS MR FROM
(VALUES(1));
+<div class="highlight"><pre><code class="language-text"
data-lang="text">SELECT <phonetic-function>(string) FROM…
+</code></pre></div>
+<h2 id="usage-example">Usage Example</h2>
+<div class="highlight"><pre><code class="language-text"
data-lang="text">SELECT match_rating_encoder('Boston') AS MR FROM
(VALUES(1));
</code></pre></div>
<h2 id="function-descriptions">Function Descriptions</h2>
@@ -1313,9 +1314,11 @@
<h3 id="nysiis(string)">nysiis(string)</h3>
-<p>Encodes a string into a NYSIIS value. NYSIIS is an encoding used to relate
similar names, but can also be used as a general purpose scheme to find word
with similar phonemes. The New York State Identification and Intelligence
System Phonetic Code, commonly known as NYSIIS, is a phonetic algorithm devised
in 1970 as part of the New York State Identification and Intelligence System
(now a part of the New York State Division of Criminal Justice Services). It
features an accuracy increase [...]
-refined_soundex(string)
-Encodes a string into a Refined Soundex value. Soundex is an encoding used to
relate similar names, but can also be used as a general purpose scheme to find
word with similar phonemes. </p>
+<p>Encodes a string into a NYSIIS value. NYSIIS is an encoding used to relate
similar names, but can also be used as a general purpose scheme to find word
with similar phonemes. The New York State Identification and Intelligence
System Phonetic Code, commonly known as NYSIIS, is a phonetic algorithm devised
in 1970 as part of the New York State Identification and Intelligence System
(now a part of the New York State Division of Criminal Justice Services). It
features an accuracy increase [...]
+
+<h3 id="refined_soundex(string)">refined_soundex(string)</h3>
+
+<p>Encodes a string into a Refined Soundex value. Soundex is an encoding used
to relate similar names, but can also be used as a general purpose scheme to
find a word with similar phonemes. </p>
<h3 id="soundex(string)">soundex(string)</h3>
diff --git a/docs/string-distance-functions/index.html
b/docs/string-distance-functions/index.html
index 3d584ab..d85d225 100644
--- a/docs/string-distance-functions/index.html
+++ b/docs/string-distance-functions/index.html
@@ -1244,7 +1244,7 @@
</div>
- Jul 17, 2018
+ Jul 18, 2018
<link href="/css/docpage.css" rel="stylesheet" type="text/css">
@@ -1253,61 +1253,49 @@
<p>String distance functions measure the difference between two
strings. Starting in version 1.14, Drill supports the following string distance
functions: </p>
<ul>
-<li><code>cosine_distance(string1,string2)</code></li>
-<li><code>fuzzy_score(string1,string2)</code></li>
-<li><code>hamming_distance(string1,string2)</code></li>
-<li><code>jaccard_distance(string1,string2)</code></li>
-<li><code>jaro_distance(string1,string2)</code></li>
-<li><code>levenshtein_distance(string1,string2)</code></li>
-<li><code>longest_common_substring_distance(string1,string2)</code><br></li>
+<li><a
href="/docs/string-distance-functions/#cosine_distance(string1,string2)"><code>cosine_distance(string1,string2)</code></a></li>
+<li><a
href="/docs/string-distance-functions/#fuzzy_score(string1,string2)"><code>fuzzy_score(string1,string2)</code></a></li>
+<li><a
href="/docs/string-distance-functions/#hamming_distance-(string1,string2)"><code>hamming_distance(string1,string2)</code></a></li>
+<li><a
href="/docs/string-distance-functions/#jaccard_distance-(string1,string2)"><code>jaccard_distance(string1,string2)</code></a></li>
+<li><a
href="/docs/string-distance-functions/#jaro_distance-(string1,string2)"><code>jaro_distance(string1,string2)</code></a></li>
+<li><a
href="/docs/string-distance-functions/#levenshtein_distance-(string1,string2)"><code>levenshtein_distance(string1,string2)</code></a></li>
+<li><a
href="/docs/string-distance-functions/#longest_common_substring_distance(string1,string2)"><code>longest_common_substring_distance(string1,string2)</code></a><br></li>
</ul>
+<h2 id="syntax">Syntax</h2>
+<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT <string-distance-function>( string1, string2 ) FROM…
+</code></pre></div>
+<h2 id="example-usage">Example Usage</h2>
+<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT fuzzy_score( string1, string2 ) AS fuzzy_score FROM…
+</code></pre></div>
<h2 id="function-descriptions">Function Descriptions</h2>
-<p>The following sections describe each of the phonetic functions that Drill
supports. </p>
+<p>The following sections describe each of the string distance functions that
Drill supports. </p>
<h3 id="cosine_distance(string1,string2)">cosine_distance(string1,string2)</h3>
<p>Calculates the cosine distance between two strings. </p>
-<p><strong>Usage Example</strong></p>
-<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT cosine_distance( string1, string2 ) AS cosine_distance FROM…
-</code></pre></div>
<h3 id="fuzzy_score(string1,string2)">fuzzy_score(string1,string2)</h3>
<p>Calculates the cosine distance between two strings. A matching algorithm
that is similar to the searching algorithms implemented in editors such as
Sublime Text, TextMate, Atom, and others. One point is given for every matched
character. Subsequent matches yield two bonus points. A higher score indicates
a higher similarity. </p>
-<p><strong>Usage Example</strong> </p>
-<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT fuzzy_score( string1, string2 ) AS fuzzy_score FROM…
-</code></pre></div>
<h3 id="hamming_distance-(string1,string2)">hamming_distance
(string1,string2)</h3>
<p>The hamming distance between two strings of equal length is the number of
positions at which the corresponding symbols are different. For further
explanation about the Hamming Distance, refer to <a
href="http://en.wikipedia.org/wiki/Hamming_distance";>http://en.wikipedia.org/wiki/Hamming_distance</a>.
</p>
-<p><strong>Usage Example</strong> </p>
-<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT hamming_distance( string1, string2 ) FROM…
-</code></pre></div>
<h3 id="jaccard_distance-(string1,string2)">jaccard_distance
(string1,string2)</h3>
<p>Measures the Jaccard distance of two sets of character sequence. <a
href="https://en.wikipedia.org/wiki/Jaccard_index";>Jaccard distance</a> is the
dissimilarity between two sets. It is the complementary of Jaccard similarity.
</p>
-<p><strong>Usage Example</strong></p>
-<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT jaccard_distance( string1, string2 ) FROM …
-</code></pre></div>
<h3 id="jaro_distance-(string1,string2)">jaro_distance (string1,string2)</h3>
<p>A similarity algorithm indicating the percentage of matched characters
between two character sequences. The Jaro measure is the weighted sum of
percentage of matched characters from each file and transposed characters.
Winkler increased this measure for matching initial characters. This
implementation is based on the <a
href="https://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance";>Jaro Winkler
similarity algorithm</a>. </p>
-<p><strong>Usage Example</strong> </p>
-<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT jaro_distance( string1, string2 ) FROM…
-</code></pre></div>
<h3 id="levenshtein_distance-(string1,string2)">levenshtein_distance
(string1,string2)</h3>
<p>An algorithm for measuring the difference between two character sequences.
This is the number of changes needed to change one sequence into another, where
each change is a single character modification (deletion, insertion, or
substitution).</p>
-<p><strong>Usage Example</strong> </p>
-<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT levenshtein_distance( string1, string2 ) FROM...
-</code></pre></div>
<h3
id="longest_common_substring_distance(string1,string2)">longest_common_substring_distance(string1,string2)</h3>
<p>Returns the length of the longest sub-sequence that two strings have in
common.
@@ -1316,9 +1304,6 @@ Two strings that are entirely different, return a value
of 0, and two strings th
<p><strong>Note:</strong> Generally this algorithm is fairly inefficient, as
for length m, n of the input
CharSequence's left and right respectively, the runtime of the algorithm
is O(m*n). </p>
-<p><strong>Usage Example</strong> </p>
-<div class="highlight"><pre><code class="language-text" data-lang="text">
SELECT longest_common_substring_distance( string1, string2 ) FROM...
-</code></pre></div>
<div class="doc-nav">
diff --git a/feed.xml b/feed.xml
index e09dce9..86b7d2e 100644
--- a/feed.xml
+++ b/feed.xml
@@ -6,8 +6,8 @@
</description>
<link>/</link>
<atom:link href="/feed.xml" rel="self" type="application/rss+xml"/>
- <pubDate>Wed, 18 Jul 2018 16:08:28 -0700</pubDate>
- <lastBuildDate>Wed, 18 Jul 2018 16:08:28 -0700</lastBuildDate>
+ <pubDate>Wed, 18 Jul 2018 16:42:41 -0700</pubDate>
+ <lastBuildDate>Wed, 18 Jul 2018 16:42:41 -0700</lastBuildDate>
<generator>Jekyll v2.5.2</generator>
<item>
