Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Experimenting with it, need some heads up #6

Open
rvencu opened this issue Sep 25, 2020 · 0 comments
Open

Experimenting with it, need some heads up #6

rvencu opened this issue Sep 25, 2020 · 0 comments

Comments

@rvencu
Copy link

rvencu commented Sep 25, 2020

Hi, I have this problem at hand: given a text that is stripped of punctuation, basically a long series of words separated by spaces, I need to identify all items present in the trie, with the longest ones starting first.

As an example: if in trie I entered these terms
1 lorem ipsum dolor
2 lorem ipsum
3 dolor

If my text contains 'lorem ipsum dolor' I would like to confirm key 1 as a match and ignore 2 and 3. I need to extract this way all possible matched against the given trie.

I would appreciate a little heads up, maybe some relevant docs about how to manipulate these objects towards my goal.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant