All Projects β†’ fmmfonseca β†’ Completely

fmmfonseca / Completely

Licence: other
Java autocomplete library.

Programming Languages

java
68154 projects - #9 most used programming language

Projects that are alternatives of or similar to Completely

indicium
πŸ”Ž A simple in-memory search for collections and key-value stores.
Stars: ✭ 41 (-54.44%)
Mutual labels:  autocomplete, text
Bunny
BunnyJS - Lightweight native (vanilla) JavaScript (JS) and ECMAScript 6 (ES6) browser library, package of small stand-alone components without dependencies: FormData, upload, image preview, HTML5 validation, Autocomplete, Dropdown, Calendar, Datepicker, Ajax, Datatable, Pagination, URL, Template engine, Element positioning, smooth scrolling, routing, inversion of control and more. Simple syntax and architecture. Next generation jQuery and front-end framework. Documentation and examples available.
Stars: ✭ 473 (+425.56%)
Mutual labels:  library, autocomplete
React Spectrum
Generate colorful text placeholders 🎨
Stars: ✭ 289 (+221.11%)
Mutual labels:  library, text
Spannabletextview
SpannableTextView is a custom TextView which lets you customize the styling of slice of your text or statment via Spannables, but without the hassle of having to deal directly with Spannable themselves.
Stars: ✭ 177 (+96.67%)
Mutual labels:  library, text
Libgenerics
libgenerics is a minimalistic and generic library for C basic data structures.
Stars: ✭ 42 (-53.33%)
Mutual labels:  trie, library
Finalcut
A text-based widget toolkit
Stars: ✭ 244 (+171.11%)
Mutual labels:  library, text
Csconsoleformat
.NET C# library for advanced formatting of console output [Apache]
Stars: ✭ 296 (+228.89%)
Mutual labels:  library, text
Smartmaterialspinner
The powerful android spinner library for your application
Stars: ✭ 108 (+20%)
Mutual labels:  library, autocomplete
Text Minimap
Generate text minimap/preview using Braille Patterns
Stars: ✭ 21 (-76.67%)
Mutual labels:  library, text
Autosuggest Trie
Minimalistic trie implementation for autosuggest and autocomplete components
Stars: ✭ 22 (-75.56%)
Mutual labels:  trie, autocomplete
Codeeditor
Code Editor Native Way
Stars: ✭ 155 (+72.22%)
Mutual labels:  library, autocomplete
Thmap
Concurrent trie-hash map library
Stars: ✭ 51 (-43.33%)
Mutual labels:  trie, library
Baffle
A tiny javascript library for obfuscating and revealing text in DOM elements. 😲
Stars: ✭ 1,721 (+1812.22%)
Mutual labels:  library, text
Opends
Template Library of Data Structures in C++17
Stars: ✭ 151 (+67.78%)
Mutual labels:  trie, library
Dynamic Toasts
Custom toasts with color and icon for Android.
Stars: ✭ 132 (+46.67%)
Mutual labels:  library, text
Sensitive
ζ•ζ„Ÿθ―ζŸ₯ζ‰Ύ,ιͺŒθ―,θΏ‡ζ»€ε’Œζ›Ώζ’ πŸ€“ FindAll, Validate, Filter and Replace words.
Stars: ✭ 292 (+224.44%)
Mutual labels:  trie, text
Faster
Fast persistent recoverable log and key-value store + cache, in C# and C++.
Stars: ✭ 4,846 (+5284.44%)
Mutual labels:  indexing, library
Art
🎨 ASCII art library for Python
Stars: ✭ 1,026 (+1040%)
Mutual labels:  library, text
Flash
Golang Keyword extraction/replacement Datastructure using Tries instead of regexes
Stars: ✭ 79 (-12.22%)
Mutual labels:  trie, text
Functionalplus
Functional Programming Library for C++. Write concise and readable C++ code.
Stars: ✭ 1,286 (+1328.89%)
Mutual labels:  library

Description

Completely is a Java autocomplete library.

Autocomplete involves predicting a word or phrase that the user may type based on a partial query. The goal is to provide instant feedback and avoid unnecessary typing as the user formulates queries. Performance is a key issue since each keystroke from the user could invoke a query, and each query should be answered within a few milliseconds. What's more, because users often make spelling mistakes while typing, autocomplete should tolerate errors and differences in representation.

Needless to say, a standard sequential search is bound to be ineffective for anything other than small data sets. By contrast, Completely relies on text preprocessing to create an in-memory index for efficiently answering searches in large data sets. All in all, there are three fundamental components at play:

  • Analyzer function to filter, tokenize and/or transform text prior to indexing;
  • Index data structure for storing the mapping of text to the corresponding sources;
  • Automaton engine for text matching when searching;

Together these can used to tackle a variety of use cases, wherein the choice of components or combination thereof depends solely on the application at hand.

Download

All release artifacts are available for download from the Maven central repository.

Build from source

Building Completely requires Maven 3 and Java 11, or newer.

Download the source code:

git clone https://github.com/fmmfonseca/completely.git

Build the JAR package:

mvn clean package -DskipTests

Run the sample

Install artifacts to the local repository:

mvn install

Execute the main class:

mvn exec:java -pl sample

References

  • BoΕ™ivoj Melichar. Approximate String Matching by Finite Automata;
  • Gonzalo Navarro. A Guided Tour to Approximate String Matching;
  • Leonid Boytsov. Indexing Methods for Approximate Dictionary Searching: Comparative Analysis;
  • Marios Hadjieleftheriou and Divesh Srivastava. Approximate String Processing;
  • Surajit Chaudhuri and Raghav Kaushik. Extending Autocompletion To Tolerate Errors;

License

Released under The Apache Software License, Version 2.0

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].