diff --git a/README.md b/README.md index bb0f76b..8301a1b 100644 --- a/README.md +++ b/README.md @@ -16,7 +16,7 @@

Web's fastest and most memory-flexible full-text search library with zero dependencies.

When it comes to raw search speed FlexSearch outperforms every single searching library out there and also provides flexible search capabilities like multi-word matching, phonetic transformations or partial matching. -Depending on the used options it also providing the most memory-efficient index. Keep in mind that updating and/or removing existing items from the index has a significant cost. When your index needs to be updated very often then BulkSearch may be a better choice. +Depending on the used options it also providing the most memory-efficient index. Keep in mind that updating and/or removing existing items from the index has a significant cost. When your index needs to be updated very often then BulkSearch may be a better choice. FlexSearch also provides you a non-blocking asynchronous processing model as well as web workers to perform any updates or queries on the index in parallel through dedicated balanced threads. Installation Guide  •  API Reference  •  Example Options  •  Custom Builds  •  Flexsearch Server @@ -86,7 +86,7 @@ All Features: - Async Processing + Async Search x x @@ -388,7 +388,7 @@ In this way contextual search

-__Note:__ This feature is actually not enabled by default. Read
here how to enable. +__Note:__ This feature is actually not enabled by default. Read here how to enable. #### Compare BulkSearch vs. FlexSearch @@ -426,7 +426,7 @@ __Note:__ This feature is actually not enabled by default. Read + @@ -610,6 +610,7 @@ Limit the result: index.search("John", 10); ``` + #### Async Search Perform queries asynchronously: @@ -1067,7 +1068,7 @@ FlexSearch ist highly customizable. Make use of the the righ tokenize




"strict"
- "foward"
+ "forward"
"reverse"
"full"
@@ -1209,7 +1210,7 @@ Tokenizer effects the required memory also as query time and flexibility of part --> - "foward" + "forward" incrementally index words in forward direction foobar
foobar
* n @@ -1563,7 +1564,7 @@ Compare these presets: __Split Complexity__ -Whenenver you can, try to divide content by categories and add them to its own index, e.g.: +Whenever you can, try to divide content by categories and add them to its own index, e.g.: ```js var feeds_2017 = new FlexSearch(); var feeds_2018 = new FlexSearch();