Recent changes to Home

Home modified by OmniMark Code

OmniMark Code — Wed, 31 Jul 2013 21:36:40 -0000

--- v2
+++ v3
@@ -13,4 +13,6 @@

 Damerau–Levenshtein distance equals the minimum number of character deletions, insertions, replacements, and transpositions required to transform the target string into the input. The cost of each of the four transformations, if allowed, must be explicitly specified using the appropriate argument.

+The matching algorithm the library uses is quite naive and unoptimized. It is, however, fully streaming. The library is not restricted by line boundaries or any other record boundaries.
+
 The provided test program demonstrates the use of the function. It can operate in two modes: line-based matching and word-based matching. The latter is default. The program can take an arbitrary number of arguments. Every numeric argument is considered to specify the allowed distance to the following argument. The argument pair becomes one of the *goals*. All other command-line arguments are treated as input file names.

Home modified by OmniMark Code

OmniMark Code — Wed, 31 Jul 2013 21:07:56 -0000

--- v1
+++ v2
@@ -1,8 +1,16 @@
-Welcome to your wiki!
+The *fuzzy-matching* library provides an OmniMark module `omfuzzy.xmd` with the pattern function `fuzzy`:

-This is the default page, edit it as you see fit. To add a new page simply reference it within brackets, e.g.: [SamplePage].
+    export switch function
+       fuzzy               read-only  integer goals
+             distance      write-only integer best-distance
+             deletion      value      integer deletion-distance      optional
+             insertion     value      integer insertion-distance     optional
+             replacement   value      integer replacement-distance   optional
+             transposition value      integer transposition-distance optional

-The wiki uses [Markdown](/p/fuzzy-matching/wiki/markdown_syntax/) syntax.

-[[members limit=20]]
-[[download_button]]
+The function succeeds only if the input prefix approximately matches any of the keys in *goals*. Each `integer` value of the *goals* shelf items determines the allowed [Damerau–Levenshtein distance](http://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance) between its key and the input.
+
+Damerau–Levenshtein distance equals the minimum number of character deletions, insertions, replacements, and transpositions required to transform the target string into the input. The cost of each of the four transformations, if allowed, must be explicitly specified using the appropriate argument.
+
+The provided test program demonstrates the use of the function. It can operate in two modes: line-based matching and word-based matching. The latter is default. The program can take an arbitrary number of arguments. Every numeric argument is considered to specify the allowed distance to the following argument. The argument pair becomes one of the *goals*. All other command-line arguments are treated as input file names.

Discussion for Home page

OmniMark Code — Wed, 31 Jul 2013 21:05:10 -0000

The fuzzy-matching library provides an OmniMark module omfuzzy.xmd with the pattern function fuzzy:

export switch function
   fuzzy               read-only  integer goals
         distance      write-only integer best-distance
         deletion      value      integer deletion-distance      optional
         insertion     value      integer insertion-distance     optional
         replacement   value      integer replacement-distance   optional
         transposition value      integer transposition-distance optional
as

The function succeeds only if the input prefix approximately matches any of the keys in goals. Each integer value of
the goals shelf items determines the allowed Damerau–Levenshtein
distance between its key and the input.

Damerau–Levenshtein distance equals the minimum number of character deletions, insertions, replacements, and
transpositions required to transform the target string into the input. The cost of each of the four transformations, if
allowed, must be explicitly specified using the appropriate argument.

The provided test program demonstrates the use of the function. It can operate in two modes: line-based matching and
word-based matching. The latter is default. The program can take an arbitrary number of arguments. Every numeric argument is considered to specify the allowed distance to the following argument. The argument pair becomes one of the goals. All other command-line arguments are treated as input file names.

Home modified by OmniMark Code

OmniMark Code — Wed, 31 Jul 2013 19:47:24 -0000

Welcome to your wiki!

This is the default page, edit it as you see fit. To add a new page simply reference it within brackets, e.g.: [SamplePage].

The wiki uses Markdown syntax.

Project Members:

OmniMark Code (admin)