Marmelator/aho-corasick
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Issue #1 added documentation for removing overlapping matches

Browse Source
This commit is contained in:
robert-bor 2014-01-31 16:26:36 +01:00
parent 4c8ea8ba57
commit 47383f1dbc
1 changed files with 15 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
README.md
View File

@ -64,6 +64,21 @@ You can now read the set. In this case it will find the following:
* "he" starting at position 2, ending at position 3
* "hers" starting at position 2, ending at position 5
In normal situations you probably want to remove overlapping instances, retaining the longest and left-most
matches.
```java
Trie trie = new Trie().removeOverlaps();
trie.addKeyword("hot");
trie.addKeyword("hot chocolate");
Collection<Emit> emits = trie.parseText("hot chocolate");
```
The removeOverlaps method tells the Trie to remove all overlapping matches. For this it relies on the following
conflict resolution rules: 1) longer matches prevail over shorter matches, 2) left-most prevails over right-most.
There is only one result now:
* "hot chocolate" starting at position 0, ending at position 12
License
-------
Licensed under the Apache License, Version 2.0 (the "License");