Skip to content

Commit

Permalink
Released v0.9.3
Browse files Browse the repository at this point in the history
  • Loading branch information
Abhishek Singh committed Jun 17, 2018
1 parent 6e03c21 commit 4d11f54
Showing 1 changed file with 8 additions and 9 deletions.
17 changes: 8 additions & 9 deletions README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -30,15 +30,14 @@ pip install lexpy

# Interface

| **Interface Description** | **Trie** method | **DAWG** method | Notes |
|------------------------------------------------------------------------------------------------------------------------------- |------------------------------------------- |------------------------------------------- |------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Add a single word | `add('apple')` | `add('apple')` | |
| Add multiple words | `add_all(['advantage', 'courage'])` | `add_all(['advantage', 'courage'])` | Supports Python `sequence` types or `file` like objects which provide the `read()` method. When dealing with files, you can pass the path to the file. For e.g. `add_all('path/to/bigfile.txt')` In the current implementation, each word should be on a newline. |
| Check if exists? | `in` operator | `in` operator | |
| Search using wildcard expression | `search('a?b*')` | `search('a?b*)` | |
| Search for prefix matches | `search_with_prefix('bar')` | `search_with_prefix('bar')` | |
| Search for similar words within given edit distance. Here, the notion of edit distance is same as Levenshtein distance (LD) | `search_within_distance('apble', dist=1)` | `search_within_distance('apble', dist=1)` | |

| **Interface Description** | **Trie** method | **DAWG** method |
|------------------------------------------------------------------------------------------------------------------------------- |------------------------------------------- |------------------------------------------- |
| Add a single word | `add('apple')` | `add('apple')` |
| Add multiple words | `add_all(['advantage', 'courage'])` | `add_all(['advantage', 'courage'])` |
| Check if exists? | `in` operator | `in` operator |
| Search using wildcard expression | `search('a?b*')` | `search('a?b*)` |
| Search for prefix matches | `search_with_prefix('bar')` | `search_with_prefix('bar')` |
| Search for similar words within given edit distance. Here, the notion of edit distance is same as Levenshtein distance (LD) | `search_within_distance('apble', dist=1)` | `search_within_distance('apble', dist=1)` |


## Trie
Expand Down

0 comments on commit 4d11f54

Please sign in to comment.